Packet models revisited: tandem and priority systems

Share/Save/Bookmark

Mandjes, Michel (2004) Packet models revisited: tandem and priority systems. Queueing Systems, 47 (4). pp. 363-377. ISSN 0257-0130

[img]PDF
Restricted to UT campus only
: Request a copy
152Kb
Abstract:We examine two extensions of traditional single-node packet-scale queueing models: tandem networks and (strict) priority systems. Two generic input processes are considered: periodic and Poisson arrivals. For the two-node tandem, an exact expression is derived for the joint distribution of the total queue length, and the queue length of the first queue, implicitly determining the distribution of the second queue. Similarly we derive the distribution of the low-priority queue in a two-class priority system. We also provide explicit approximations based on the Brownian bridge.
Item Type:Article
Copyright:© 2004 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/70340
Official URL:http://dx.doi.org/10.1023/B:QUES.0000036397.20364.70
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 220815