By Topic

A deadline-aware rate-adaptive packet pacing algorithm for small buffer networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
T. Venkatesh ; Department of Computer Science and Engineering, Indian Institute of Technology Guwahati, 781036, India ; K. Phani Prakash

Recent research on sizing router buffers in high speed networks promises the realization of core network with buffer enough to store just a few packets. However, such networks work well with traffic efficiently paced to reduce both short-term and long-range burstiness. In this work, we propose an efficient pacing scheme at the edge network that works for packets with or without pre-determined deadlines and smoothen the traffic according to the occupancy of the router buffer. The proposed algorithm paces the traffic both according to the delay and queue length constraints. It is thus shown to possess the advantages of both delay-based pacing and queue length-based pacing algorithms in the literature and yet overcome their shortcomings. We demonstrate through simulations that the proposed pacing algorithm significantly reduces the loss rate even when the traffic contains significant UDP traffic compared to the best known pacing schemes in the literature.

Published in:

2011 17th IEEE International Conference on Networks

Date of Conference:

14-16 Dec. 2011