Packet pacing in small buffer optical packet switched networks

  • Authors:
  • Vijay Sivaraman;Hossam Elgindy;David Moreland;Diethelm Ostry

  • Affiliations:
  • School of Electrical Engineering and Telecommunications, University of New South Wales, Sydney, NSW, Australia;School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia;CSIRO, ICT Centre, Epping, NSW, Australia;CSIRO, ICT Centre, Epping, NSW, Australia

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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 real-time 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 tradeoff mechanism provided by pacing can be instrumental in overcoming the performance hurdle arising from the scarcity of buffers in OPS networks.