research-article

Free access

Using MAC addresses as efficient routing labels in data centers

Authors:

Arne Schwabe,

Holger KarlAuthors Info & Claims

HotSDN '14: Proceedings of the third workshop on Hot topics in software defined networking

Pages 115 - 120

https://doi.org/10.1145/2620728.2620730

Published: 22 August 2014 Publication History

PDF eReader

Abstract

A number of new technologies such as cloud services and/or virtualization have changed data center networks in the last few years. The benefits of the techniques are clear but the downside is that more forwarding entries are needed in network switches to support these techniques. Unfortunately, the number of forwarding entries in switches have a hard limit.

We give a formal problem definition for minimizing the number of forwarding entries and a proof that the problem is NP complete.

We show that the destination MAC address can be used as a universal label in software-defined networks and the ARP caches of hosts can exploited as an ingress label table, reducing the size of the forwarding tables of network devices. We have the additional advantage of not requiring a special type of data center network or additional hardware capabilities.

We demonstrate that our technique can solve the problem of FIB sizes by introducing a greedy scheme for all pairs ECMP with a minimal number of FIB entries.

References

[1]

S. A. Cook. The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing, STOC '71, pages 151--158, New York, NY, USA, 1971. ACM.

Digital Library

Google Scholar

[2]

D. P. Dailey. Uniqueness of colorability and colorability of planar 4-regular graphs are np-complete. Discrete Mathematics, 30(3):289--293, 1980.

Digital Library

Google Scholar

[3]

D. Farinacci, V. Fuller, D. Meyer, and D. Lewis. The Locator/ID Separation Protocol (LISP). RFC 6830 (Experimental), Jan. 2013.

Google Scholar

[4]

P. B. Godfrey, I. Ganichev, S. Shenker, and I. Stoica. Pathlet routing. In Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication, SIGCOMM'09, pages 111--122, New York, NY, USA, 2009. ACM.

Digital Library

Google Scholar

[5]

B. Lantz, B. Heller, and N. McKeown. A network in a laptop: Rapid prototyping for software-defined networks. In Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks, Hotnets-IX, pages 19:1--19:6, New York, NY, USA, 2010. ACM.

Digital Library

Google Scholar

[6]

T. Li, B. Cole, P. Morton, and D. Li. Cisco Hot Standby Router Protocol (HSRP). RFC 2281 (Informational), Mar. 1998.

Digital Library

Google Scholar

[7]

S. Nadas. Virtual Router Redundancy Protocol (VRRP) Version 3 for IPv4 and IPv6. RFC 5798 (Proposed Standard), Mar. 2010.

Google Scholar

[8]

R. Niranjan Mysore, A. Pamboris, N. Farrington, N. Huang, P. Miri, S. Radhakrishnan, V. Subramanya, and A. Vahdat. Portland: a scalable fault-tolerant layer 2 data center network fabric. SIGCOMM Comput. Commun. Rev., 39(4):39--50, Aug. 2009.

Digital Library

Google Scholar

[9]

C. E. Rothenberg, C. Macapuna, F. Verdi, M. Magalhães, and A. Zahemszky. Data center networking with in-packet bloom filters. In Proc. SBRC, pages 553--566, 2010.

Google Scholar

[10]

O. Rottenstreich, M. Radan, Y. Cassuto, I. Keslassy, C. Arad, T. Mizrahi, Y. Revah, and A. Hassidim. Compressing forwarding tables. In IEEE Infocom, 2013.

Crossref

Google Scholar

[11]

M. Thorup and U. Zwick. Compact routing schemes. In Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '01, pages 1--10, New York, NY, USA, 2001. ACM.

Digital Library

Google Scholar

[12]

X. Yang, D. Clark, and A. W. Berger. Nira: A new inter-domain routing architecture. IEEE/ACM Trans. Netw., 15(4):775--788, Aug. 2007.

Digital Library

Google Scholar

Cited By

View all

Chen LZhang YTang Y(2021)On the Optimization of Flow Tables of SDN-enabled Switches2021 5th International Conference on Communication and Information Systems (ICCIS)10.1109/ICCIS53528.2021.9646059(18-22)Online publication date: 15-Oct-2021
https://doi.org/10.1109/ICCIS53528.2021.9646059
Gonzalez-Diaz SMarks RRojas Ede la Oliva AGazda R(2021)Stateless Flow-Zone Switching Using Software-Defined AddressingIEEE Access10.1109/ACCESS.2021.30779559(68343-68365)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3077955
Gumus FYiltas-Kaplan D(2020)Congestion Prediction System With Artificial Neural NetworksInternational Journal of Interdisciplinary Telecommunications and Networking10.4018/IJITN.202007010312:3(28-43)Online publication date: Jul-2020
https://doi.org/10.4018/IJITN.2020070103
Show More Cited By

Index Terms

Using MAC addresses as efficient routing labels in data centers
1. Networks
  1. Network architectures

Recommendations

Predicting ip addresses to speed up routing lookup
Improving Internet multicast with routing labels
ICNP '97: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)

The IP-multicast architecture is extended with addressing information along multicast routing trees that permits more efficient and sophisticated multicast routing options and encourages communication and cooperation between IP and higher-layer ...
Robust and efficient routing for disruption tolerant networks

Comments

Information & Contributors

Information

Published In

HotSDN '14: Proceedings of the third workshop on Hot topics in software defined networking

August 2014

252 pages

ISBN:9781450329897

DOI:10.1145/2620728

Program Chairs:
Aditya Akella
University of Wisconsin-Madison, USA
,
Albert Greenberg
Microsoft, USA

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].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 August 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Deutsche Forschungsgemeinschaft

Conference

SIGCOMM'14

Sponsor:

SIGCOMM

SIGCOMM'14: ACM SIGCOMM 2014 Conference

August 22, 2014

Illinois, Chicago, USA

Acceptance Rates

HotSDN '14 Paper Acceptance Rate 50 of 114 submissions, 44%;

Overall Acceptance Rate 88 of 198 submissions, 44%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
1,464
Total Downloads

Downloads (Last 12 months)66
Downloads (Last 6 weeks)13

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chen LZhang YTang Y(2021)On the Optimization of Flow Tables of SDN-enabled Switches2021 5th International Conference on Communication and Information Systems (ICCIS)10.1109/ICCIS53528.2021.9646059(18-22)Online publication date: 15-Oct-2021
https://doi.org/10.1109/ICCIS53528.2021.9646059
Gonzalez-Diaz SMarks RRojas Ede la Oliva AGazda R(2021)Stateless Flow-Zone Switching Using Software-Defined AddressingIEEE Access10.1109/ACCESS.2021.30779559(68343-68365)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3077955
Gumus FYiltas-Kaplan D(2020)Congestion Prediction System With Artificial Neural NetworksInternational Journal of Interdisciplinary Telecommunications and Networking10.4018/IJITN.202007010312:3(28-43)Online publication date: Jul-2020
https://doi.org/10.4018/IJITN.2020070103
李冬(2019)Research on DDoS Real-Time Monitoring and Mitigating in SDN NetworkComputer Science and Application10.12677/CSA.2019.9408209:04(721-730)Online publication date: 2019
https://doi.org/10.12677/CSA.2019.94082
Zhang CBi JZhou YWu J(2019)HyperVDP: High-Performance Virtualization of the Programmable Data PlaneIEEE Journal on Selected Areas in Communications10.1109/JSAC.2019.289430837:3(556-569)Online publication date: Mar-2019
https://doi.org/10.1109/JSAC.2019.2894308
Bruschi RDavoli FLago PPajo J(2019)A Multi-Clustering Approach to Scale Distributed Tenant Networks for Mobile Edge ComputingIEEE Journal on Selected Areas in Communications10.1109/JSAC.2019.289423637:3(499-514)Online publication date: Mar-2019
https://doi.org/10.1109/JSAC.2019.2894236
Su YPeng TZhong XZhang L(2019)Matching Model of Flow Table for Software-Defined Internet of ThingsWireless Sensor Networks10.1007/978-981-13-6834-9_5(41-54)Online publication date: 22-Feb-2019
https://doi.org/10.1007/978-981-13-6834-9_5
Ren YHuang TLin KTseng Y(2018)On Scalable Service Function Chaining with $\mathcal{O}(1)$ Flowtable EntriesIEEE INFOCOM 2018 - IEEE Conference on Computer Communications10.1109/INFOCOM.2018.8486396(702-710)Online publication date: Apr-2018
https://doi.org/10.1109/INFOCOM.2018.8486396
Chang YHuang YChen Y(2018)An Efficient Label-Based Packet Forwarding Scheme in Software Defined Networks2018 Tenth International Conference on Ubiquitous and Future Networks (ICUFN)10.1109/ICUFN.2018.8436834(191-196)Online publication date: Jul-2018
https://doi.org/10.1109/ICUFN.2018.8436834
Sun JDong PQin YXu T(2017)A scalable header compression scheme to improve bandwidth utilization in 5G networksProceedings of the Australasian Computer Science Week Multiconference10.1145/3014812.3014851(1-8)Online publication date: 30-Jan-2017
https://dl.acm.org/doi/10.1145/3014812.3014851
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Predicting ip addresses to speed up routing lookup

Improving Internet multicast with routing labels

Robust and efficient routing for disruption tolerant networks