Call Admission Control on Single Node Networks under Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) Scheduler-Reference-Cited by-同舟云学术

Call Admission Control on Single Node Networks under Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) Scheduler

Published:2012 Issue:2 Volume:E95-B Page:401-414
ISSN:0916-8516
Container-title:IEICE Transactions on Communications
language:en
Short-container-title:IEICE Trans. Commun.

Author:

HANADA Masaki¹,NAKAZATO Hidenori²,WATANABE Hitoshi³

Affiliation:

1. Department of Information Systems, Tokyo University of Information Sciences

2. Graduate School of Global Information and Telecommunication Studies, Waseda University

3. Faculty of Engineering, Tokyo University of Science

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Electrical and Electronic Engineering,Computer Networks and Communications,Software

Link

http://www.jstage.jst.go.jp/article/transcom/E95.B/2/E95.B_2_401/_pdf

Reference20 articles.

1. A generalized processor sharing approach to flow control in integrated services networks: the single-node case

2. [2] A. Parekh and R. Gallager, “A generalized processor sharing approach to flow control in integrated services networks: The multiple node case,” IEEE/ACM Trans. Netw., vol.2, no.1, pp.137-150, April 1994.

3. [3] R. Szabó, P. Barta, F. Nemeth, and J. Biró, “Worst-case deterministic delay bounds for arbitrary weighted generalized processor sharing schedulers,” Proc. IFIP-TC6/European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks, pp.727-739, May 2000.

4. [4] R. Szabó, P. Barta, F. Nemeth, J. Biró, and C.G. Perntz, “Non rate-proportional weighting of generalized processor sharing schedulers,” Proc. IEEE GLOBECOM 1999, vol.2, pp.1334-1339, Dec. 1999.

5. [5] Z.L. Zhang, Z. Liu, and D. Towsley, “Closed-form deterministic end-to-end performance bounds for the generalized processor sharing scheduling discipline,” J. Combinatorial Optimization (Special Issue on Scheduling), vol.1, no.4, pp.457-481, 1998.