Towards a flexible data center fabric with source routing

Jyothi, S.; Dong, Mo; Godfrey, P. Brighten

doi:10.1145/2774993.2775005

Cited by 48 publications

(27 citation statements)

References 22 publications

(15 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Hop encapsulation is inefficient. It is based on strict SR by inserting labels for the entire path into the packet header at the ingress node ( [14]- [16]) or the host side ( [13]); each label value indicates the outgoing port number at a hop switch. Since the network diameter is always large in the networks like public WANs or carrier networks, the label overhead of the packet header would be heavy if adopted this technique.…”

Section: A Previous Implementations Have Limitationsmentioning

confidence: 99%

Scalable explicit path control in software-defined networks

Luo

et al. 2019

Journal of Network and Computer Applications

View full text Add to dashboard Cite

Section: A Previous Implementations Have Limitationsmentioning

confidence: 99%

Scalable explicit path control in software-defined networks

Luo

et al. 2019

Journal of Network and Computer Applications

View full text Add to dashboard Cite

“…Previous approaches relied mostly on network for routing. An end-host based approach is Source Routing which simplifies the network by moving the forwarding information to packets, and eliminating the need to disseminate updates of forwarding state [179]. To properly encode paths in packets, end-hosts need to be aware of network topology and paths.…”

Section: Dynamic (Proactive)mentioning

confidence: 99%

Datacenter Traffic Control: Understanding Techniques and Trade-offs

Noormohammadpour¹,

Raghavendra²

2017

Preprint

View full text Add to dashboard Cite

Datacenters provide cost-effective and flexible access to scalable compute and storage resources necessary for today's cloud computing needs. A typical datacenter is made up of thousands of servers connected with a large network and usually managed by one operator. To provide quality access to the variety of applications and services hosted on datacenters and maximize performance, it deems necessary to use datacenter networks effectively and efficiently. Datacenter traffic is often a mix of several classes with different priorities and requirements. This includes user-generated interactive traffic, traffic with deadlines, and long-running traffic. To this end, custom transport protocols and traffic management techniques have been developed to improve datacenter network performance.In this tutorial paper, we review the general architecture of datacenter networks, various topologies proposed for them, their traffic properties, general traffic control challenges in datacenters and general traffic control objectives. The purpose of this paper is to bring out the important characteristics of traffic control in datacenters and not to survey all existing solutions (as it is virtually impossible due to massive body of existing research). We hope to provide readers with a wide range of options and factors while considering a variety of traffic control mechanisms. We discuss various characteristics of datacenter traffic control including management schemes, transmission control, traffic shaping, prioritization, load balancing, multipathing, and traffic scheduling. Next, we point to several open challenges as well as new and interesting networking paradigms. At the end of this paper, we briefly review inter-datacenter networks that connect geographically dispersed datacenters which have been receiving increasing attention recently and pose interesting and novel research problems.

show abstract

“…Recent years, source routing SDN has attracted some attention as it can reduce the number of entries used in SDN without losing the programmability of flows at the same time [24][25] [26]. However, source routing is not yet supported in the latest Openflow.…”

Section: Packet Header Encodingmentioning

confidence: 99%

“…We construct one backup path for every link and it needs one flow entry to update the packet's header at every hop. So the flow entries to build backup paths can be presented as (26):…”

Section: Overhead Analysis (1) Flow Entries Needed To Build Backup Pathsmentioning

confidence: 99%

Congestion Aware Fast Link Failure Recovery of SDN Network Based on Source Routing

2017

KSII TIIS

View full text Add to dashboard Cite

The separation of control plane and data plane in Software Defined Network (SDN) makes it flexible to control the network behavior, while also causes some inconveniences to the link failure recovery due to the delay between fail point and the controller. To avoid delay and packet loss, pre-defined backup paths are used to reroute the disrupted flows when failure occurs. However, it may introduce large overhead to build and maintain these backup paths and is hard to dynamically construct backup paths according to the network status so as to avoid congestion during rerouting process. In order to realize congestion aware fast link failure recovery, this paper proposes a novel method which installs multi backup paths for every link via source routing and per-hop-tags and spread flows into different paths at fail point to avoid congestion. We carry out experiments and simulations to evaluate the performance of the method and the results demonstrate that our method can achieve congestion aware fast link failure recovery in SDN with a very low overhead.

show abstract

Towards a flexible data center fabric with source routing

Cited by 48 publications

References 22 publications

Scalable explicit path control in software-defined networks

Scalable explicit path control in software-defined networks

Datacenter Traffic Control: Understanding Techniques and Trade-offs

Congestion Aware Fast Link Failure Recovery of SDN Network Based on Source Routing

Contact Info

Product

Resources

About