research-article

Data-driven network connectivity

Authors:

Junda Liu,

Baohua Yan,

Scott Shenker,

Michael SchapiraAuthors Info & Claims

HotNets-X: Proceedings of the 10th ACM Workshop on Hot Topics in Networks

Article No.: 8, Pages 1 - 6

https://doi.org/10.1145/2070562.2070570

Published: 14 November 2011 Publication History

Get Access

Abstract

Routing on the Internet combines data plane mechanisms for forwarding traffic with control plane protocols for guaranteeing connectivity and optimizing routes (e.g., shortest-paths and load distribution). We propose data-driven connectivity (DDC), a new routing approach that achieves the fundamental connectivity guarantees in the data plane rather than the control plane, while keeping the more complex requirements of route optimization in the control plane. DDC enables faster recovery from failures and easier implementation of control plane optimization.

References

[1]

M. Al-Fares, A. Loukissas, and A. Vahdat. A scalable, commodity data center network architecture. In SIGCOMM, 2008.

Digital Library

Google Scholar

[2]

M. Arregoces and M. Portolani. Data center fundamentals. Cisco Press, 2003.

Digital Library

Google Scholar

[3]

M. S. Corson and A. Ephremides. A distributed routing algorithm for mobile wireless networks. Wireless Networks, 1(1):61--81, 1995.

Digital Library

Google Scholar

[4]

B. Fortz and M. Thorup. Increasing internet capacity using local search. Computational Optimization and Applications, 29(1):13--48, 2004.

Digital Library

Google Scholar

[5]

E. M. Gafni, Dimitri, and P. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications, 1981.

Crossref

Google Scholar

[6]

A. Greenberg, J. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. Maltz, P. Patel, and S. Sengupta. VL2: A Scalable and Flexible Data Center Network. In SIGCOMM, 2009.

Digital Library

Google Scholar

[7]

A. Kvalbein, A. Hansen, T. Cicic, S. Gjessing, and O. Lysne. Fast IP network recovery using multiple routing configurations. In INFOCOM 2006, pages 1--11. IEEE, 2007.

Google Scholar

[8]

K. Kwong, L. Gao, R. Guérin, and Z. Zhang. On the feasibility and efficacy of protection routing in IP networks. In INFOCOM, 2010, pages 1--9. IEEE, 2010.

Digital Library

Google Scholar

[9]

K. Lakshminarayanan, M. Caesar, M. Rangan, T. Anderson, S. Shenker, and I. Stoica. Achieving convergence-free routing using failure-carrying packets. In SIGCOMM, 2007.

Digital Library

Google Scholar

[10]

S. Lor, R. Landa, and M. Rio. Packet re-cycling: eliminating packet losses due to network failures. In HotNets IX, page 2. ACM, 2010.

Digital Library

Google Scholar

[11]

Y. Ohara, S. Imahori, and R. V. Meter. Mara: Maximum alternative routing algorithm. In INFOCOM, pages 298--306. IEEE, 2009.

Crossref

Google Scholar

[12]

V. Park and M. Corson. A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. In INFOCOM, 1997.

Digital Library

Google Scholar

[13]

S. Ray, R. Guérin, K. Kwong, and R. Sofia. Always acyclic distributed path computation. IEEE/ACM Transactions on Networking (ToN), 18(1):307--319, 2010.

Digital Library

Google Scholar

Cited By

View all

Johansen NKar LMadsen ANielsen KSchmid SSrba JTollund R(2022)FBR: Dynamic Memory-Aware Fast Rerouting2022 IEEE 11th International Conference on Cloud Networking (CloudNet)10.1109/CloudNet55617.2022.9978819(55-60)Online publication date: 7-Nov-2022
https://doi.org/10.1109/CloudNet55617.2022.9978819
Canini MSalem ISchiff LSchiller ESchmid S(2022)Renaissance: A self-stabilizing distributed SDN control plane using in-band communicationsJournal of Computer and System Sciences10.1016/j.jcss.2022.02.001127(91-121)Online publication date: Aug-2022
https://doi.org/10.1016/j.jcss.2022.02.001
Subramanian KAbhashkumar AD'Antoni LAkella A(2021)D2RProceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)10.1145/3482898.3483360(148-161)Online publication date: 11-Oct-2021
https://dl.acm.org/doi/10.1145/3482898.3483360
Show More Cited By

Index Terms

Data-driven network connectivity
1. Networks
  1. Network architectures

Recommendations

Ensuring connectivity via data plane mechanisms
nsdi'13: Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation

We typically think of network architectures as having two basic components: a data plane responsible for forwarding packets at line-speed, and a control plane that instantiates the forwarding state the data plane needs. With this separation of concerns, ...
Flow management for QoS-controlled 'data connectivity' provisioning

The paper describes a management-oriented model for cost-effective 'data connectivity' provisioning between the peer entities of a networked multimedia application. The service provider (SP) may employ policy functions to map the application-prescribed ...
g-Elements, finite buildings and higher Cohen-Macaulay connectivity

Chari proved that if Δ is a (d - 1)-dimensional simplicial complex with a convex ear decomposition, then h₀ ≤ ... ≤ h_⌊d/2⌋ [M.K. Chari, Two decompositions in topological combinatorics with applications to matroid complexes, Trans. Amer. Math. Soc. 349 (...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

HotNets-X: Proceedings of the 10th ACM Workshop on Hot Topics in Networks

November 2011

148 pages

ISBN:9781450310598

DOI:10.1145/2070562

General Chairs:
Hari Balakrishnan
MIT
,
Dina Katabi
MIT
,
Program Chairs:
Aditya Akella
University of Wisconsin-Madison
,
Ion Stoica
UC Berkeley

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 November 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

HOTNETS-X

Sponsor:

SIGCOMM

HOTNETS-X: Tenth ACM Workshop on Hot Topics in Networks

November 14 - 15, 2011

Massachusetts, Cambridge

Acceptance Rates

Overall Acceptance Rate 110 of 460 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
254
Total Downloads

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

Reflects downloads up to 24 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Johansen NKar LMadsen ANielsen KSchmid SSrba JTollund R(2022)FBR: Dynamic Memory-Aware Fast Rerouting2022 IEEE 11th International Conference on Cloud Networking (CloudNet)10.1109/CloudNet55617.2022.9978819(55-60)Online publication date: 7-Nov-2022
https://doi.org/10.1109/CloudNet55617.2022.9978819
Canini MSalem ISchiff LSchiller ESchmid S(2022)Renaissance: A self-stabilizing distributed SDN control plane using in-band communicationsJournal of Computer and System Sciences10.1016/j.jcss.2022.02.001127(91-121)Online publication date: Aug-2022
https://doi.org/10.1016/j.jcss.2022.02.001
Subramanian KAbhashkumar AD'Antoni LAkella A(2021)D2RProceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)10.1145/3482898.3483360(148-161)Online publication date: 11-Oct-2021
https://dl.acm.org/doi/10.1145/3482898.3483360
Foerster KKamisinski APignolet YSchmid STredan G(2021)Grafting Arborescences for Extra Resilience of Fast Rerouting SchemesIEEE INFOCOM 2021 - IEEE Conference on Computer Communications10.1109/INFOCOM42981.2021.9488782(1-10)Online publication date: 10-May-2021
https://doi.org/10.1109/INFOCOM42981.2021.9488782
Chiesa MKamisinski ARak JRetvari GSchmid S(2021)A Survey of Fast-Recovery Mechanisms in Packet-Switched NetworksIEEE Communications Surveys & Tutorials10.1109/COMST.2021.306398023:2(1253-1301)Online publication date: Oct-2022
https://doi.org/10.1109/COMST.2021.3063980
Kannan PJoshi RChan M(2019)Precise Time-synchronization in the Data-Plane using Programmable Switching ASICsProceedings of the 2019 ACM Symposium on SDN Research10.1145/3314148.3314353(8-20)Online publication date: 3-Apr-2019
https://dl.acm.org/doi/10.1145/3314148.3314353
Zheng JXu HZhu XChen GGeng Y(2019)SentinelIEEE/ACM Transactions on Networking10.1109/TNET.2019.293147327:5(1859-1872)Online publication date: 1-Oct-2019
https://dl.acm.org/doi/10.1109/TNET.2019.2931473
Canini MSalem ISchiff LSchiller ESchmid S(2018)Renaissance: A Self-Stabilizing Distributed SDN Control Plane2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS.2018.00032(233-243)Online publication date: Jul-2018
https://doi.org/10.1109/ICDCS.2018.00032
Ren LQin YWang BZhang PLuh PJin R(2017)Enabling Resilient Microgrid Through Programmable NetworkIEEE Transactions on Smart Grid10.1109/TSG.2016.25899038:6(2826-2836)Online publication date: Nov-2017
https://doi.org/10.1109/TSG.2016.2589903
Chiesa MNikolaevskiy IMitrovic SGurtov AMadry ASchapira MShenker S(2017)On the Resiliency of Static Forwarding TablesIEEE/ACM Transactions on Networking10.1109/TNET.2016.261939825:2(1133-1146)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1109/TNET.2016.2619398
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.

Cited By

Index Terms

Recommendations

Ensuring connectivity via data plane mechanisms

Flow management for QoS-controlled 'data connectivity' provisioning

g-Elements, finite buildings and higher Cohen-Macaulay connectivity