Efficient named data networking using practical congestion control technique
-
https://doi.org/10.14419/ijet.v7i1.1.9707
Received date: February 25, 2018
Accepted date: February 25, 2018
Published date: December 21, 2017
-
Abstract
For a Named Data Networking (NDN), Components of traditional congestion control not fitted and they are predetermined to the associations of end-to end, where with the help of numerous methods and sources recoveries the substances. For complete misuse of NDN engineering, a control of clog conspire should be taken in reserving of in-organize impacts, sending in multiple routes, and multiple cast data conveyance. Arrangement may not be accepted a connection transmission capacities or sizes of Data bundle which are known, because the suppositions cannot holding or joins of overlay, remote connections, or various data differing parcel sizes applications. The PCON proposed here which is a viable clog control plan for addressing the problems mentioned above. PCON identifies blockage in light of the CoDel AQM (by measuring bundle lining time), at that point signals it towards shoppers by expressly denoting certain parcels, with the goal that downstream switches can occupy movement to elective ways and buyers can able to lessen the sending rates of their interest. Recreations demonstrate by us is, sending PCON's adjustment achieves more advanced aggregate output compared to the typical system if we keep up comparable decency of RTT. Additionally, IP passages change limits can be adjusted by PCON, remote connections, circumstances which bounce when jump plans are not considerable.
-
References
- E. Blanton, K. Fall, and M. Allman. A conservative sack-based loss recovery algorithm for tcp. RFC 3517, 2003.
- S. Braun, M. Monti, M. Sifalakis, and C. Tschudin. An empirical study of receiver-based aimd flow-control for ccn. In IEEE ICCCN, 2013. https://doi.org/10.1109/ICCCN.2013.6614106.
- G. Carofiglio, M. Gallo, and L. Muscariello. Joint hop-by-hop and receiver-driven interest control protocol for content-centric networks. In ACM ICN workshop, 2012. https://doi.org/10.1145/2342488.2342497.
- G. Carofiglio, M. Gallo, L. Muscariello, M. Papalini, and S. Wang. Optimal multipath congestion control and request forwarding in in-formation-centric networks. In ICNP, 2013. https://doi.org/10.1109/ICNP.2013.6733576.
- A. Detti, C. Pisa, and N. Blefari Melazzi. Modeling multipath for-warding strategies in information centric networks. In IEEE INFO-COM WKSHPS, 2015. https://doi.org/10.1109/INFCOMW.2015.7179405.
- V. Jacobson. Congestion avoidance and control. In ACM SIGCOMM CCR, 1988. https://doi.org/10.1145/52324.52356.
- V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H.Briggs, and R. L. Braynard. Networking named content. In ACM CoNEXT, 2009. https://doi.org/10.1145/1658939.1658941.
- K. Lei, C. Hou, L. Li, and K. Xu. A rcp-based congestion control protocol in named data networking. In CyberC, 2015. https://doi.org/10.1109/CyberC.2015.67.
-
Downloads
-
How to Cite
A, R. (2017). Efficient named data networking using practical congestion control technique. International Journal of Engineering and Technology, 7(1.1), 301-302. https://doi.org/10.14419/ijet.v7i1.1.9707
