By Topic

Smart trunk scheduling strategies for future integrated services packet-switched 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
$31 $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

1 Author(s)
Rahnema, M. ; GTE Labs., Waltham, MA, USA

Trunk scheduling is considered as a means to reallocate delay fairly among various traffic classes and thus reduce the overall network delivery delay of packets. Two service prioritization schemes to accomplish this in integrated services packet switching networks are discussed. These are based on either the total HOP distance (source-destination distance) between the packets' source and destination or that weighted by the packets' local delay at the switching node. Three types of servicing are considered, and the case of highest-priority servicing (head of the line) is studied in some detail. It is shown while the highest-priority servicing of total-distance prioritization can potentially lead to extensive end-to-end network delays for packets in the low-priority classes, the delay-weighted total-distance case results in a more fair and balanced treatment of all priority classes. The basic fast hardware architecture is presented for implementation of the delay-weighted total-distance-based service prioritization, which should make the discipline suitable for practical purposes.<>

Published in:

Communications Magazine, IEEE  (Volume:26 ,  Issue: 2 )