< draft-chung-dtn-extension-prophet-icn-03.txt   draft-chung-dtn-extension-prophet-icn-04.txt >
Delay-Tolerant Networking Y. W. Chung Delay-Tolerant Networking Y. W. Chung
Internet-Draft M. W. Kang Internet-Draft M. W. Kang
Intended status: Informational D. Y. Seo Intended status: Informational D. Y. Seo
Expires: April 22, 2019 Y. Kim Expires: January 08, 2020 Y. Kim
Soongsil University Soongsil University
October 22, 2018 July 08, 2019
Extension of Probabilistic Routing Protocol using History of Extension of Probabilistic Routing Protocol using History of
Encounters and Transitivity for Information Centric Network Encounters and Transitivity for Information Centric Network
draft-chung-dtn-extension-prophet-icn-03.txt draft-chung-dtn-extension-prophet-icn-04.txt
Abstract Abstract
This document proposes extension of probabilistic routing protocol This document proposes extension of probabilistic routing protocol
using history of encounters and transitivity (PRoPHET) for using history of encounters and transitivity (PRoPHET) for
information centric network. information centric network.
Status of This memo Status of This memo
This Internet-Draft is submitted in full conformance with the This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79. provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/. Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six Internet-Drafts are draft documents valid for a maximum of six
months and may be updated, replaced, or obsoleted by other documents months and may be updated, replaced, or obsoleted by other documents
at any time. It is inappropriate to use Internet-Drafts as at any time. It is inappropriate to use Internet-Drafts as
reference material or to cite them other than as "work in reference material or to cite them other than as "work in progress."
progress."
This Internet-Draft will expire on April 22, 2019. This Internet-Draft will expire on January 08, 2020.
Copyright Notice Copyright Notice
Copyright (c) 2018 IETF Trust and the persons identified as the Copyright (c) 2019 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with carefully, as they describe your rights and restrictions with
respect to this document. Code Components extracted from this respect to this document. Code Components extracted from this
document must include Simplified BSD License text as described in document must include Simplified BSD License text as described in
Section 4.e of the Trust Legal Provisions and are provided without Section 4.e of the Trust Legal Provisions and are provided without
skipping to change at page 2, line 25 skipping to change at page 2, line 25
2. Conventions and Terminology ................................. 3 2. Conventions and Terminology ................................. 3
2.1. Conventions ............................................ 3 2.1. Conventions ............................................ 3
2.2. Terminology ............................................ 3 2.2. Terminology ............................................ 3
3. Forwarding of Interest and Data for ICN ..................... 3 3. Forwarding of Interest and Data for ICN ..................... 3
3.1. Delivery predictability of PRoPHET ..................... 3 3.1. Delivery predictability of PRoPHET ..................... 3
3.2. Extension for Interest forwarding ...................... 4 3.2. Extension for Interest forwarding ...................... 4
3.3. Extension for Data forwarding .......................... 5 3.3. Extension for Data forwarding .......................... 5
3.4. Extension for caching .................................. 6 3.4. Extension for caching .................................. 6
3.5. Operation of the proposed extension .................... 7 3.5. Operation of the proposed extension .................... 7
3.6. Extension for overload control ........................ 13 3.6. Extension for overload control ........................ 13
3.7. Overload control based on context information ......... 15
4. Security Considerations .................................... 15 4. Security Considerations .................................... 15
5. IANA Considerations ........................................ 15 5. IANA Considerations ........................................ 15
6. References ................................................. 15 6. References ................................................. 16
6.1. Normative References .................................. 15 6.1. Normative References .................................. 16
6.2. Informative References ................................ 15 6.2. Informative References ................................ 16
1. Introduction 1. Introduction
In Information centric network (ICN), a node requests Data by In Information centric network (ICN), a node requests Data by
sending Interest packet and this Interest packet is forwarded sending Interest packet and this Interest packet is forwarded
through ICN routers. A router with the requested Data replies to the through ICN routers. A router with the requested Data replies to the
Interest to the requester and the Interest is delivered through a Interest to the requester and the Interest is delivered through a
reverse path of the forwarded Interest. ICN router manages content reverse path of the forwarded Interest. ICN router manages content
store (CS), pending interest table (PIT), and forwarding information store (CS), pending interest table (PIT), and forwarding information
base (FIB) [George2014]. In CS, cached data is stored for future use. base (FIB) [George2014]. In CS, cached data is stored for future use.
skipping to change at page 15, line 5 skipping to change at page 15, line 5
3) Scheme F: the node D removes the delivered Data d_2 from its Data 3) Scheme F: the node D removes the delivered Data d_2 from its Data
list and sets anti-Data flag for the Data d_2 in PAID table, and does list and sets anti-Data flag for the Data d_2 in PAID table, and does
not accept the d_2 again. Further, if node D contacts any node, it not accept the d_2 again. Further, if node D contacts any node, it
shares anti-Data flag with the contact node. If the contact node has shares anti-Data flag with the contact node. If the contact node has
the Data d_2 already, it removes the Data d_2 from Data list and sets the Data d_2 already, it removes the Data d_2 from Data list and sets
anti-Data flag for the Data d_2 in PAID table, and does not accept anti-Data flag for the Data d_2 in PAID table, and does not accept
the Data d_2 again. Otherwise, it just sets anti-Data flag for the the Data d_2 again. Otherwise, it just sets anti-Data flag for the
Data d_2 in PAID table and does not accept the d_2 again. Data d_2 in PAID table and does not accept the d_2 again.
3.7. Overload control based on context information
The overload control schemes in Section 3.6 can be applied
dynamically, depending on the context information of Interest and
Data, since forwarding of Interest and Data should be treated
efficiently by considering context information. In the proposed
scheme, a non-overload control scheme is basically applied and if a
condition is met, overload control scheme proposed in Section 3.6 is
applied. Although numerous context information can be used, we
consider the number of hop counts, TTL, and the number of requester
nodes are used as examples.
1) Number of hop counts: In this case, if the number of hop counts of
Interest and Data is not larger than a threshold, an overload control
scheme is not applied. On the other hand, if the number of hop counts
is larger than a threshold, an overload control scheme is applied.
The threshold value of Interest and Data can be defined differently
depending on the urgency of the Interest and Data. For example, if
Interest and Data should be delivered urgently, it can have a higher
threshold value than the case where Interest and Data are not urgent.
2) TTL: In this case, if TTL of Interest and Data is lager than a
threshold, an overload control scheme is not applied. On the other
hand, if TTL of Interest and Data is not larger than a threshold,
an overload control scheme is applied. This is because if TTL of
Interest and Data is larger, it has been forwarded more, and thus
overload control scheme is needed to avoid unnecessary forwarding.
3) Number of requester nodes: In this case, if the number of
requester nodes of Interest and Data is larger than a threshold, an
overload control scheme is not applied. On the other hand, if the
number of requester nodes of Interest and Data is not larger than a
threshold, an overload control scheme is applied. This is because, if
the number of request nodes is smaller, an overload control scheme
should be applied earlier to avoid unnecessary forwarding.
4. Security Considerations 4. Security Considerations
TBD TBD
5. IANA Considerations 5. IANA Considerations
TBD TBD
6. References 6. References
6.1. Normative References 6.1. Normative References
[RFC6693] Lindgren, A., Doria, A., Davies, E., Grasic, S, [RFC6693] Lindgren, A., Doria, A., Davies, E., Grasic, S,
"Probabilistic routing protocol for intermittently "Probabilistic routing protocol for intermittently
connected networks", RFC 6693, August 2012. connected networks", RFC 6693, August 2012.
6.2. Informative References 6.2. Informative References
[Geroge2014] [George2014]
Xylomenos, G. Ververidis, C. N., Siris, V. A., Fotiou, N., Xylomenos, G. Ververidis, C. N., Siris, V. A., Fotiou, N.,
Tsilopoulos, C., Vasilakos, X., Katsaros, K. V. Polyzos, G. Tsilopoulos, C., Vasilakos, X., Katsaros, K. V. Polyzos, G.
C., "A Survey of Information-Centric Networking Research", C., "A Survey of Information-Centric Networking Research",
IEEE Communications Surveys and Tutorials, Vol. 16, No. 2, IEEE Communications Surveys and Tutorials, Vol. 16, No. 2,
2014. 2014.
[Edo2014] Monticelli, E., Schubert, B. M., Arumaithurai, M., Fu, X., [Edo2014] Monticelli, E., Schubert, B. M., Arumaithurai, M., Fu, X.,
Ramakrishnan, K. K., "An Information Centric Approach for Ramakrishnan, K. K., "An Information Centric Approach for
Communications in Disaster Situations," Proceedings of Communications in Disaster Situations," Proceedings of
IEEE Local & Metropolitan Area Networks, USA, May 2014. IEEE Local & Metropolitan Area Networks, USA, May 2014.
 End of changes. 10 change blocks. 
11 lines changed or deleted 47 lines changed or added

This html diff was produced by rfcdiff 1.47. The latest version is available from http://tools.ietf.org/tools/rfcdiff/