Decentralized network connection preemption algorithms

Computer Networks

Volumn 30, Issue 11, 1998, Pages 1029-1043

  Peyravian, Mohammad ^a   Kshemkalyani, Ajay D ^b  

^a IBM   (United States)

^b University of Cincinnati   (United States)

Author keywords

Algorithm; ATM; Bandwidth; Connection; Network; Optimal; Preemption; Priority; Scheduling

Indexed keywords

EID: 0000872714     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0169-7552(97)00139-6     Document Type: Article

References (4)

1. W.P. Lovegrove, J.L. Hammond, Simulation methods for studying nonstationary behavior of computer networks, IEEE J. Select. Areas Comm. 8 (9) (1990) 1696-1708.
2. J.A. Garay, I.S. Gopal, Connection preemption in communication networks, in: Proc. Infocom '92, 1992, pp. 1043-1050.
3. R.E. Walpole, R.H. Myers, Probability and Statistics for Engineers and Scientists, Macmillan, New York, 1985.
4. Networking Broadband Services Architecture (special issue), IBM Syst. J. 34 (4) (1995).