ѧ
JOURN AL OF SOFTWARE
1999ꡡ1010ڡVol.10No.101999



ýϢQoSĿ
 
ժҪ ˶ýϢڷ(QoS)оһЩĹ,˽ɿƺԴΡQoSѡ·ԴԤQoSĴȡۺϷQoSƵ.»˶ýϢQoSƵļԼٵͽһо.
ؼʷ(QoS),ɿ,Դ,QoSѡ·,ԴԤ,QoS.
ͼTP393
On QoS Control of Multimedia Information Networks
LIN Chuang
(State Information Center Beijing 100045)
Abstract This is a review paper on recent works about quality of service (QoS) of multimedia information networks. A brief of the technologies considered in the literatures is given in this paper. These technologies include admission control, traffic shaping, QoS routing, resource reservation, QoS based scheduling, and QoS control for integrated services. A few of methodologies, research directions and open problems in this area are discussed in this paper.
Key words Quality of service (QoS), admission control, traffic shaping, QoS routing, resource reservation, QoS scheduling.
ڵ,ӦҪṩ(QoS),,Ƶ顢IP绰Զ̽.ýϢQoSƼҲһĺļ֮һ,ǵǰо뿪ȵ.
ýоչ쳣Ѹ,QoSоѾһЩɹ,ЩɹطӳIEEE INFOCOMÿĻļInternetIETF RFC(request for comments)׼ݰ.,ĿǰQoSоںܶ෽Ȼǿŵ,Ҫ:(1) ϵͳ״̬·仯Ĳȷ,ͨ·--˴ԤȱЧı֤;(2) QoSѡ·ԴԤϢ㷨ĸ,ӦϢ䴦ʱҪ;(3) QoSҪµԴõЧ,ܳԴ;(4) QoSƷϻǾ̬,ȱЧĶ̬Ʒ;(5) һЩоɹҪ,ûγרƷ.ִ罻·ȫ֤û,ȱ򵥶ЧĿƷ㷨ʵ,ؽĽ.Internet,ΪʹIP(Internet protocol)粻ܴʵʱϢ,һܴʵʱĶýϢ,ϵı׼֯,ITU,IETFѿʼݲһЩIPʵʱͨŵı׼,ʵʱЭ/ʵʱЭRTP/RTCP(real-time protocol/real-time control protocol)ԴԤЭRSVP(resource reservation protocol)ԼH.323׼.ЩЭͱ׼ûƵоṩһĻ,кԶ·Ҫ.
QoSҪϢʵʱԺϢʧĹƵ[1].ڶý,ͬûвͬĴҪ.,ƵƵĴʵʱҪ,ʱϢʹ,ͬʱĳ̶ֳȵϢʧ;ݵĴϢĶʧ,ʱ򲻳.,Ҫ֤ϢʵʱԺͶʧۺҪǶý紫ƵһҪ[2].
ҪοIEEE INFOCOM 97ꡢ9899ԼInternetйQoSRFC׼ݰ,߶о,QoS4ֺ̽,ǰɿƺԴΡQoSѡ·ԴԤQoSĴȡۺϷQoS.ȻATMInternetQoSƵЭʵͬ,QoSƵļ˼·ȴԻ.صоļ˼·.Щ˼·ͼԶýQoSƵ⡢ƺʵ־ձ.
1ɿƺԴ
Ϊ˱֤QoS,κʵʵQoSƷ뿼Ƕûʵʩɿ(admission control),Դʵʩ(traffic shaping)[3].
QoSĴҪûǰнɿ[4,5].ûʱҪûԼĴԺͲԼҪķ֪,ٸûĴҪִԴ,ͬûЭ̾ǷɽһµQoS.
QoSɿ,3ҪҪо:ЩȷеһӵĴ?ʹЩоǷһµ?봫֮Ĺϵ?
(1) 
ĿǰQoSо,ҪûṩйQoSԵĲҪ:
ֵ(peak packet rate): ָе˲,òڷʱĵʾ;
ƽ(sustained packet rate): ָһʱڷ鴫ƽ;
鶪ʧ(packet loss rate): ָڳ,϶ʧķûķ֮;
鴫ʱ(packet transfer delay): ָԴԴڵĿĽڵ֮ʱ,ɴʱӡŶʱӡʱӵ;
ʱӱ仯(packet delay variation): Ƿ鴫ʱӵı仯,ñȡֵʱ,ζҪӳ(ͼ)ṩϴĻ.
(2) о
оָжǷһµʱ.鴫ʱӺͷ鶪ʧ[6]õĽо.
QoS,鴫ɲͳƶ·õķԴ,ûй̶ʵרŵ,ĳһӴʱ,ռӵԴ,ӶӰӵķ,رڶý紫иͻԡʵص,䴫ʱ仯ܿ,˽ɿƹ̵ĸ.ʹóʱƽ鴫ʱӺͷ鶪ʧΪо,ֱܳʾý١̬仯ĳ̶,˱ܷӳ˲Ϊо.һЩʱ˲Ϊо,,ʱӵı仯鶪ʧ仯ʵӦڶýв.
(3) 봫֮Ĺϵ
ڶýĽɿ,һҪоǸִ֮Ĺϵ.һЩԵĹϵӰѾ,θѧ֮ĹϵȻս,ڶִ·õ¸һ.
ڶý,Ǹ߶ͻ,䴫ʱ仯ܴ,QoSϵͳһҪԷ鵽ٽβûʹõŵʵм.ԴκʹؼҪеͻԴ,ﵽQoSܵĿ.μɹĹؼڼٴʱӺͷĶʧ.
ʹôƺԴ,ͼ1ʾ.b(t)ʾʱ䳤tԴܹͽķ,Aj[s1,s2]ʾʱ[s1,s2](Ự,ڱ,һ㲻)jķ.ƺԱΪ


ĿǰõԴκʹؼǡ©Ͱ(leaky bucket)㷨,㷨ɽͻԴתΪƽ,ȷûĴûڽʱĹ涨.
©Ͱ㷨Ļ˼,κһҪ,һҪƳ(©Ͱ)ȡһ,ʱƳΪ,÷鱻ʧ.ƽR,ƳɴP(P©ͰĴС),Ƴʱ,²Ʊ,ͼ2ַʾͼ.©Ͱ㷨޶Դģ,ƺb(t)=P+Rt.һԴ̵ʱڷPͻϢ,ڳʱΧ,Դ޶ƽR[7].
һĽ,ڷ鵽©Ͱǰһ,,ƳΪʱ,ֻҪû,ͿԻڻжʧ,ͼ3ʾ.

ͼ2©Ͱ巨ͼ3©Ͱ㷨
Щ©Ͱ㷨һЩȱ,,ʹ縺غܵʱ,©Ͱ㷨ΥԼȻö뻺ķ,㷨,˴,Դ˷.ñ־ԶԴ˼Ը:鵽,ƳΪջ򻺳ʱ,ͽ÷һ־,˵ΥԼ,Ȼ,ĳӵ,,һֱûӵ,ɵĿĽڵ.ҲĿǰIPõַĻ˼·.
Դν޶Դ,QoS䲻Ҫ[8].
2QoSѡ·ԴԤ
QoSѡ·漰ѡ·ҪĿ[9]:ѡQoSҪͨ·;ڶеͨ·,ѡһЧͨ·ɸ.QoSѡ·Ҫѡ·Ϣ(,·״̬)ѡ·㷨.Ϣ֮ǰ,ԴڵĿĽڵ֮佨ĳ[10],ΪԤЧĴԴ[11].ԤԭȷQoSĶ--ʱӺͷ鶪ʧ,Ŀǰоƫڶ--ʱӱ֤.ʱӻϰ̶ʱ(·ʱӵ)Ŷʱ.̶ʱӱѡͨ·,ͨ·ѡ㷨;ŶʱQoSƵĵȲԾ.һ,ǽܺʱӱ֤ѡ·㷨ѡ·ĲԡȷϢѡ·Լѡ·ʵ.
2.1·ʱӱ֤ѡ·㷨
ڼٶ·ĴϢȷЧ,һһͼG=(V,E)ʾ,Vǽڵ㼯,E·().i,jV·e=(i,j) E,ܹϢĴΪB(e)/.ÿ·eϴʱΪD(e),һʱtӽڵi,ʱt+D(e)ڵj.·ʱD(e)·׼ʱ·ϵĴʱ.ڷ,r·e,ʱʱΪr/B(e)+D(e)[12].
һӽڵi0ikͨ·,·(i0,i1),(i1,i2), ,(ik- 1,ik),j=1,0, ,(k- 1),(ij,ij+1)E.i0,i1,,ikǲͬ,ͨ·Ǽ򵥵.ͨ·PʱD(P)ʾ,D(P)=K-1j=0,ej=(ij,ij+1).ͨ·ĴB(P)ʾ,B(P)=minK-1j=0B(ej).
·ʱӱ֤:G=(V,E),eEʱD(e)ʹB(e),ǼһԴڵsĿĽڵdͨ·P,PϷr,ʹôs͵1dһֹĴʱ䲻t ,༴r/B(P)+D(P).
2.2ѡ·
QoSѡ·ͨ·Ҫ(--ʱӱ֤),ҪЧ(ԴҪ).ҪﵽҪĿ:ټĸԺŻԴ[13].
жĿQoSѡ·ǵ͵NPȫ.,һʹһЩ׼Ʒ,ǲڴģġӵ.Ŀǰ,㷨оεġѹ˽ṹԷ[13].
ԴڵĿĽڵڶཻͨ·,һҪѡ·ѡһͨ·.ѡ·ԵĿǱ֤ʡŻԴĺǿӦһе.ⷽ澭ǵĲ԰:ƽ⡢ʱӡ-ͨ·͸ѡ(ȷ·״̬).
·,ڵһ,ÿһĴҪǳ,ͬһ·޹,ѡСͨ·(least-loaded path)Կƽ縺,ûĸ.Ȼڶýķ齻,·ͳƸúͲͬĻ,ͨ·ѡĲͬĸƽ෴[14],ѡͨ·(worst-loaded path)ԿɴﵽϺõЧ,Сͨ·¸ΪҪߴûз.,ͳƸ,ͬĴͬһͨ·ϻЧ,ѡǰԴʸʷֲѹͨ·ԽʡҪ[14].
2.3ȷϢеѡ·
ģ,Ԫ״̬ĲȷҲȻ.ѡ·ֺͽƵϢ,ʹѡͨ·ȻQoS.ṩҪϢ?Чʹõ.,ǿԿʹƽֲֵ̬һܷΧáֵ.ͨ·ѡ̵Ŀ֮һѡһͨ·ʹQoS[15].ͬ·״ֵ̬ϵȷиʷֲȡ޸ĺ綯̬Ϊ֪ʶ.ڹ㷺ĸʷֲ,ǲܵ.Ȼ,ԶоۼԵһֲȷкЧ㷨.ʵϵͳеĵͷֲֲ.ʵʩȷϢѡ·ʱ,Կǽ--ʱƷֽΪֲʱ,Ա㽨Че㷨.Ȼ·״ֵ̬ĸʷֲѡ·ۺŻ.
2.4ѡ·ʵ
ʵѡ·ʵ,ѡ·һЩֲЭ,Ҫ·״̬Э顢ԴԤЭRSVP[9,11]ʵʱЭ/ʵʱЭ.·״̬Эÿڵȵǰ޸ĺڵ㲥ڵ޸[13].ԴԤЭҪɴԴԤ.ʵʱЭ/ʵʱЭʵʱŶӴͿ.IPۺϷ,һŵ·Э顰·ȡ (open shortest path first,OSPF)ʵ.ڴ˻,ѼQoSѡ·չʵ[16].
InternetƵӦ,ѡ·Ƕ·ӵ,˺ܶڵ,ЩԱǶ̬仯.ֻʵֶ̬ѡ·ԤԴһ[9].
3QoSĴ
㷨ĻǴӽڵÿһ·ѡһЧڷ͵ķ.QoSȿҪڼԭ,,ı֤ĸ롢ʱӵı֤͹ƽѡ.Э㷨ĸҪӦٴͱʵ,ʹпչԺ³.㷨ԷΪ:ʵĵ㷨ͻʱĵ㷨.
ĿǰҪĵȲԶǽƹ崦(generalized processor sharing,GPS)ĵȲ.Internet,йؽGPSȲԵĹ涨[8].ڴ(processor sharing,PS),ÿ(Ự)һȽȳ(FIFO),ǹͬ·.κʱNǿն,·ʵ1/NͬʱڶͷN.PSͬʷзǿն,GPSPS,ͬĻỰвͬķ.GPS:Ա֤˵нʱӷȷĹƽ.
GSP[17].N(Ự)Nʵ1,2, ,N̻,Wi(s,t)ǻỰiʱ[s,t]շķ.[s,t]ڼڴĻỰiҪвʽ:
 (1)
[s,t]ڼڴκỰij,
. (2)
ʽ(2),f iıֲе[s,t]ڼڴĻỰ,ˣf iԽȨ.CǷ,лỰķ
. (3)
ʽ(1)(3),ܻûỰiСxiΪ
 (4)
ʽ(4)GPSĸ,ÿһỰỰӰ,Сʵ½,ʵ½ȷ˻ỰʱӵϽ.ȨСҪķ,ֱʾ˹ƽı.
ɷȨĺͽɿƵı֤֪
(5)
GSPԱ,GSPͬʱṩ͹ƽͬʺʱӵı֤[17].
GPSֻһģ,ȫʵӦ.ȤGSPĵҪǷ鴫䲢ʱĵ[18].ϵͳͷ֮:κʱ,ϵͳжͬʱܷ,ڷнһܷ.ʱӱ֤ЩGSPĹ,ƽÿ㷨ȴͬ.ڽGSPĽڵ,ʹϵͳʱ亯Ϊϵͳеķʱǩ,ʱǩ涨Ӧʱ,ķʱǩֵӴ.ÿỰͷķʱǩֵΪỰʱǩֵ.ϵͳʱ亯㷨ʱӺ͹ƽ.
GPSԵ㷨ʵֵĸҪάֺͷʱǩĸԾ,:(1) ϵͳʱ亯Ҫĸ;(2) Ϊѡͷ;Сʱǩзĸ;(3) ʹ洢ʱǩĻ.
򻯽GPSԵ㷨ʵֵĸQoSȲԵҪо.ɢʵ㷨[18]ҪÿһӼʹ洢һʱǩ,ÿһάһʱǩ.ֵзǳ򵥵νṹ.νṹĵͲ,ʹȽȳ(FIFO),һһFIFO,һнһʱǩ.ͬʵʹһ,ͼʱǩ,ʵֵĸ.νṹĸ߲,ʹһƽ,ڲͬFIFOне.
оĽGPSȲԵʱӹƽŶ(self-clocked fair queueing,SCFQ)[19]ʱ(virtual clock,VC)״ƽȨƽŶ(worst-case fair weighted fair queueing,WF2Q)[20]СʱʱӹƽŶ(minimum-delay self-clocked fair queueing,MD-SCFQ)[18].ƽŶӷ˼·ǸÿһỰԶЧĹƽ,༴ȵĴȡȨ.ڼȨƽŶӷ,Է䲻ͬȨͬĻỰ.
ڼȨƽŶӷ,һеÿڵ˷ʱⶼҪеȴʱ,ЩȴʱҪۼ,γɻỰʱӵһ.[21]Э絽(coordinated-earliest-deadline-first,CEDF)ĵ㷨˷ȴʱӵۼ.һһͨĵ1,ܺܿͨʣµķ.CEDF㷨ûۼӷͨÿĵȴʱ.
4ۺϷQoS
ۺϷ[22],Էֳ:QoS;(best-effort).QoSĿǰֿɷΪ֤(guaranteed service)[8]Ƹط(controlled-load service)[23]ַ(differentiated services)[24]ȴ.ҪQoS,Ϊѡ·,ԤʹԴ[25]ʵʱȿ.õĴûQoS֤,Զ̬ظı,Ըݵǰʱ̵ĴҪЧз.
,ʵʱһʹóλ(constant bit rate,CBR)ʵʱɱλ(variable bit rate,VBR);ʵʱһʹ÷ʵʱɱλʡЧλ(available bit rate,ABR)޹涨λ(unspecified bit rate,UBR).ʵʱQoSƵĴ,͵ӦðƵƵŵӦ.ABRڵ͵ľô,͵ӦðļE-mailĴ.
ֱǲͬ񼶱ѡ·,QoSѡ·Ӽû,ôѡ·,ӱ·ӵ͸ĽÿỰ.ۺϷаŶʱ,ΪÿһѡһŻͨ·,Żͨ·ӵ.,Ҫһܹݵǰĸڲ֮ͬ䶯̬ط·Դ,ۺϷQoSѡ·ܹؼ[26].ۺϷQoSѡ·ʹ3ֲ.
(1) ̬·.·̬QoS;ô֮.ִʱ̬ıʱ,ξ̬ؾԴķ.,ÿִвǾֲ,QoSܼһ,ôһ,̬ԲӦֲƽ.
(2) 붯̬·.ͬ·,ڵ޸ĲͬԴ.ֲԲӦ·ʵͻȻı,ǵķӳʱ̫.
(3) ̬·.ֱͬ·,ǵInternetҪǾô,QoSѡ·Ӧѡôӵ·.Ϊ˸õرʾ·,[26]вʣʾͬ״.
ΪȷQoSĶ--ʱӽ,ҪQoS״ԤԴ,,QoSʵʵʱҪԶСڱ֤Ķ--˵ʱӽ,Ʊ޶ԴЧ.ݶĳЩ״ͳ,·õʽ30%[7].,ƵŵӦ,ڷ鵽ﾭҪݵʱ,ڽϵͳҪ,ֱӦô[8].һҲϵͳҪٷ鵽Сʱ֮Ĳ.
Ϊ˿˷Դʵ,QoSԤԴܳʱ,Կʱ뾡ôʹⲿֿеԴ.QoSȫæʱ,QoSȫռԤԴ.Ķ̬ȼȿQoSQoSҪ,ֿ[27].
ڶ̬Ȳ,һֱӺͼ򵥵ķÿڵô͵Ŀȼ[28].ͼ4ʾ,ٶỰ1~kQoSҪĴ,Ựk+1NǾô.Ự1~kҪԴ,Ựk+1NҪԴ.д1~kȶдk+1Nиߵķȼ,д1~kûзʱ,дk+1Nеķб͵Ŀ.QoSÿһỰ,ӽʱԸҪQoSÿһỰһȼ[7].

ͼ4 ۺϷľ̬ȼ
־̬ȼֵܳԴ[29].һַ,ֻҪQoSʱĿĽڵҪ͸ôߵĿȼ[30,31].ַ˼·ȻǰһַЧ,Ҳƽ,ʵҲϸ.ַһʵַԿQoSı߽ڵ㴫ʱӵĽ޺ʹʱ.ͨ·ÿڵ,ÿһҪ뿪ڵQoSһʱ䡰ʴ,ʱʴ¼ൽĿĽڵʱ.ÿڵԸʱʴ;ֲȴ뾡ô,ʴʱ,ʴʱΪʱܲ뾡ô.ַһؼνÿڵĵ㷨Ϊĵ㷨.ؿ̻ڵֲƵܶܵӰһѵ[32].
һֶ̬ȼ,ԿǼÿһQoSÿһڵͣʱ,ﵽͣʱ޵QoSȷȨ,QoS鶼ûдﵽͣʱʱ,ôߵĿȼ[33].
ۺϷ,ûԸݷҪ󡢷úϲѡļ.ôͻĴ䷢ӵҲҪʱ,ػƿԽôͻĴתQoS񼶱[34].
ýQoSƵƺʵڶ,һƺʵлжǡõġ[1].еQoS˼·ͼڶĿۺϷиս,Ȼǿ.
עͣоõȻѧ͹863߿ƼĿ
߼飺 1969ʿоԱҪоΪϵͳۼ磬
Petri
ߵλϢ  100045
ο
1.Shenker S, Wroclawski J. Network element service specification template. IETF 
FC 2216, September 1997
2.ִ.ATMһʵʱȺͷ鶪ʧƵۺϷ.ѧ,1998,21(4):333
340(Lin Chuang. Integration of traffic scheduling and cell loss control in ATM
networks. Chinese Journal of Computers, 1998,21(4):333340)
3.Reisslein M, Ross K W, Rajagopal S. Guaranteeing statistical QoS to regulated 
traffic: the single node case. In: Proceedings of the 18th Annual Joint 
Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM99). 
New York: IEEE Computer Society, 1999. 16011072
4.Lin Chuang, Chanson S T. ATM admission models of stochastic high level Petri 
nets based on hierarchical modeling. In: Proceedings of 1995 International 
Conference on Network Protocols. Tokyo: IEEE Computer Society, 1995. 144151
5.ִ,Ԫ.߼PetriATMɿƹģ.ͨѧ,1998,19(12):1
7(Lin Chuang, Zhang Yuan-sheng. Modeling ATM admission control procedures 
using stochastic high level Petri nets. Journal of China Institute of 
Communications, 1998,19(12):17)
6.Kurz T, Thiran P, Boudec J L. Regulation of a connection admission control 
algorithm. In: Proceedings of the 18th Annual Joint Conference of the IEEE 
Computer and Communications Societies (IEEE INFOCOM99). New York: IEEE 
Computer Society, 1999. 10531060
7.Knightly E W. Enforceable quality of service guarantees for bursty traffic 
streams. In: Proceedings of the 17th Annual Joint Conference of the IEEE 
Computer and Communications Societies (IEEE INFOCOM98). San Francisco,CA: IEEE
Computer Society, 1998. 635642
8.Shenker S, Partridge C, Guerin R.Specification of guaranteed quality of service.
IETF RFC 2212, September 1997
9.Crawley E, Nair R, Rajagopalan B et al. A framework for QoS-based routing in the
internet. IETF RFC 2386, August 1998
10.Cidon I, Rom R. Multi-path routing combined with resource reservation. In: 
Proceedings of the 16th Annual Joint Conference of the IEEE Computer and 
Communications Societies (IEEE INFOCOM97). Kobe: IEEE Computer Society, 1997. 
92100 
11.Braden R, Zhang L, Berson S et al. Resource ReSerVation Protocol(RSVP)(Version 
1): Function Specification. IETF RFC 2205, September 1997 
12.Rao N S V, Batsell S G. QoS routing via multiple paths using bandwidth 
reservation. In: Proceedings of the 17th Annual Joint Conference of the IEEE 
Computer and Communications Societies (IEEE INFOCOM98). San Francisco, CA: IEEE 
Computer Society, 1998. 1118
13.Orda A. Routing with end to end QoS guarantees in broadband networks. In: 
Proceedings of the 17th Annual Joint Conference of the IEEE Computer and 
Communications Societies (IEEE INFOCOM98). San Francisco, CA: IEEE Computer 
Society, 1998. 2734
14.Su C F, Veciana G. On statistical multiplexing, traffic mixes, and VP 
management. In: Proceedings of the 17th Annual Joint Conference of the IEEE 
Computer and Communications Societies (IEEE INFOCOM98). San Francisco, CA: 
IEEE Computer Society, 1998. 643650
15.Lorenz D H, Orda A. QoS routing in networks with uncertain parameters. In: 
Proceedings of the 17th Annual Joint Conference of the IEEE Computer and 
Communications Societies (IEEE INFOCOM98). San Francisco, CA: IEEE Computer 
Society, 1998. 310
16.Apostolopoulos G, Guerin R, Kamat S. Implementation and performance 
measurements of QoS routing extensions to OSPF. In: Proceedings of the 18th 
Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE
INFOCOM99). New York: IEEE Computer Society, 1999. 680688
17.Toutain F. Decoupled generalized processor sharing: a fair queuing principle 
for adaptive multimedia applications. In: Proceedings of the 17th Annual Joint 
Conference of the IEEE Computer and Communications Societies (IEEE 
INFOCOM'98).San Francisco, CA: IEEE Computer Society, 1998. 291298
18.Chiussi F M, Francini A. Implementing fair queuing in ATM switches: the 
discrete-rate approach. In: Proceedings of the 17th Annual Joint Conference of 
the IEEE Computer and Communications Societies (IEEE INFOCOM98).San Francisco,
CA: IEEE Computer Society, 1998. 272281
19.Golestani S J. A self-clocked fair queuing scheme for broadband applications. 
In: Proceedings of the 13th Annual Joint Conference of the IEEE Computer and 
Communications Societies (IEEE INFOCOM94). Toronto: IEEE Computer Society, 
1994. 636646
20.Bennett J C R, Zhang H. WF2Q: worst-case fair weighted fair queuing. In: 
Proceedings of the 15th Annual Joint Conference of the IEEE Computer and 
Communications Societies (IEEE INFOCOM96). San Francisco, CA: IEEE Computer 
Society, 1996. 120128
21.Andrews M, Zhang L. Minimizing end-to-end delay in high-speed networks with a 
simple coordinated schedule. In: Proceedings of the 18th Annual Joint Conference
of the IEEE Computer and Communications Societies (IEEE INFOCOM99). New York: 
IEEE Computer Society, 1999. 380388
22.Braden R, Clark D, Shenker S. Integrated services in the internet architecture: 
an overview. IETF RFC 1633, June 1994
23.Wroclawski J. Specification of the controlled-load network element service. 
IETF RFC 2211, September 1997
24.Nichols K, Jacobson V, Zhang L. A two-bit differentiated services architecture 
for the internet. IETF Internet Draft  draft-nichols-diff-svc-arch-00.tex , 
Nov. 1997
25.Wroclawski J. The use of RSVP with IETF integrated services. IETF RFC 2210, 
September 1997
26.Ma Q, Steenkiste P. Supporting dynamic inter-class resource sharing: a 
multi-class QoS routing algorithm. In: Proceedings of the 18th Annual Joint 
Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM99).
New York: IEEE Computer Society, 1999. 649660
27.Elwalid A, Mitra D. Design of generalized processor sharing schedulers which 
statistically multiplex heterogeneous QoS classes. In: Proceedings of the 18th 
Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE 
INFOCOM99). New York: IEEE Computer Society, 1999. 12201230
28.Lin D. Constant-time dynamic ATM bandwidth scheduling for guaranteed and best 
effort services with overbooking. In: Proceedings of the 16th Annual Joint 
Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM97). 
Kobe: IEEE Computer Society, 1997. 398405
29.Li B, Lin C, Chanson S T. Analysis of a hybrid cutoff priority scheme for 
multiple classes of traffic in multimedia wireless networks. ACM Journal of 
Wireless Networks, 1998,4(4):279290
30.Cruz R L. SCED+: efficient management of quality of service guarantees. In: 
Proceedings of the 17th Annual Joint Conference of the IEEE Computer and 
Communications Societies (IEEE INFOCOM98). San Francisco, CA: IEEE Computer 
Society, 1998. 625634
31.Chang C S, Cruz R L. A time varying filtering theory for constrained traffic 
regulation and dynamic service guarantees. In: Proceedings of the 18th Annual 
Joint Conference of the IEEE Computer and Communications Societies (IEEE 
INFOCOM99). New York: IEEE Computer Society, 1999. 6370
32.Mithal S. Bounds on end-to-end performance via greedy, multi-path routing in 
integrated services networks. In: Proceedings of the 17th Annual Joint 
Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM98).
San Francisco, CA: IEEE Computer Society, 1998. 1926
33.ִ.ATMڶгֵĴ.ѧ,1998,9(4):316320
(Lin Chuang. Traffic scheduling based on the queue length threshold in ATM 
networks. Journal of Software, 1998,9(4):316320)
34.Altman E, Orda A, Shimkin N. Bandwidth allocation for guaranteed versus best 
effort service categories. In: Proceedings of the 17th Annual Joint Conference  
of the IEEE Computer and Communications Societies (IEEE INFOCOM98). San 
Francisco, CA: IEEE Computer Society, 1998. 617624
ո:1999-06-07޸:1999-08-09
