Thumbnail
Access Restriction
Open

Author Marsan, M. Ajmone ♦ Franceschinis, M. ♦ Leonardi, E. ♦ Neri, F. ♦ Tarello, A.
Source CiteSeerX
Content type Text
Publisher Petrocelli Books, Inc
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Packet-switching Network ♦ Theory Possible Underload Instability ♦ Simple Configuration ♦ Network Model ♦ Generalized Processor Sharing ♦ Packet Network ♦ Underloaded Packet Network ♦ Underloaded Queueing Network ♦ Fluid Model ♦ Bear Significant Resemblance ♦ Recent Literature ♦ Strict-priority Scheduler ♦ Qos Scheduler ♦ Overload Condition ♦ Instability Phenomenon ♦ Complex Scheduling Algorithm
Description Instability in packet-switching networks is normally associated with overload conditions, since queueing network models show that, in simple configurations, only overload generates instability. However, some results showing that instability can happen also in underloaded queueing networks appeared in the recent literature. Underload instabilities can be produced by complex scheduling algorithms, that bear significant resemblance to the Quality of Service (QoS) schedulers considered today for packet networks. In this paper, we study with fluid models and with adversarial queueing theory possible underload instabilities due to strict-priority schedulers and to Generalized Processor Sharing (GPS) schedulers.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2003-01-01
Publisher Department Department, Stanford University