1 / 17

Enhancing Network Connectivity: A Data-Driven Approach

This paper explores a Data-Driven Connectivity (DDC) mechanism that prioritizes local state over remote state to ensure efficient network routing without heavy reliance on a centralized control plane. DDC focuses on optimizing routes while maintaining connectivity by sending packets whenever possible and utilizing implicit signaling for state transitions. This approach minimizes message exchange and packet labeling requirements, preserving the Directed Acyclic Graph (DAG) structure of network paths, thus enabling efficient load distribution and congestion avoidance throughout the network.

lihua
Download Presentation

Enhancing Network Connectivity: A Data-Driven Approach

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Data-Driven Network Connectivity Junda Liu, Scott Shenker, Baohua Yang and Michael Schapira junda@google.com

  2. Data Plane ? Control Plane

  3. Data Plane • Require Remote State • Slower timescales Control Plane • Only Local State • Packet timescales

  4. Data-Driven Connectivity • A data plane mechanism • Only local state • Ensures connectivity without control plane • Simple state transitions • No message exchange • No packet labeling • Intra-domain

  5. Data-Driven Connectivity • Traffic Engineering • Optimize Routes • Maintain Connectivity • ... • Traffic Engineering • Optimize Routes • ... • Forward Packets • ... • Maintain Connectivity • Forward Packets • ... Traditional Model • DDC Model

  6. The Difference Shortest Path • Multi Path • DDC • Control Plane • Control Plane • Control Plane • Data Plane • Data Plane • Data Plane Invoke Control Plane • Invoke Control Plane

  7. To Begin With • Destination-based forwarding • Initially for every router, a link is either outgoing or incoming • Essentially a DAG (Directed Acyclic Graph) • DDC will preserve the DAG property

  8. The Idea • Send packet out when you can • Bounce packet back when no choice • Bounce-back packet is the implicit signal • Inspired by Gafni-Bertsekas link reversal routing in 1981

  9. Local Port States • 2 bits per port: • 1 bit for Incoming or Outgoing • 1 bit for Normal or Reversed • Normal Action: Recv Pkt I Send to O port

  10. State Transition Always have a port to send the packet!

  11. State Transition • Always have a port to send the packet!

  12. What's left on Control Plane • Route optimization • Local healing • Clear the reversed bit • Load distribution • Avoid link congestion

  13. Measurement: Locality of DDC • AS1239 • DDC has significantly smaller scope.

  14. Measurement: Load Distribution • Load distributing has close to optimal result

  15. Conclusion • Connectivity ensured by data plane • Load distribution by simple control plane • Future work • Handle the distributed nature of modern router architecture

  16. Backup

  17. Routing Along DAGs • Build per-destination DAG (Directed Acyclic Graph) • Detect disconnection • Optimize routes continuously • Avoid congestion distributedly

More Related