Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
QueueingSystems13(1993)1-3 1 Editorial introduction
 

Summary: QueueingSystems13(1993)1-3 1
Editorial introduction
VenkatAnantharam
SchoolofElectricalEngineering,313PhillipsHall, CornellUniversity,Ithaca,
NY14853-3801, USA
Ralph L. Disney
Department oflndustrialEngineering,337Zachry EngineeringCenter,
TexasA&M University,CollegeStation, TX77843-3131, USA
Jean Walrand
Department ofElectricalEngineeringandComputerScience,
Universityof California-Berkeley, Berkeley, CA 94720, USA
Received21December1992
Queueing network theory has a long history, starting with the early attempts to
modeltelephonenetworks. The subjecthas grown into a rich area beingfed both by
new applications and by the use of increasinglysophisticatedtools from the theory
ofprobability and stochastic processes. Thus one finds applicationsto diversetech-
nologies such as packet switched and circuit switched communication networks,
computer networks, personal communicationnetworks, job shops, flexiblemanu-
facturing systems, and to the timing analysis of distributed software systems. The
mathematicaltools beingused includegeneralpoint process and markedpoint pro-

  

Source: Anantharam, Venkat - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley

 

Collections: Engineering