By Topic

A study of isochronous channel reuse in DQDB metropolitan area 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)
Nen-Fu Huang ; Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Huey-Ing Liu

This paper investigates the isochronous channel reuse problem (ICRP) on the IEEE 802.6 distributed-queue dual-bus (DQDB) metropolitan area network (MAN). Given a set of established isochronous connections and a set of isochronous connections requests, using a minimal number of isochronous bandwidth to service all of the connections is attempted. On the other hand, given a limited isochronous bandwidth, establishing a maximal number of isochronous connections is of primary concern. Our previous study demonstrates that the ICRP is NP-complete by showing that the simplified ICRP (SICRP), in which all of the established isochronous connections and the isochronous requests are of the same bandwidth, is NP-complete. We recommend using a tight lower bound on the number of required isochronous channels for the SICRP. An efficient isochronous channel scheduling algorithm (ICSA), capable of providing a solution close to the lower bound, is also proposed. Simulation results indicate that for a limited isochronous bandwidth, the number of isochronous connections successfully established by the ICSA is significantly more than that of the isochronous channels allocation scheme in the DQDB standard

Published in:

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