Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3538806.3538819acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiccbnConference Proceedingsconference-collections
research-article

A Caching Mechanism for SVRF-based Multicast Packet Forwarding Engines

Published: 14 July 2022 Publication History

Abstract

To meet the rapid development of high-performance routers and switches, Packet Forwarding Engine (PFE), as the essential component of high-performance routers and switches, determines forwarding packets along with a port or multiple egress ports through PFE, and puts higher requirements for its used group member query algorithm. Multicast consists of sending the same packet to several recipients and the recipients represent a subset of all the machines of a network. And selected group membership algorithm determines the efficiency of packet forwarding of PFE, also as the core component of PFE. Conventional SVRF-based multi-answer group membership testing identifies the requested egresses for each membership query based on an output port bitmap. However, conventional SVRF is inefficient because it requires unnecessarily many tag bits when the port density of PFEs is high. In this paper, we propose a novel strategy that is based on SVRF and called Virtual Output Port Bitmap Cache (VOPBC). In SVRF w/VOPBC, we introduce a virtual output port bitmap cache table which includes the most frequently reused combinations of output port bitmaps (OPB). Considering the popularity, most combinations of OPB never appear, according to caches all the combinations of most popular OPBs in the table that may appear, offer remarkable performance in reducing the memory space and process time. And we have proved that our proposed SVRF w/VOPBC method has a significant improvement in time and space compared with the original SVRF through mathematical models and simulations respectively under different popular, especially when the output port is frequently reused.

References

[1]
H.C.B. Chan, H. M. Alnuweiri, and V.C.M. Leung. 1999. A framework for optimizing the cost and performance of next-generation IP routers. IEEE J. Sel. Areas Commun. 17, 6, 1013–1029.
[2]
D. Cerovic, V. Del Piccolo, A. Amamou, K. Haddadou, and G. Pujolle. 2018. Fast packet processing: a survey. IEEE Commun. Surv. Tut. 20, 4, 3645–3676.
[3]
B. Zhang and H. T. Mouftah. 2003 Forwarding state scalability for multicast provisioning in IP networks. IEEE Commun. Mag 41, 6, 46–51.
[4]
J. Tapolcai, J. Bíró, P. Babarczi, A. Gulyás, Z. Heszberger, and D. Trossen, 2015. Optimal false-positive-free bloom filter design for scalable multicast forwarding. IEEE/ACM Trans. Netw 23, 6, 1832–1845. 
[5]
A. Benslimane. 2007. Multimedia Multicast on the Internet. London, UK.
[6]
B. Gronvall. Scalable multicast forwarding. SIGCOMM Comput. Commun. Rev., 32(1):68–68, 2002.
[7]
W. Cui and C. Qian. 2015. Scalable and Load-Balanced Data Center Multicast. In Proceedings of IEEE Global Communications Conference (GLOBECOM’15). 1–6.
[8]
W. K. Jia and L. C. Wang. 2013. A Unified Unicast and Multicast Routing and Forwarding Algorithm for Software-Defined Datacenter Networks. IEEE Journal on Selected Areas in Communications 31, 12 (Dec. 2013), 2646–2657.
[9]
L. Huang and J. Nie. 2010. Using Pareto Principle to Improve Efficiency for Selection of Qos Web Services. In Proceedings of the 7th IEEE Consumer Communications and Networking Conference(CCNC’10). 1–2.
[10]
Huang C Y, Kuo C S, and Luan S P. 2014. Evaluation and application of bounded generalized pareto analysis to fault distributions in open source software. IEEE Transactions on Reliability. 63,1 (Feb. 2014), 309-319.
[11]
F. Yu and R. Katz. Efficient Multi-Match Packet Classification and Lookup with TCAM. In Proceedings of IEEE Symposium on High Performance Interconnects (HotI), Stanford, CA, Aug. 2004.
[12]
E. Spitznagel, D. Taylor, and J. Turner. 2003. Packet classification using extended TCAMs. In Proceedings of IEEE International Conference on Network Protocols (ICNP).
[13]
P. Gupta and N. McKeown. Algorithms for packet classification. IEEE Network, 15(2):24–32, 2001.
[14]
Cunsheng Ding, Dingyi Pei, and Arto Salomaa. 1996. Chinese remainder theorem: applications in computing, coding, cryptography. World Scientific.
[15]
Z. Jin and W. -K. Jia. 2021. DH-SVRF: A Reconfigurable Unicast/Multicast Forwarding for High-Performance Packet Forwarding Engines. in IEEE Transactions on Parallel and Distributed Systems. 33, 5(May. 2021), 1262–1275.
[16]
M. Schrage. 2017. AI is going to change the 80/20 rule. Retrieved Feb 2017 from https://hbr.org/2017/02/ai-is-going-to-change-the-8020-rule.
[17]
H. Zhu. 2021. Social Development Paradox: An E-CARGO Perspective on the Formation of the Pareto 80/20 Distribution,” IEEE Trans. Comput. Social Syst., early access.
[18]
I. Ullah, G. Doyen, G. Bonnet, and D. Gaiti. 2012. A survey and synthesis of user behavior measurements in P2P streaming systems. IEEE Commun. Surv. Tut. 14, 3, 734–749.
[19]
A. Balachandran. 2014. Large scale data analytics of user behavior for improving content delivery. PhD Thesis, US Army.
[20]
H. Arai, M. Kimoto, T. Iio, K. Shimohara, R. Matsumura and M. Shiomi. 2019. How Can Robot's Gaze Ratio and Body Direction Show an Awareness of Priority to the People with Whom it is Interacting? IEEE Robotics and Automation Letters. 4, 4(Oct. 2019), 3798-3805.
[21]
M. J. Akhbarizadeh, M. Nourani, R. Panigrahy and S. Sharma0. 2007. A TCAM-Based Parallel Architecture for High-Speed Packet Forwarding0. IEEE Transactions on Computers. 56. 1(Jan. 2007), 58-72.
[22]
Huang, K., Su, X. 2018. Scalable datacenter multicast using in-packet bitmaps. Distrib Parallel Databases. 36, 445–460.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICCBN '22: Proceedings of the 10th International Conference on Communications and Broadband Networking
February 2022
82 pages
ISBN:9781450387439
DOI:10.1145/3538806
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 ACM 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 July 2022

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Correlation
  2. Membership Querying
  3. Multicast
  4. Packet Forwarding Engine (PFE)
  5. Popularity
  6. Scalar-pair Vectors Routing and Forwarding (SVRF)

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

ICCBN 2022

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Nov 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media