Determining end-to-end delay bounds in heterogeneous networks

被引：34

作者：

Goyal, P

Lam, SS

Vin, HM

机构：

[1] Department of Computer Sciences, University of Texas at Austin, Taylor Hall 2.124, Austin

[2] Indian Institute of Technology, Kanpur

[3] Department of Computer Sciences, University of Texas, Austin, TX

[4] University of California, Los Angeles, CA

[5] IBM T.J. Watson Research Center, Yorktown Heights, NY

[6] University of Texas, Austin, TX

[7] University of California, San Diego, CA

[8] Distributed Multimedia Comp. Lab., University of Texas, Austin, TX

来源：

MULTIMEDIA SYSTEMS | 1997年 / 5卷 / 03期

关键词：

D O I：

10.1007/s005300050052

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 [计算机科学与技术];

摘要：

We define a class of Guaranteed Rate (GR) scheduling algorithms. The GR class includes Virtual Clock, Packet-by-Packet Generalized Processor Sharing and Self-Clocked Fair Queuing. For networks that employ scheduling algorithms belonging to GR, we present a method for determining an upper bound on end-to-end delay. The method facilitates determination of end-to-end delay bounds for a variety of sources. We illustrate the method by determining end-to-end delay bounds for sources conforming to Leaky Bucket and exponentially bounded burstiness.

引用

页码：157 / 163

页数：7

共 18 条

[1]

[Anonymous], THESIS MIT CAMBRIDGE

[2]

CLARK D, 1992, P ACM SIGCOMM, P14

[3]

A CALCULUS FOR NETWORK DELAY .2. NETWORK ANALYSIS [J].