A REVIEW ON ADAPTIVE FORWARDING IN NAMED DATA NETWORKING
DOI:
https://doi.org/10.29121/ijetmr.v5.i2.2018.645Keywords:
Named Data Networking, Forwarding Information Base, Routing ProtocolAbstract
Named Data Networking (NDN) is an as of late proposed new Internet architecture. By naming information rather than location, it changes the essential system service abstraction from "transmitting packets to offered destinations" to "retrieving information of given names." This major change makes a plenitude of new opportunities as well the same number of scholarly difficulties in application advancement, system routing and sending correspondence security and protection. In this study, researchers will propose a new architecture of NDN with smart and automated forwarding information based which is more versatile and proficient.
Downloads
References
http://www.cisco.com/en/US/products/ps6599/products_white_paper 09186a00800a4409.sht
http://www.scalable-networks.com.
Abilene topology data. http://www.cs.utexas.edu/~yzhang/research/AbileneTM/.
CCNPing. http://github.com/NDN-Routing/ccnping.
CCNx. http://www.ccnx.org/.
COntent Mediator architecture for content-aware nETworks
(COMET).http://www.cometproject.org/.
Mini-CCNx. http://github.com/carlosmscabral/mn-ccnx.
NDN Testbed. http://named-data.net/ndn-testbed.
NS-3 Network Simulator. http://www.nsnam.org/.
PURSUIT Internet Technology. http://www.fp7-pursuit.eu/PursuitWeb/.
The FP7 4WARD Project. http://www.4ward-project.eu/.
Alexander Afanasyev, IlyaMoiseenko, and Lixia Zhang. ndnSIM: NDN simulator for NS-3. Technical Report NDN-0005, NDN Project, July 2012.
C. Alaettinoglu, V. Jacobson, and H. Yu. Towards Milli-Second IGP Convergence. Internet Draft draft-alaettinoglu-isis-convergence-00.txt, November2000.
A. Atlas. U-turn Alternates for IP/LDP Fast-Reroute. Draft-atlas-ip-local-protect-uturn-03, February 2006.
B. Atlas and A. Zinin. RFC 5286: Basic Specification for IP Fast Reroute: Loop-Free Alternates. RFC 5286, 2008. DOI: https://doi.org/10.17487/rfc5286
Paul Baran. On Distributed Communications Networks. IEEE Transactions on Communications Systems, 12(1):1–9, March 1964. DOI: https://doi.org/10.1109/TCOM.1964.1088883
L. S. Brakmo and L. L. Peterson. TCP Vegas: End to End Congestion Avoidance on a Global Internet. IEEE J.Sel. A. Commun., 13(8):1465–1480, September 2006. DOI: https://doi.org/10.1109/49.464716
S. Braun, M. Monti, M. Sifalakis, and C. Tschudin. An Empirical Study of Receiver-Based AIMD Flow-Control Strategies for CCN. In Proceedings of ICCCN, 2013. DOI: https://doi.org/10.1109/ICCCN.2013.6614106
Jeff Burke, Alex Horn and Alessandro Marianantoni. Authenticated Lighting Control Using Named Data Networking. Technical Report NDN-0011, NDN Project, October 2012.
Matthew Caesar, Martin Casado, TeemuKoponen, Jennifer Rexford, and Scott Shenker Dynamic Route Recomputation Considered Harmful. ACM SIGCOMM Computer Communication Review (CCR), 40(2):66–71, April 2010. DOI: https://doi.org/10.1145/1764873.1764885
G. Carofiglio, M. Gallo, and L. Muscariello. ICP: Design and evaluation of an Interest control protocol for content-centric networking. In Proceedings of IEEE INFOCOMM NOMEN Workshop, 2012. DOI: https://doi.org/10.1109/INFCOMW.2012.6193510
G. Carofiglio, M. Gallo, L. Muscariello, M. Papalini, and Sen Wang. Optimalmultipath congestion control and request forwarding in Information-Centric Networks. In Proceedings of IEEE ICNP, 2013. DOI: https://doi.org/10.1109/ICNP.2013.6733576
Giovanna Carofiglio, Massimo Gallo, and Luca Mus Cariello. Joint Hop-by-hop and Receiver-driven Interest Control Protocol for Content-centric Networks. In Proceedings of ACM SIGCOMM ICN Workshop, 2012. DOI: https://doi.org/10.1145/2342488.2342497
Giovanna Carofiglio, Massimo Gallo, Luca Mus Cariello, and Michele Papalini. Multipath Congestion Control in Content-Centric Networks. In Proceedings of IEEE INFOCOMM NOMEN Workshop, 2013. DOI: https://doi.org/10.1109/INFCOMW.2013.6970718
A. Demers, S. Keshav, and S. Shenker. Analysis and Simulation of a FairQueueing Algorithm. In Proceedings of SIGCOMM, 1989. DOI: https://doi.org/10.1145/75246.75248
NanditaDukkipati and Nick McKeown. Why Flow-completion Time is the Right Metric for Congestion Control. SIGCOMM Comput. Commun. Rev., 36(1):59–62, January 2006. DOI: https://doi.org/10.1145/1111322.1111336
S. Floyd. Metrics for the Evaluation of Congestion Control Mechanisms. RFC 5166, 2008. DOI: https://doi.org/10.17487/rfc5166
Sally Floyd and Van Jacobson. Random Early Detection gateways for congestion avoidance. IEEE ACM Transactions on Networking, 1(4):397–413, 1993. DOI: https://doi.org/10.1109/90.251892
Pierre Francois, Clarence Filsfils, John Evans, and Olivier Bonaventure. Achieving SubSecond IGP Convergence in Large IP Networks. ACM SIGCOMM Computer Communication Review (CCR), 35(3):35–44, July 2005. DOI: https://doi.org/10.1145/1070873.1070877
A. Ghali, G. Tsudik, and E. Uzun. Needle in a Haystack: Mitigating Content Poisoning in Named-Data Networking. In Proceedings of NDSS SENT Workshop, 2014. DOI: https://doi.org/10.14722/sent.2014.23014
P. Brighten Godfrey, Igor Ganichev, Scott Shenker, and Ion Stoica. Pathletrouting. In Proceedings of ACM SIGCOMM, 2009. DOI: https://doi.org/10.1145/1592568.1592583
Sangtae Ha, Injong Rhee, and LisongXu. CUBIC: A New TCP-friendly Highspeed TCP Variant. SIGOPS Oper. Syst. Rev., 42(5):64–74, July 2008. DOI: https://doi.org/10.1145/1400097.1400105
H. Han, C.V. Hollot, D. Towsley, and Y. Chait. Synchronization of TCP Flows in Networks with Small Drop Tail Buffers. In Proceedings of IEEE CDC-ECC, 2005.
T. Henderson, S. Floyd, A. Gurtov, and Y. Nishida. The New Reno Modification to TCP’s Fast Recovery Algorithm. RFC 6582, 2012. DOI: https://doi.org/10.17487/rfc6582
V. Jacobson. Congestion Avoidance and Control. In Proceedings of SIGCOMM, 1988. DOI: https://doi.org/10.1145/52324.52356
Van Jacobson, Diana K. Smetters, James D. Thornton, Michael F. Plass, Nicholas H. Briggs, and Rebecca L. Braynard. Networking Named Content. In Proceedings of ACM CoNEXT, 2009. DOI: https://doi.org/10.1145/1658939.1658941
Petri Jokela, Andr´asZahemszky, Christian Esteve Rothenberg, SomayaArianfar, and PekkaNikander. LIPSIN: line speed publish/subscribe internetworking. In Proceedings of the ACM SIGCOMM conference on data communication, 2009. DOI: https://doi.org/10.1145/1592568.1592592
Downloads
Published
How to Cite
Issue
Section
License
License and Copyright Agreement
In submitting the manuscript to the journal, the authors certify that:
- They are authorized by their co-authors to enter into these arrangements.
- The work described has not been formally published before, except in the form of an abstract or as part of a published lecture, review, thesis, or overlay journal.
- That it is not under consideration for publication elsewhere.
- That its release has been approved by all the author(s) and by the responsible authorities – tacitly or explicitly – of the institutes where the work has been carried out.
- They secure the right to reproduce any material that has already been published or copyrighted elsewhere.
- They agree to the following license and copyright agreement.
Copyright
Authors who publish with International Journal of Engineering Technologies and Management Research agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors can enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or edit it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
For More info, please visit CopyRight Section
