Online time-constrained scheduling in linear networks

Naor, Joseph; Rosen, Alon; Scalosub, Gabriel

doi:10.1109/infcom.2005.1498316

Cited by 11 publications

(10 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to TCP pacing, there have been other proposed schemes for resolving the packet drop problem in small buffer networks [29], [1], [2]. The work by Sivaraman et al, referred to as delay-budget based pacing, is similar to ours in terms of the deployment location of pacers.…”

Section: Introductionmentioning

confidence: 75%

“…In addition to TCP pacing, there have been other proposals for resolving packet drops in small buffer networks [36], [29], [1], [2]. The work by Sivaraman et al [36] stems from previous works on traffic conditioners for video transmission, called traffic conditioning off-line.…”

Section: Related Workmentioning

confidence: 99%

“…They proposed an on-line version of traffic conditioner based on this traffic conditioning off-line. These approaches in [29], [1], [2] rely on the global networkwide coordinated scheduling.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A Practical On-line Pacing Scheme at Edges of Small Buffer Networks

Cai

Jiang²,

Wolf³

et al. 2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

For the optical packet-switching routers to be widely deployed in the Internet, the size of packet buffers on routers has to be significantly small. Such small-buffer networks rely on traffic with low levels of burstiness to avoid buffer overflows and packet losses. We present a pacing system that proactively shapes traffic in the edge network to reduce burstiness. Our queue length based pacing uses an adaptive pacing on a single queue and paces traffic indiscriminately where deployed. In this work, we show through analysis and simulation that this pacing approach introduces a bounded delay and that it effectively reduces traffic burstiness. We also show that it can achieve higher throughput than end-system based pacing.

show abstract

Section: Introductionmentioning

confidence: 75%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Practical On-line Pacing Scheme at Edges of Small Buffer Networks

Cai

Jiang²,

Wolf³

et al. 2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

show abstract

“…The approach in [18]- [20] is to treat this as a global scheduling problem, wherein packets are transmitted by the optical edge nodes at appropriate time instants that meet the packet's time-constraints while minimising (a weighted measure of) loss in the network. The general problem is shown to be NP-hard [20], and approximate off-line [19], [20] and on-line [18] algorithms are developed for restricted topologies. Though theoretically insightful, these methods require global network-wide co-ordinated scheduling amongst the nodes, which is not practically feasible in packet networks.…”

Section: B Prior Workmentioning

confidence: 99%

Packet Pacing in Small Buffer Optical Packet Switched Networks

Sivaraman

ElGindy

Moreland

et al. 2009

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-In the absence of a cost-effective technology for storing optical signals, emerging optical packet switched (OPS) networks are expected to have severely limited buffering capability. To mitigate the performance degradation resulting from small buffers, this paper proposes that optical edge nodes "pace" the injection of traffic into the OPS core. Our contributions relating to pacing in OPS networks are three-fold: first, we develop realtime pacing algorithms of poly-logarithmic complexity that are feasible for practical implementation in emerging high-speed OPS networks. Second, we provide an analytical quantification of the benefits of pacing in reducing traffic burstiness and traffic loss at a link with very small buffers. Third, we show via simulations of realistic network topologies that pacing can significantly reduce network losses at the expense of a small and bounded increase in end-to-end delay for real-time traffic flows. We argue that the loss-delay trade-off mechanism provided by pacing can be instrumental in overcoming the performance hurdle arising from the scarcity of buffers in OPS networks.

show abstract

“…Traffic shaping/pacing at the electronic edges [12] can make traffic entering the core smoother, potentially reducing loss; this is effective for losses arising from bursty traffic, but does not address random contention loss. Though coordinated scheduling of packets to prevent contentions in the core can be envisaged, as in [13], such an approach is too complicated to be implemented in practice for an arbitrary wide-area network. In this paper we focus on packet-level FEC coding by the electronic edge routers as a method for recovering from packet loss in the bufferless core.…”

Section: Introductionmentioning

confidence: 99%

Enabling a Bufferless Core Network Using Edge-to-Edge Packet-Level FEC

Vishwanath

Sivaraman

Thottan³

et al. 2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-Internet traffic is expected to grow phenomenally over the next five to ten years, and to cope with such large traffic volumes, core networks are expected to scale to capacities of terabits-per-second and beyond. Increasing the role of optics for switching and transmission inside the core network seems to be the most promising way forward to accomplish this capacity scaling. Unfortunately, unlike electronic memory, it remains a formidable challenge to build even a few packets of integrated all-optical buffers. In the context of envisioning a bufferless (or near-zero buffer) core network, our contributions are threefold: First, we propose a novel edge-to-edge based packet-level forward error correction (FEC) framework as a means of combating high core losses, and investigate via analysis and simulation the appropriate FEC strength for a single core link. Second, we consider a realistic multi-hop network and develop an optimisation framework that adjusts the FEC strength on a per-flow basis to ensure fairness between singleand multi-hop flows. Third, we study the efficacy of FEC for various system parameters such as relative mixes of short-lived and long-lived TCP flows, and average offered link loads. Our study is the first to show that packet-level FEC, when tuned properly, can be very effective in mitigating high core losses, thus opening the doors to a bufferless core network in the future.

show abstract

Online time-constrained scheduling in linear networks

Cited by 11 publications

References 12 publications

A Practical On-line Pacing Scheme at Edges of Small Buffer Networks

A Practical On-line Pacing Scheme at Edges of Small Buffer Networks

Packet Pacing in Small Buffer Optical Packet Switched Networks

Enabling a Bufferless Core Network Using Edge-to-Edge Packet-Level FEC

Contact Info

Product

Resources

About