poster

An Optimized Congestion Control Scheme for Mice Flows in Named Data Networking

Authors:

Shanshan Shi,

Jun Li,

Haibo WuAuthors Info & Claims

ICN '19: Proceedings of the 6th ACM Conference on Information-Centric Networking

Pages 155 - 156

https://doi.org/10.1145/3357150.3357409

Published: 24 September 2019 Publication History

Get Access

Abstract

The transmission performance of flows in NDN is greatly dependent on congestion control algorithms. However, current congestion control schemes for NDN are not designed to distinguish flows of different type, and they are relatively conservative for mice flows. This poster proposes a Packet-Pair based startup for NDN congestion control schemes, by exploiting the available bandwidth estimation during the flow startup, to approach the maximum throughput faster. Thus, this technique can improve the transmission efficiency of mice flows without harming elephant flows. We evaluate our proposal on ndnSIM and prove its effectiveness.

References

[1]

Neal Cardwell, Yuchung Cheng, C Stephen Gunn, Soheil Hassas Yeganeh, and Van Jacobson. 2016. BBR: Congestion-based congestion control. (2016).

Google Scholar

[2]

Ningning Hu and Peter Steenkiste. 2002. Estimating available bandwidth using packet pair probing. Technical Report. CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE.

Google Scholar

[3]

Spyridon Mastorakis, Alexander Afanasyev, Ilya Moiseenko, and Lixia Zhang. 2015. ndnSIM 2.0: A new version of the NDN simulator for NS-3. NDN, Technical Report NDN-0028 (2015).

Google Scholar

[4]

Klaus Schneider, Cheng Yi, Beichuan Zhang, and Lixia Zhang. 2016. A practical congestion control scheme for named data networking. In Proceedings of the 3rd ACM Conference on Information-Centric Networking. ACM, 21--30.

Digital Library

Google Scholar

[5]

Lixia Zhang, Alexander Afanasyev, Jeffrey Burke, Van Jacobson, Patrick Crowley, Christos Papadopoulos, Lan Wang, Beichuan Zhang, et al. 2014. Named data networking. ACM SIGCOMM Computer Communication Review 44, 3 (2014), 616:13 2019/7/276-73.

Digital Library

Google Scholar

Cited By

View all

Shi SLi JHan BWu HMa YDong QSchotten H(2021)Multi-Path Forwarding Strategy for Named Data Networking Based on Pending Interests and Available Bandwidth2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00105(731-737)Online publication date: Sep-2021
https://doi.org/10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00105

Index Terms

An Optimized Congestion Control Scheme for Mice Flows in Named Data Networking
1. Networks
  1. Network protocols
    1. Network protocol design
    2. Transport protocols

Recommendations

A Practical Congestion Control Scheme for Named Data Networking
ACM-ICN '16: Proceedings of the 3rd ACM Conference on Information-Centric Networking

Traditional congestion control mechanisms are designed for end-to-end connections and do not fit the Named Data Networking (NDN) architecture, in which content can be retrieved from multiple sources and through multiple paths. To fully exploit the NDN ...
An improved hop-by-hop interest shaper for congestion control in named data networking

Hop-by-hop interest shaping has been proposed as a viable congestion control mechanism in Named Data Networking (NDN). Interest shaping exploits the strict receiver-driven traffic pattern and the symmetric bidirectional forwarding in NDN to control the ...
Congestion control in named data networking - A survey

As a typical Information Centric Networking, Named Data Networking (NDN) has attracted wide research attentions in recent years. NDN evolves today's host-centric network architecture TCP/IP to a data-centric network architecture. It turns the end-to-end ...

Comments

Information & Contributors

Information

Published In

ICN '19: Proceedings of the 6th ACM Conference on Information-Centric Networking

September 2019

187 pages

ISBN:9781450369701

DOI:10.1145/3357150

Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 September 2019

Check for updates

Qualifiers

Poster
Research
Refereed limited

Funding Sources

National Natural Science Foundation of China

Conference

ICN '19

Sponsor:

SIGCOMM

ICN '19: 6th ACM Conference on Information-Centric Networking

September 24 - 26, 2019

Macao, China

Acceptance Rates

Overall Acceptance Rate 133 of 482 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
109
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 09 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Shi SLi JHan BWu HMa YDong QSchotten H(2021)Multi-Path Forwarding Strategy for Named Data Networking Based on Pending Interests and Available Bandwidth2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00105(731-737)Online publication date: Sep-2021
https://doi.org/10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00105

View Options

Login options

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

Cited By

Index Terms

Recommendations

A Practical Congestion Control Scheme for Named Data Networking

An improved hop-by-hop interest shaper for congestion control in named data networking

Congestion control in named data networking - A survey

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Funding Sources

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A Practical Congestion Control Scheme for Named Data Networking

An improved hop-by-hop interest shaper for congestion control in named data networking

Congestion control in named data networking - A survey

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations