More Web Proxy on the site http://driver.im/

research-article

MIRCC: Multipath-aware ICN Rate-based Congestion Control

Authors:

Somaya Arianfar,

Dave OranAuthors Info & Claims

ACM-ICN '16: Proceedings of the 3rd ACM Conference on Information-Centric Networking

Pages 1 - 10

https://doi.org/10.1145/2984356.2984365

Published: 26 September 2016 Publication History

Abstract

Information-Centric Network (ICN) has yet to determine its approach to congestion control, including whether window-based or rate-based congestion control would be best. IP window-based schemes have been studied extensively and deployed on a grand scale. Consequently, most ICN congestion control work has concentrated on window-based approaches.

Not only does rate-based congestion control have properties of interest, however, but ICN's well-known differences from IP, including receiver-driven flow control, stateful forwarding, symmetric paths, and lack of installed base may well lead to a different congestion control approach being best for ICN.

This paper presents MIRCC, a rate-based, multipath-aware ICN congestion control approach inspired by but noticeably differing from RCP. We first explain our ICN-appropriate mechanisms for calculating and signaling flow rates. We then present MIRCC's algorithm for calculating per-link rates, and its convergence advantages over RCP's algorithm. Finally, we explore several approaches for making our scheme multipath-aware, finding an interesting solution to this challenging problem. To characterize MIRCC's behavior, we use simulation results throughout.

References

[1]

V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard, “Networking named content,” in Proceedings of CoNEXT '09.1em plus 0.5em minus 0.4emNew York, NY, USA: ACM, 2009, pp. 1–12.

Digital Library

[2]

S. Ha, I. Rhee, and L. Xu, “Cubic: A new tcp-friendly high-speed tcp variant,” SIGOPS Oper. Syst. Rev., vol. 42, no. 5, pp. 64–74, Jul. 2008. {Online}. Available: http://doi.acm.org/10.1145/1400097.1400105

Digital Library

[3]

N. Dukkipati, “Rate control protocol (rcp): Congestion control to make flows complete quickly,” Ph.D. dissertation, Stanford University, Stanford, CA, USA, 2008, aAI3292347.

Digital Library

[4]

G. Carofiglio, M. Gallo, L. Muscariello, M. Papalini, and S. Wang, “Optimal multipath congestion control and request forwarding in information-centric networks,” in Network Protocols (ICNP), 2013 21st IEEE International Conference on, Oct 2013, pp. 1–10.

[5]

S. Oueslati, J. Roberts, and N. Sbihi, “Flow-aware traffic control for a content-centric network,” in INFOCOM, 2012 Proceedings IEEE, March 2012, pp. 2417–2425.

[6]

L. Saino, C. Cocora, and G. Pavlou, “Cctcp: A scalable receiver-driven congestion control protocol for content centric networking,” in 2013 IEEE International Conference on Communications (ICC), June 2013, pp. 3775–3780.

[7]

M. Alizadeh, A. Greenberg, D. A. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan, “Data center tcp (dctcp),” in Proceedings of the ACM SIGCOMM 2010 Conference, New York, NY, USA, 2010, pp. 63–74. {Online}. Available: http://doi.acm.org/10.1145/1851182.1851192

Digital Library

[8]

R. Scheffenegger, B. J. Briscoe, and M. Kühlewind, “Problem Statement and Requirements for Increased Accuracy in Explicit Congestion Notification (ECN) Feedback,” RFC 7560, Oct. 2015. {Online}. Available: https://rfc-editor.org/rfc/rfc7560.txt

[9]

M. Kühlewind and R. Scheffenegger, “TCP Modifications for Congestion Exposure (ConEx),” RFC 7786, May 2016. {Online}. Available: https://rfc-editor.org/rfc/rfc7786.txt

[10]

R. Gonzalez, J. Pradilla, M. Esteve, and C. E. Palau, “Hybrid delay-based congestion control for multipath tcp,” in 2016 18th Mediterranean Electrotechnical Conference (MELECON), April 2016, pp. 1–6.

[11]

B. Briscoe, “Flow rate fairness: Dismantling a religion,” SIGCOMM Comput. Commun. Rev., vol. 37, no. 2, pp. 63–74, Mar. 2007.

Digital Library

[12]

K. Lei, C. Hou, L. Li, and K. Xu, “A rcp-based congestion control protocol in named data networking,” in Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2015 International Conference on, Sept 2015, pp. 538–541.

Digital Library

[13]

Y. Wang, N. Rozhnova, A. Narayanan, D. Oran, and I. Rhee, “An improved hop-by-hop interest shaper for congestion control in named data networking,” in Proceedings of the 3rd ACM SIGCOMM Workshop on Information-centric Networking, New York, NY, USA, 2013, pp. 55–60.

Digital Library

[14]

E. M. Yeh, T. Ho, Y. Cui, R. Liu, M. Burd, and D. Leong, “Forwarding, caching and congestion control in named data networks,” CoRR, vol. abs/1310.5569, 2013.

[15]

S. Floyd, “Tcp and explicit congestion notification,” ACM SIGCOMM Computer Communication Review, vol. 24, no. 5, pp. 8–23, 1994.

Digital Library

[16]

D. Wischik, C. Raiciu, A. Greenhalgh, and M. Handley, “Design, implementation and evaluation of congestion control for multipath tcp,” in Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation, Berkeley, CA, USA, 2011, pp. 99–112.

Digital Library

[17]

D. Katabi, M. Handley, and C. Rohrs, “Congestion control for high bandwidth-delay product networks,” ACM SIGCOMM Computer Communication Review, vol. 32, no. 4, pp. 89–102, 2002.

Digital Library

[18]

N. Dukkipati and N. McKeown, “Why flow-completion time is the right metric for congestion control,” ACM SIGCOMM Computer Communication Review, vol. 36, no. 1, pp. 59–62, 2006.

Digital Library

[19]

Y. Zhang, S. Jain, and D. Loguinov, “Towards experimental evaluation of explicit congestion control,” Computer Networks, vol. 53, no. 7, pp. 1027–1039, 2009.

Digital Library

[20]

L. Jose, L. Yan, M. Alizadeh, G. Varghese, N. McKeown, and S. Katti, “High speed networks need proactive congestion control,” in Proceedings of the 14th ACM Workshop on Hot Topics in Networks.1em plus 0.5em minus 0.4emACM, 2015, p. 14.

Digital Library

[21]

The ccnx project. {Online}. Available: http://www.ccnx.org

[22]

Named data networking. {Online}. Available: https://named-data.net

[23]

P. Jokela, A. Zahemszky, C. Esteve Rothenberg, S. Arianfar, and P. Nikander, “Lipsin: Line speed publish/subscribe inter-networking,” in Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication, New York, NY, USA, 2009, pp. 195–206.

Digital Library

[24]

I. Psaras, L. Saino, and G. Pavlou, “Revisiting resource pooling: The case for in-network resource sharing,” in Proceedings of the 13th ACM Workshop on Hot Topics in Networks.1em plus 0.5em minus 0.4emACM, 2014, p. 24. .

Digital Library

Cited By

ASAEDA HMATSUZONO KHAYAMIZU YHtet HLAING HOOKA A(2024)A Survey of Information-Centric Networking: The Quest for InnovationIEICE Transactions on Communications10.1587/transcom.2023EBI0001E107.B:1(139-153)Online publication date: 1-Jan-2024
https://doi.org/10.1587/transcom.2023EBI0001
Rodríguez-Pérez MHerrería-Alonso SCarlos López-Ardao JRodríguez-Rubio R(2024)End-to-end active queue management with Named-Data NetworkingJournal of Network and Computer Applications10.1016/j.jnca.2023.103772221:COnline publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1016/j.jnca.2023.103772
Wang YYang WZhou J(2023)A Shared Bottleneck Aware Multi - Path Selection Scheme for NDN2023 IEEE International Conference on High Performance Computing & Communications, Data Science & Systems, Smart City & Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)10.1109/HPCC-DSS-SmartCity-DependSys60770.2023.00061(393-399)Online publication date: 17-Dec-2023
https://doi.org/10.1109/HPCC-DSS-SmartCity-DependSys60770.2023.00061
Show More Cited By

Index Terms

MIRCC: Multipath-aware ICN Rate-based Congestion Control
1. Networks
  1. Network protocols

Recommendations

SMIC: subflow-level multi-path interest control for information centric networking
ICN '18: Proceedings of the 5th ACM Conference on Information-Centric Networking

In this paper, we focus on multi-path transport layer mechanisms of ICN. We first provide the comprehensive analysis of design criteria and possible solutions for designing multi-path Interest forwarding and congestion control mechanisms. We then ...
TCP/ICN: Carrying TCP over Content Centric and Named Data Networks
ACM-ICN '16: Proceedings of the 3rd ACM Conference on Information-Centric Networking

Today's Internet applications and protocols are not compatible with Information Centric Networking (ICN) protocols and there is no straightforward way of rapidly switching protocol architectures. Network operators incrementally deploying an ICN ...
Flash-forward CCN: flow-driven forwarding architecture for content centric networks
ACM-ICN '14: Proceedings of the 1st ACM Conference on Information-Centric Networking

Content-centric Networking (CCN) promises significant advantages over the current Internet architecture by replacing its host-centric design with a content-centric one, and enabling in-network caching and name-based forwarding. However, despite its ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

ACM-ICN '16: Proceedings of the 3rd ACM Conference on Information-Centric Networking

September 2016

275 pages

ISBN:9781450344678

DOI:10.1145/2984356

General Chairs:
Tohru Asami
University of Tokyo, Japan
,
Xiaoming Fu
Goettingen University, Germany
,
Program Chairs:
Jeff Burke
UCLA, USA
,
Dario Rossi
Telecom ParisTech, France
,
Publications Chair:
Ioannis Psaras
UCL, UK

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 September 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICN'16

Sponsor:

SIGCOMM

ICN'16: 3rd International Conference on Information-Centric Networking

September 26 - 28, 2016

Kyoto, Japan

Acceptance Rates

ACM-ICN '16 Paper Acceptance Rate 23 of 84 submissions, 27%;

Overall Acceptance Rate 133 of 482 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
396
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)4

Reflects downloads up to 31 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

ASAEDA HMATSUZONO KHAYAMIZU YHtet HLAING HOOKA A(2024)A Survey of Information-Centric Networking: The Quest for InnovationIEICE Transactions on Communications10.1587/transcom.2023EBI0001E107.B:1(139-153)Online publication date: 1-Jan-2024
https://doi.org/10.1587/transcom.2023EBI0001
Rodríguez-Pérez MHerrería-Alonso SCarlos López-Ardao JRodríguez-Rubio R(2024)End-to-end active queue management with Named-Data NetworkingJournal of Network and Computer Applications10.1016/j.jnca.2023.103772221:COnline publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1016/j.jnca.2023.103772
Wang YYang WZhou J(2023)A Shared Bottleneck Aware Multi - Path Selection Scheme for NDN2023 IEEE International Conference on High Performance Computing & Communications, Data Science & Systems, Smart City & Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)10.1109/HPCC-DSS-SmartCity-DependSys60770.2023.00061(393-399)Online publication date: 17-Dec-2023
https://doi.org/10.1109/HPCC-DSS-SmartCity-DependSys60770.2023.00061
KATO TBANDAI M(2022)A Rate-Based Congestion Control Method for NDN Using Sparse Explicit Rate Notification and AIMD-Based Rate AdjustmentIEICE Transactions on Communications10.1587/transcom.2021EBP3217E105.B:12(1519-1529)Online publication date: 1-Dec-2022
https://doi.org/10.1587/transcom.2021EBP3217
Song SZhang LSchulzrinne HWählisch MZhang L(2022)Effective NDN congestion control based on queue size feedbackProceedings of the 9th ACM Conference on Information-Centric Networking10.1145/3517212.3558088(11-21)Online publication date: 6-Sep-2022
https://dl.acm.org/doi/10.1145/3517212.3558088
Nikzad MJamshidi KBohlooli A(2022)A Responsibility-based Transport Control for Named Data NetworkingFuture Generation Computer Systems10.1016/j.future.2020.01.006106:C(518-533)Online publication date: 22-Apr-2022
https://dl.acm.org/doi/10.1016/j.future.2020.01.006
Zhang YFeng BTian AYu CLiu ZZhang H(2021)Dynamic Transmission Rate Control for Multi-Interface IoT DevicesWireless Communications & Mobile Computing10.1155/2021/99742612021Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1155/2021/9974261
Buragohain MNandi SCarofiglio GOran DOtt JWang L(2021)LPECNProceedings of the 8th ACM Conference on Information-Centric Networking10.1145/3460417.3482976(20-29)Online publication date: 22-Sep-2021
https://dl.acm.org/doi/10.1145/3460417.3482976
Wu FYang WSun MRen JLyu F(2021)Multi-Path Selection and Congestion Control for NDN: An Online Learning ApproachIEEE Transactions on Network and Service Management10.1109/TNSM.2020.304403718:2(1977-1989)Online publication date: Jun-2021
https://doi.org/10.1109/TNSM.2020.3044037
Ye YLee BFlynn RXu JFang GQiao Y(2021)Delay-Based Network Utility Maximization Modelling for Congestion Control in Named Data NetworkingIEEE/ACM Transactions on Networking10.1109/TNET.2021.309017429:5(2184-2197)Online publication date: Oct-2021
https://doi.org/10.1109/TNET.2021.3090174
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents