Low-Latency Routing on Mesh-Like Backbones

Gvozdiev, Nikola; Vissicchio, Stefano; Karp, Brad; Handley, Mark

doi:10.1145/3152434.3152453

Cited by 8 publications

(6 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [21] we reported a similar effect, and showed a synthetic topology susceptible to Braess's paradox [3]. We initially suspected that this was what was happening here too, but in fact there are other more likely local minima that can trap B4.…”

Section: Figure 4(a)supporting

confidence: 56%

See 1 more Smart Citation

On low-latency-capable topologies, and their impact on the design of intra-domain routing

Gvozdiev

Vissicchio

Karp

et al. 2018

Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication

Self Cite

View full text Add to dashboard Cite

An ISP's customers increasingly demand delivery of their traffic without congestion and with low latency. The ISP's topology, routing, and traffic engineering, often over multiple paths, together determine congestion and latency within its backbone. We first consider how to measure a topology's capacity to route traffic without congestion and with low latency. We introduce low-latency path diversity (LLPD), a metric that captures a topology's flexibility to accommodate traffic on alternative low-latency paths. We explore to what extent 116 real backbone topologies can, regardless of routing system, keep latency low when demand exceeds the shortest path's capacity. We find, perhaps surprisingly, that topologies with good LLPD are precisely those where routing schemes struggle to achieve low latency without congestion. We examine why these schemes perform poorly, and offer an existence proof that a practical routing scheme can achieve a topology's potential for congestion-free, low-delay routing. Finally we examine implications for the design of backbone topologies amenable to achieving high capacity and low delay.

show abstract

Section: Figure 4(a)supporting

confidence: 56%

“…In earlier work [21] we showed using small synthetic examples that two-dimensional grid networks can be hard to route, as they inadvertently concentrate traffic. We use LLPD to understand to what extent this is a problem in real networks.…”

Section: Path Diversity Is Hard To Usementioning

confidence: 99%

On low-latency-capable topologies, and their impact on the design of intra-domain routing

Gvozdiev

Vissicchio

Karp

et al. 2018

Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication

Self Cite

View full text Add to dashboard Cite

show abstract

“…In order to determine the amount of traffic to send on detour paths, routers periodically (every T p msec) send probe packets 3 to each of their immediate neighbors along the detour paths. Upon receipt of a probe packet, a neighboring router returns the probe packet back to the sender with a detour pathspecific "rate feedback".…”

Section: A Detour Path Information Signallingmentioning

confidence: 99%

“…In this paper, we start from the assumption that network routers possess increased amounts of storage and can therefore, act as temporary storage nodes. Ultimately, the goal is to overcome some of the weaknesses of the current design, namely, eventual packet loss (which in turn has triggered false bufferbloat designs 1 ), low link utilisation (due to single-path transmission, or end-toend multipath only [3], [4]) and slow responsiveness to utilise available bandwdith [5], which in turn results to increased flow completion times, even in cases of very short flows and bandwidth availability [6]. These design weaknesses force ISPs to be conservative and overprovision their networks [4] resulting in increased maintenance costs.…”

mentioning

confidence: 99%

A Congestion Control Framework Based on In-Network Resource Pooling

Rene

Ascigil

Psaras

et al. 2022

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Congestion control has traditionally relied on monitoring packet-level performance (e.g., latency, loss) through feedback signals propagating end-to-end together with various queue management practices (e.g., carefully setting various parameters, such as router buffer thresholds) in order to regulate traffic flow. Due to its end-to-end nature, this approach is known to transfer data according to the path's slowest link, requiring several RTTs to transmit even a few tens of KB during slow start. In this paper, we take a radically different approach to control congestion, which obviates end-to-end performance monitoring and careful setting of network parameters. The resulting In-Network Resource Pooling Protocol (INRPP) extends the resource pooling principle to exploit in-network resources such as router storage and unused bandwidth along alternative sub-paths. In INRPP, content caches or large (possibly bloated) router buffers are used as a place of temporary custody for incoming data packets in a store and forward manner. Data senders push data in the network and when it hits the bottleneck link, in-network caches at every hop store data in excess of the link capacity; nodes progressively move/send data (from one cache to the next) towards the destination. At the same time alternative sub-paths are exploited to move data faster towards the destination. We demonstrate through extensive simulations that INRPP is TCP friendly, and improves flow completion time and fairness by as much as 50% compared to RCP, MPTCP and TCP, under realistic network conditions.

show abstract

“…However, such schemes are particularly susceptible to congestions due to "hot spots". 5 By applying load-balancing mechanisms, the queueing delay and other QoS parameters can be improved. The explicit load balancing (ELB) routing algorithm 6 represents a routing scheme based on a virtual topology that allows for a better traffic distribution and lower packet loss in congested scenarios.…”

Section: Related Workmentioning

confidence: 99%

Implementation of a geographical routing scheme for low Earth orbiting satellite constellations using intersatellite links

Roth

Brandt

Bischl

2020

Satell Commun Network

View full text Add to dashboard Cite

A major problem for low Earth orbit (LEO) constellations with intersatellite links is the efficient routing of the data packets through such a highly dynamic network. In order to achieve a worldwide coverage even in remote areas and Internet access with a limited amount of gateway stations, intersatellite links are a promising approach. Since LEO constellations represent a distinct, highly dynamic routing environment, specific strategies are needed. To this end, a suitable geographical routing scheme is proposed and investigated in two Walker Star constellations. The proposed scheme targets reliable transmissions with low latency and high data rates. The approach is based on a geographical address identifier in Layer 2 of the communication stack. The globe is thus divided into geographical areas that determine this identifier in the MAC address of the terminals. As mobile terminals are considered, the MAC addressing scheme is flexible, whereas the IP addresses of the terminals remain static. This decoupling allows for flexibility in the choice of the address resolution scheme. Moreover, the geographical identifier in the MAC address enables fast routing table lookups and switching. The proposed routing scheme also takes possible overloads of the satellites due to traffic into account and applies a rerouting procedure. When a packet arrives in the geographical area of the destination terminal, a local rerouting scheme is applied if needed. The proposed approaches take handover events that possibly occur during a transmission into account. Furthermore, the scan angles of the satellites have been adapted to the constellations to provide full coverage and high elevation angles. So a robust and adaptable routing scheme is provided for a dynamic environment where satellites and terminals are constantly moving. The proposed definitions and procedures have been implemented in a system level simulator, which allows for comparisons with adjustable parameters in various scenarios. In this work, an Iridium-like constellation and a megaconstellation are investigated and compared regarding the address resolution procedures, the average end-to-end transmission delay, and the dropping and rerouting rates. Additionally, the signaling overhead is compared with other approaches. The simulator and results of the simulations

show abstract

Low-Latency Routing on Mesh-Like Backbones

Cited by 8 publications

References 31 publications

On low-latency-capable topologies, and their impact on the design of intra-domain routing

On low-latency-capable topologies, and their impact on the design of intra-domain routing

A Congestion Control Framework Based on In-Network Resource Pooling

Implementation of a geographical routing scheme for low Earth orbiting satellite constellations using intersatellite links

Contact Info

Product

Resources

About