Two priority schemes for fair distributed queue (FDQ) networks

The absolute priority scheme is message preemptive and allows only the highest priority class to be present on the network under heavy load. The allocation priority scheme permits the transmission of low priority class data in a controllable proportion to the high priority data. Under heavy load, bo...

Full description

Saved in:
Bibliographic Details
Main Authors: Kabatepe, M., Vastola, K.S.
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Metropolitan area networks
Propagation delay
Proportional control
Protocols
Telecommunication traffic
Throughput
Time factors
Traffic control
Wide area networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The absolute priority scheme is message preemptive and allows only the highest priority class to be present on the network under heavy load. The allocation priority scheme permits the transmission of low priority class data in a controllable proportion to the high priority data. Under heavy load, both schemes allocate equal bandwidth to the active nodes within each priority class without wasting bandwidth. They also have completely predictable worst-case delays. The delay characteristics of both schemes under Poisson load are studied via simulation. With the assumption of equal arrival rates, the high priority class achieves a much lower delay than the low priority class, in both schemes. Thus, the absolute and allocation priority schemes are fair and very efficient.< >
DOI:10.1109/ICC.1993.397290