A service-curve model with loss and a multiplexing problem

被引：8

作者：

Ayyorgun, S ^{[1
]}

Cruz, RL ^{[1
]}

机构：

[1] Los Alamos Natl Lab, Res & Dev Adv Network Technol, Los Alamos, NM 87545 USA

来源：

24TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS | 2004年

关键词：

D O I：

10.1109/ICDCS.2004.1281644

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We propose a new service model based on service curves, which has a loss aspect. In this model, instead of forcing all the packets to meet their deadlines assigned via a service curve, we allow some packets to be dropped. Specifically, the new model is based on guaranteeing at least a certain fraction of the all packets to meet their deadlines assigned via a service curve. The proposed model is composable. We find a necessary and sufficient condition to employ for an efficient Connection Admission Control at a multiplexer to deliver the services according to the new model, via a graph-theoretic approach. A scheduling algorithm to deliver the services as specified by the new service model, at a multiplexer, also exists.

引用

页码：756 / 765

页数：10

共 21 条

[1]

ALBANESE A, 1996, IEEE T INFORMATION T, V42

[2]

[Anonymous], 1998, SIGCOMM

[3]

[Anonymous], PERFORMANCE GUARANTE

[4]

ATLAS A, 1998, 18 IEEE REAL TIM SYS

[5]

Ayyorgun S, 2003, LAUR033668

[6]

AYYORGUN S, 1999, P 37 ANN ALL C COMM, P124

[7]

AYYORGUN S, 2003, LAUR033939

[8]

AYYORGUN S, 2001, THESIS U CALIFORNIA

[9]

BOORSTYN R, 2000, P IEEE INF 2000 MAR

[10] A CALCULUS FOR NETWORK DELAY .1. NETWORK ELEMENTS IN ISOLATION [J].

CRUZ, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (01) :114-131

← 1 2 3 →