poster

Analysis of mutual exclusion overhead of NDN packet forwarding on multi-core software router

Authors:

Junji Takemasa,

Yuki Koizumi,

Toru HasegawaAuthors Info & Claims

ICN '18: Proceedings of the 5th ACM Conference on Information-Centric Networking

Pages 198 - 199

https://doi.org/10.1145/3267955.3269016

Published: 21 September 2018 Publication History

Get Access

Abstract

This paper analyzes mutual exclusion overhead caused by Pending Interest Table (PIT) updates on multi-core Named Data Networking (NDN) software routers. The analysis reveals that an instruction to make the mutual exclusion atomic results in a bottleneck for high speed forwarding.

References

[1]

Intel Corporation. 2018. Intel® 64 and IA-32 Architectures Software Developer's Manual Volume 3A: System Programming Guide, Part 1. Retrieved July 23, 2018 from http://software.intel.com/sites/default/files/managed/7c/f1/253668-sdm-vol-3a.pdf

Google Scholar

[2]

Lorenzo Saino, Ioannis Psaras, and George Pavlou. 2016. Understanding Sharded Caching Systems. In Proceedings of IEEE INFOCOM. IEEE, 1--9.

Digital Library

Google Scholar

[3]

Won So, Ashok Narayanan, and David Oran. 2013. Named Data Networking on a Router: Fast and DoS-resistant Forwarding with Hash Tables. In Proceedings of ACM/IEEE ANCS. 215--226.

Digital Library

Google Scholar

[4]

Junji Takemasa, Yuki Koizumi, and Toru Hasegawa. 2017. Toward an Ideal NDN Router on a Commercial Off-the-shelf Computer. In Proceedings of ACM ICN. 43--53.

Digital Library

Google Scholar

Cited By

View all

Yamaguchi AMizuno O(2020)Reducing Processing Delay and Node Load Using Push-Based Information-Centric Networking2020 3rd World Symposium on Communication Engineering (WSCE)10.1109/WSCE51339.2020.9275572(59-63)Online publication date: 9-Oct-2020
https://doi.org/10.1109/WSCE51339.2020.9275572
Takemasa JTagami AKoizumi YHasegawa T(2020)Load Balancing for Stateful Forwarding by Mitigating Heavy Hitters: A Case for Multi-Threaded NDN Software RoutersIEEE Access10.1109/ACCESS.2020.30185558(155071-155085)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3018555
Yamaguchi AMizuno O(2019)Extension of Information-Centric Networking for Push-Based Contents Deliver2019 2nd World Symposium on Communication Engineering (WSCE)10.1109/WSCE49000.2019.9041026(173-178)Online publication date: Dec-2019
https://doi.org/10.1109/WSCE49000.2019.9041026

Index Terms

Analysis of mutual exclusion overhead of NDN packet forwarding on multi-core software router
1. Networks
  1. Network types
    1. Packet-switching networks

Recommendations

Space-efficient FCFS group mutual exclusion

In the group mutual exclusion problem [Y. Joung, Asynchronous group mutual exclusion, Distrib. Comput. 13 (2000) 189], which generalizes mutual exclusion [E. Dijkstra, Solution of a problem in concurrent programming control, Comm. ACM 8 (9) (1965) 569], ...
(h, k)-Arbiters for h-out-of-k mutual exclusion problem

h-Out-of-k mutual exclusion is a generalization of the 1-mutual exclusion problem, where there are k units of shared resources and each process requests h (1 ≤ h ≤ k) units at the same time. Though k-arbiter has been shown to be a quorum-based solution ...
A survey of permission-based distributed mutual exclusion algorithms

The problem of mutual exclusion in distributed systems has attracted considerable attention over the last two decades. The mutual exclusion problem requires that, at a time, only one of the contending processes be allowed to enter its critical section (...

Comments

Information & Contributors

Information

Published In

ICN '18: Proceedings of the 5th ACM Conference on Information-Centric Networking

September 2018

230 pages

ISBN:9781450359597

DOI:10.1145/3267955

General Chairs:
Edmund Yeh
Northeastern University
,
David Oran
MIT Media Lab

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: 21 September 2018

Check for updates

Author Tags

Qualifiers

Poster

Funding Sources

Grant-in-Aid for JSPS Fellows
HORIZON 2020 EU-Japan ICN2020 Project

Conference

ICN '18

Sponsor:

SIGCOMM

ICN '18: 5th ACM Conference on Information-Centric Networking

September 21 - 23, 2018

Massachusetts, Boston

Acceptance Rates

ICN '18 Paper Acceptance Rate 17 of 57 submissions, 30%;

Overall Acceptance Rate 133 of 482 submissions, 28%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
63
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yamaguchi AMizuno O(2020)Reducing Processing Delay and Node Load Using Push-Based Information-Centric Networking2020 3rd World Symposium on Communication Engineering (WSCE)10.1109/WSCE51339.2020.9275572(59-63)Online publication date: 9-Oct-2020
https://doi.org/10.1109/WSCE51339.2020.9275572
Takemasa JTagami AKoizumi YHasegawa T(2020)Load Balancing for Stateful Forwarding by Mitigating Heavy Hitters: A Case for Multi-Threaded NDN Software RoutersIEEE Access10.1109/ACCESS.2020.30185558(155071-155085)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3018555
Yamaguchi AMizuno O(2019)Extension of Information-Centric Networking for Push-Based Contents Deliver2019 2nd World Symposium on Communication Engineering (WSCE)10.1109/WSCE49000.2019.9041026(173-178)Online publication date: Dec-2019
https://doi.org/10.1109/WSCE49000.2019.9041026

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.

PDF

eReader

View online with eReader.

eReader

Cited By

Index Terms

Recommendations

Space-efficient FCFS group mutual exclusion

(h, k)-Arbiters for h-out-of-k mutual exclusion problem

A survey of permission-based distributed mutual exclusion algorithms

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

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

Space-efficient FCFS group mutual exclusion

(h, k)-Arbiters for h-out-of-k mutual exclusion problem

A survey of permission-based distributed mutual exclusion algorithms

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

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

Share

Share this Publication link

Share on social media

Affiliations