By Topic

A novel scheme using the information of departure processes for delay guarantees of distributed VBR traffic

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

5 Author(s)
Zhi-Ren Chang ; Winbond Electron. Corp., Hsinchu, Taiwan ; I-Chung Lee ; Cheng-Shang Chang ; Chien-Hsin Li
more authors

In this paper, we consider the problem of providing delay guarantees in a distributed environment, e.g., a wireless network or a cable network. In a distributed environment, the information of the arrival process is, in general, not available to the network. Due to the lack of such information, traffic regulators and scheduling policies discussed in the literature cannot be directly applied. To cope with the problem, we propose a distributed traffic regulator (DTR) that uses the information of the departure process. Based on such DTRs, we propose the distributed earliest deadline first (DEDF) scheduling policy. For the DEDF scheme, we derive an admission-control criterion and show that the maximum delay can be guaranteed if the criterion is satisfied

Published in:

Networking, IEEE/ACM Transactions on  (Volume:9 ,  Issue: 4 )