服务元网络体系结构及其关键技术研究
|
摘要
TCP/IP随着互联网的迅速发展而广泛流行,取得了巨大的成功,成为事实上的工业标准,在网络界形成了一统天下的局面。但随着网络规模的急剧扩大和各种应用的开发,此时Internet的发展已经超出了最初体系结构的框架,体系结构上的先天不足和后来各种技术的无序发展,使TCP/IP的缺陷和弊端不断暴露出来,人们逐渐认识到网络体系结构的重要性。目前国内外对网络体系结构的研究表现在两个方面:一方面是对TCP/IP进行改进,但是难以解决TCP/IP先天存在的QoS、安全性和可扩展性等问题。另一方面是针对网络技术发展的特点,结合网络应用的需要,进行新型网络体系结构的研究,从而解决TCP/IP的根本问题。
本文论述的服务元网络体系结构就是一种全新的非层次型网络体系结构。论文首先详细分析了TCP/IP网络体系结构存在的问题,并阐述了新型网络体系结构的发展状况,然后对服务元网络体系结构及其关键技术进行了深入研究。
本文的主要创新点包括:
1.首次提出了服务元网络体系结构的网络构建规则、设计方案和实现模型。在曾家智教授提出的服务元网络体系结构思想的基础上,本文提出,根据网络需求,通过服务组合将服务元组织在一起,从而实现服务元网络体系结构的网络构建。依据该构建规则,本文进而提出了服务元网络体系结构的网络设计方案和实现模型。
2.提出了基于端口间虚电路的QoS机制。传统的虚电路是节点间虚电路,不能区别对待相同节点间不同端口的数据流,因此无法保证业务端到端的QoS。而在基于端口间虚电路的QoS机制中,套接字直接与端口间虚电路标识绑定,因此可以为相同节点间不同端口的业务提供不同的服务,从而保证网络业务的端到端QoS需求。
3.本文分析了端口间虚电路的数据传输规律,在此基础上提出了两种可靠数据传输机制。
(1)提出了针对非紧急文本数据的自适应累计确认的滑动窗口协议SASW-AA。由于端口间虚电路传输数据的路径固定,因此数据包的到达顺序与发送顺序一致,数据包不会发生错序。根据这种数据传输规律,本文提出可以用一个ACK自适应地累计确认一组数据包,从而解决传统滑动窗口协议确认帧频繁导致上行链路拥塞的问题,而同时又能保证数据的可靠传送。
(2)提出了针对紧急文本数据的立即重传的滑动窗口协议SWIR。与数据报方式不同,在端口间虚电路传输方式中,只要接收方收到失序的数据包,就可以断定有数据包丢失了。针对传统的滑动窗口协议存在着不能及时重传数据包的问题,本文提出了立即重传丢失数据包的方案,避免了不必要的等待时间,降低了紧急数据的传输延迟。
4.本文提出了三种新的生存性算法。
(1)提出了混合共享路径保护算法HSPP。为了解决通路保护(Path Protection)方法备份路径建立成功率低的问题,HSPP算法首先使用通路保护方法建立备份路径,如果建立失败,则将工作路径动态地划分为工作路径段,在划分工作路径时,需要保证其备份路径段跳数不能超过限制值。HSPP算法不但提高了备份路径的建立成功率,而且能够在恢复时间与资源利用率之间获得更好的折中。
(2)提出了一种新的带有共享风险链路组(SRLG)约束的路由选择算法NRSSC。与传统算法不同,NRSSC算法将SRLG作为链路代价公式的一部分,在选择工作路径时主动避免SRLG链路,较之传统算法,有效提高了成功保护率。而且由于考虑了区分可靠性(DiR)要求,在提供不同级别保护服务的同时,提高了网络资源利用率。
(3)提出了快速重构恢复算法FRRA。FRRA算法也是在故障发生以后建立恢复路径,但与以往恢复(Restoration)算法不同,该算法不用等待路由表收敛,不需要网络中其它路由器的路由信息,而是由保护入口路由器根据本地信源树、故障信息和路由策略独立确定恢复路径,因此大大降低了恢复时间,减少了丢包率。
本文提出的服务元网络体系结构的可靠数据传输机制和生存性算法也同样适用于其它一些网络。其中,可靠数据传输机制还适用于ATM、MPLS等以固定路径传输数据的网络,特别地,用于以多播树方式传输数据的多播网络,可以大大简化现有的可靠多播协议。而本文生存性算法还可以用于MPLS、GMPLS等网络。
TCP/IP has been prevalent with the rapid development of Internet and achieved great success. It has become the actual industry standard and gotten dominant status in the network world. But with the fast enlargement of network scale and exploitation of diverse applications, now the development of Internet has overstepped the frame of original architecture. The innate shortages of architecture and out-of-order evolution of diversified techniques make the limitations and problems of TCP/IP network emerged continually. People have been cognizant of the importance of network architecture gradually. Now the researches of network architecture in and out of country are in two aspects: The one is to ameliorate TCP/IP. But this is hard to resolve the inborn problems such as QoS, security and expansibility of TCP/IP. The other is to investigate new types of network architecture to resolve the internal problems of TCP/IP according to the characteristic of network techniques and the requirements of network applications.
Service Unit based Network Architecture discussed in this dissertation is a new type of non-layered network architecture. This dissertation first analyzes the problems of TCP/IP network architecture in detail and describes the development status of new types of network architecture. Then Service Unit based Network Architecture and its crucial techniques are investigated in deep.
The major innovations and contributions of the dissertation are as below:
1. The network construct regulation, design solutions and realization model of Service Unit based Network Architecture are proposed. Based on the idea of Service Unit based Network Architecture proposed by Prof. Zeng Jiazhi, this dissertation proposes that in order to construct network of Service Unit based Network Architecture, Service Units are organized by Service Combination according to network requests. Based on this construct regulation, this dissertation proposes the network design solutions and realization model of Service Unit based Network Architecture.
2. QoS scheme based on Virtual Circuit between Ports is proposed. Traditional virtual circuit is between nodes and could not make a difference among data flows which are though the same nodes but belong to different ports. So it could not guarantee end-to-end QoS of applications. While in the QoS scheme based on Virtual Circuit between Ports, sockets are directly bound with the marks of Virtual Circuit between Ports. So different services could be provided to the applications that belong to different ports within the same node and end-to-end QoS requirements of application are guaranteed.
3. Data transmission rule of Virtual Circuit between Ports is analyzed in this dissertation. Based on this analysis, two reliable data transmission schemes are proposed.
(1) Self-adaptive sliding window with accumulative ACK (SASW-AA) protocol for non-instant text data is proposed. Because the path of Virtual Circuit between Ports is fixed, so the sequence of arrived packets is as the same as the sequence of sent packets, that is, the sequence of packets will not be disordered. According to this data transmission rule, in this dissertation, one ACK is used to accumulatively acknowledge a group of packets self-adaptively. SASW-AA protocol could not only resolve the problem of congestion at upper link due to frequent ACKs in traditional sliding window protocol but also guarantee reliable data transmission.
(2) Sliding window with immediate retransmission (SWIR) protocol for instant text data is proposed. In the Virtual Circuit between Ports transmission mode, different with datagram mode, as long as disordered packets are received, it is concluded that some packets are lost. To resolve the problem that packets could not be retransmitted in time in traditional sliding window protocol, this dissertation proposes a solution of transmitting lost packets immediately. This solution could avoid unnecessary waiting time and reduce the data transmission delay of instant data.
4. Three new survivability algorithms are proposed in this dissertation.
(1) Hybrid Shared Path Protection (HSPP) algorithm is proposed. In order to resolve the problem that the success probability of establishing backup paths is low in Path Protection approach, in HSPP algorithm, the Path Protection approach is first used to establish a backup path for the primary path. If the establishment is unsuccessful, then the primary path is dynamically divided into segments. When dividing the primary path, the hop count of its backup segments should be not more than the limitation. HSPP algorithm could not only improve success probability of establishing backup path but also gain a better tradeoff between the recovery time and the resource utilization ratio.
(2) A New Route Selection with Shared Risk Link Group (SRLG) Constraint (NRSSC) algorithm is proposed. Different with traditional algorithms, in NRSSC algorithm, SRLG is taken as one part of link cost function and the SRLG links are avoided when selecting the primary paths. Compared with traditional algorithms, the successful protection probability is efficiently improved. Because Differentiated Reliability (DiR) is considered in this algorithm, it could not only provide protection services of different levels but also improve the resource utilization ratio.
(3) Fast Reestablished Restoration Algorithm (FRRA) is proposed. In FRRA algorithm, the recovery paths are also established after the failure has occurred. But it is different with previous Restoration algorithms in that it need not wait for the convergence of routing tables. Routing information of other routers in the network is not needed and the task of selecting recovery paths is implemented by Protection Ingress Router according to local source tree, failure information and routing policy. So the recovery time and the data lost ratio are greatly reduced.
The reliable data transmission schemes and survivability algorithms of Service Unit based Network Architecture proposed in this dissertation are also suitable for some other networks. In them, the data transmission schemes are also suitable for networks that use fixed paths to transmit data such as ATM and MPLS network. Especially, when used in multicast networks that use multicast tree to transmit data, the reliable multicast protocol could be greatly simplified. The survivability algorithms proposed in this dissertation are also suitable for MPLS and GMPLS networks.
本文论述的服务元网络体系结构就是一种全新的非层次型网络体系结构。论文首先详细分析了TCP/IP网络体系结构存在的问题,并阐述了新型网络体系结构的发展状况,然后对服务元网络体系结构及其关键技术进行了深入研究。
本文的主要创新点包括:
1.首次提出了服务元网络体系结构的网络构建规则、设计方案和实现模型。在曾家智教授提出的服务元网络体系结构思想的基础上,本文提出,根据网络需求,通过服务组合将服务元组织在一起,从而实现服务元网络体系结构的网络构建。依据该构建规则,本文进而提出了服务元网络体系结构的网络设计方案和实现模型。
2.提出了基于端口间虚电路的QoS机制。传统的虚电路是节点间虚电路,不能区别对待相同节点间不同端口的数据流,因此无法保证业务端到端的QoS。而在基于端口间虚电路的QoS机制中,套接字直接与端口间虚电路标识绑定,因此可以为相同节点间不同端口的业务提供不同的服务,从而保证网络业务的端到端QoS需求。
3.本文分析了端口间虚电路的数据传输规律,在此基础上提出了两种可靠数据传输机制。
(1)提出了针对非紧急文本数据的自适应累计确认的滑动窗口协议SASW-AA。由于端口间虚电路传输数据的路径固定,因此数据包的到达顺序与发送顺序一致,数据包不会发生错序。根据这种数据传输规律,本文提出可以用一个ACK自适应地累计确认一组数据包,从而解决传统滑动窗口协议确认帧频繁导致上行链路拥塞的问题,而同时又能保证数据的可靠传送。
(2)提出了针对紧急文本数据的立即重传的滑动窗口协议SWIR。与数据报方式不同,在端口间虚电路传输方式中,只要接收方收到失序的数据包,就可以断定有数据包丢失了。针对传统的滑动窗口协议存在着不能及时重传数据包的问题,本文提出了立即重传丢失数据包的方案,避免了不必要的等待时间,降低了紧急数据的传输延迟。
4.本文提出了三种新的生存性算法。
(1)提出了混合共享路径保护算法HSPP。为了解决通路保护(Path Protection)方法备份路径建立成功率低的问题,HSPP算法首先使用通路保护方法建立备份路径,如果建立失败,则将工作路径动态地划分为工作路径段,在划分工作路径时,需要保证其备份路径段跳数不能超过限制值。HSPP算法不但提高了备份路径的建立成功率,而且能够在恢复时间与资源利用率之间获得更好的折中。
(2)提出了一种新的带有共享风险链路组(SRLG)约束的路由选择算法NRSSC。与传统算法不同,NRSSC算法将SRLG作为链路代价公式的一部分,在选择工作路径时主动避免SRLG链路,较之传统算法,有效提高了成功保护率。而且由于考虑了区分可靠性(DiR)要求,在提供不同级别保护服务的同时,提高了网络资源利用率。
(3)提出了快速重构恢复算法FRRA。FRRA算法也是在故障发生以后建立恢复路径,但与以往恢复(Restoration)算法不同,该算法不用等待路由表收敛,不需要网络中其它路由器的路由信息,而是由保护入口路由器根据本地信源树、故障信息和路由策略独立确定恢复路径,因此大大降低了恢复时间,减少了丢包率。
本文提出的服务元网络体系结构的可靠数据传输机制和生存性算法也同样适用于其它一些网络。其中,可靠数据传输机制还适用于ATM、MPLS等以固定路径传输数据的网络,特别地,用于以多播树方式传输数据的多播网络,可以大大简化现有的可靠多播协议。而本文生存性算法还可以用于MPLS、GMPLS等网络。
TCP/IP has been prevalent with the rapid development of Internet and achieved great success. It has become the actual industry standard and gotten dominant status in the network world. But with the fast enlargement of network scale and exploitation of diverse applications, now the development of Internet has overstepped the frame of original architecture. The innate shortages of architecture and out-of-order evolution of diversified techniques make the limitations and problems of TCP/IP network emerged continually. People have been cognizant of the importance of network architecture gradually. Now the researches of network architecture in and out of country are in two aspects: The one is to ameliorate TCP/IP. But this is hard to resolve the inborn problems such as QoS, security and expansibility of TCP/IP. The other is to investigate new types of network architecture to resolve the internal problems of TCP/IP according to the characteristic of network techniques and the requirements of network applications.
Service Unit based Network Architecture discussed in this dissertation is a new type of non-layered network architecture. This dissertation first analyzes the problems of TCP/IP network architecture in detail and describes the development status of new types of network architecture. Then Service Unit based Network Architecture and its crucial techniques are investigated in deep.
The major innovations and contributions of the dissertation are as below:
1. The network construct regulation, design solutions and realization model of Service Unit based Network Architecture are proposed. Based on the idea of Service Unit based Network Architecture proposed by Prof. Zeng Jiazhi, this dissertation proposes that in order to construct network of Service Unit based Network Architecture, Service Units are organized by Service Combination according to network requests. Based on this construct regulation, this dissertation proposes the network design solutions and realization model of Service Unit based Network Architecture.
2. QoS scheme based on Virtual Circuit between Ports is proposed. Traditional virtual circuit is between nodes and could not make a difference among data flows which are though the same nodes but belong to different ports. So it could not guarantee end-to-end QoS of applications. While in the QoS scheme based on Virtual Circuit between Ports, sockets are directly bound with the marks of Virtual Circuit between Ports. So different services could be provided to the applications that belong to different ports within the same node and end-to-end QoS requirements of application are guaranteed.
3. Data transmission rule of Virtual Circuit between Ports is analyzed in this dissertation. Based on this analysis, two reliable data transmission schemes are proposed.
(1) Self-adaptive sliding window with accumulative ACK (SASW-AA) protocol for non-instant text data is proposed. Because the path of Virtual Circuit between Ports is fixed, so the sequence of arrived packets is as the same as the sequence of sent packets, that is, the sequence of packets will not be disordered. According to this data transmission rule, in this dissertation, one ACK is used to accumulatively acknowledge a group of packets self-adaptively. SASW-AA protocol could not only resolve the problem of congestion at upper link due to frequent ACKs in traditional sliding window protocol but also guarantee reliable data transmission.
(2) Sliding window with immediate retransmission (SWIR) protocol for instant text data is proposed. In the Virtual Circuit between Ports transmission mode, different with datagram mode, as long as disordered packets are received, it is concluded that some packets are lost. To resolve the problem that packets could not be retransmitted in time in traditional sliding window protocol, this dissertation proposes a solution of transmitting lost packets immediately. This solution could avoid unnecessary waiting time and reduce the data transmission delay of instant data.
4. Three new survivability algorithms are proposed in this dissertation.
(1) Hybrid Shared Path Protection (HSPP) algorithm is proposed. In order to resolve the problem that the success probability of establishing backup paths is low in Path Protection approach, in HSPP algorithm, the Path Protection approach is first used to establish a backup path for the primary path. If the establishment is unsuccessful, then the primary path is dynamically divided into segments. When dividing the primary path, the hop count of its backup segments should be not more than the limitation. HSPP algorithm could not only improve success probability of establishing backup path but also gain a better tradeoff between the recovery time and the resource utilization ratio.
(2) A New Route Selection with Shared Risk Link Group (SRLG) Constraint (NRSSC) algorithm is proposed. Different with traditional algorithms, in NRSSC algorithm, SRLG is taken as one part of link cost function and the SRLG links are avoided when selecting the primary paths. Compared with traditional algorithms, the successful protection probability is efficiently improved. Because Differentiated Reliability (DiR) is considered in this algorithm, it could not only provide protection services of different levels but also improve the resource utilization ratio.
(3) Fast Reestablished Restoration Algorithm (FRRA) is proposed. In FRRA algorithm, the recovery paths are also established after the failure has occurred. But it is different with previous Restoration algorithms in that it need not wait for the convergence of routing tables. Routing information of other routers in the network is not needed and the task of selecting recovery paths is implemented by Protection Ingress Router according to local source tree, failure information and routing policy. So the recovery time and the data lost ratio are greatly reduced.
The reliable data transmission schemes and survivability algorithms of Service Unit based Network Architecture proposed in this dissertation are also suitable for some other networks. In them, the data transmission schemes are also suitable for networks that use fixed paths to transmit data such as ATM and MPLS network. Especially, when used in multicast networks that use multicast tree to transmit data, the reliable multicast protocol could be greatly simplified. The survivability algorithms proposed in this dissertation are also suitable for MPLS and GMPLS networks.
引文
[1]Clark D,Tennenhouse D.Architectural Considerations for a New Generation of Protocols.Proceedings of SIGCOMM'90,1990,200-208
[2]Tennenhouse D L,Wetherall D J.Towards an Active Network Architecture.Computer Communication Review,1996,26(2):5-18
[3]Tennenhouse D L,Smith J M,Sincoskie D W,et al.Survey of active network research.IEEE Communication Magazine,1997,35(1):80-86
[4]Van der,Merwe J E,et al.The Tempest-a practical framework for network programmability.IEEE Network,1998(5):20-28
[5]Michael Fry,Atanu Ghosh.Application Level Active Networking.Computer Networks,1999,31(7):655-667
[6]Boecking s.面向对象的网络协议(陈葆钰译).北京:机械工业出版社,2000,77-126
[7]Boecking S.Performance and software evaluation of the modular TIP communication system.IEEE Global Telecommunications Conference,1996,Vol.1:73-77
[8]Boecking S.Object-oriented network protocols.IEEE INFOCOM,1997,Vol.3:1245-1252
[9]Burkhard S.Configuration of Protocols in TIP.University of Cambridge Computer Laboratory's Technical Report,1995,368-373
[10]Braden B,Faber T,Handley M.From Protocol Stack to Protocol Heap - Role-Based Architecture.Computer Communication Review:2003,33(1):17- 22
[11]Peterson L,Anderson T,Blumenthal D,et al.GENI design principles.Computer,2006,39(9):102-105
[12]雷震洲.GENI的启示.电信工程技术与标准化,2006,7:1-4
[13]Goth G.Will GENI be a magic lamp or a dim bulb? IEEE Internet Computing,2005,9(6):7-9
[14]曾家智,徐洁,吴跃,等.服务元网络体系结构及其微通信元架构.电子学报,2004,32(5):42-46
[15]Zeng Jiazhi.Service unit based architecture.Parallel and Distributed Computing,Applications and Technologies,2003,12-16
[16]Peng Zheng,Zeng Jiazhi,Zhang Ming,et al.Micro-communication Element System.Parallel and Distributed Computing,Applications and Technologies,2004,424-428
[17]Carpenter B.Architectural Principles of the Internet.IETF RFC 1958,June 1996
[18]Mazzei J A.Network architecture puzzle.IEEE Military Communications Conference,1997,Vol.3:1528-1531
[19]李国庆,安建平,杨杰.深入理解网络体系结构.计算机工程,2004,30(21):1-2
[20]Komolafe O,Sventek J.RSVP performance evaluation using multi-objective evolutionary optimization.IEEE INFOCOM,2005,Vol.4:2447-2457
[21]Perkins C,Gharai L.RTP and the datagram congestion control protocol.2006 IEEE International Conference on Multimedia and Expo,2006,1521-1524
[22]Huitema C.Real Time Control Protocol(RTCP) attribute in Session Description Protocol (SDP).IETF RFC3605,October 2003
[23]Nichols K,Jacobson V,Zhang L,et al.ATwo bit Differentiated Services Architecture for the Internet.IETF RFC2638,July 1999
[24]Carlson M,Weiss W,Blake S,et al.An Architecture for Differentiated Services.IETF Internet RFC2475,December 1998
[25]Rosen E,Viswanathan A,Callon R.Multiprotocol Label Switching Architecture.IETF RFC3031,January 2001
[26]Plummer DC.Ethernet Address Resolution Protocol.IETF RFC826,November 1982
[27]Finlayson R,Mann T,Mogul J C,et al.Reverse Address Resolution Protocol.IETF RFC903,June 1984
[28]Daniel Decaper.A scable,high performance active network node.IEEE Network,1999,1:2-20
[29]Merugu S,Bhattacharjee S,Zegura E,et al.A Node OS for active networks.Infocom IEEE,2000,Vol.3:1127-1136
[30]DAVID J,WETHERALL D J.Service introduction in an active network.Massachusetts Institute of Technology,1999,15(2):66-68
[31]MERUGU S,BHATTACHARJEE S,CHUE Y,et al.Bowman and CANES:implementation of an active network.Proceedings of the 37th Annual Allerton Conference,1999
[32]Tschudin C,Lundgren H,Gulbrandsen H.Active routing for active networks.IEEE Communication Magazine,2000,38(4):122-127
[33]D Scott Alexander,William A.Arbaugh Michael W,et al.The switch ware active network architecture.IEEE Network,Special Issue on Active and Controllable Networks,1998,12(3):29-36
[34]Lehman L H,Garland S J,Tennenhouse D L.Active reliable multicast.Proceedings of the Conference on Computer Communications(IEEE Infocom),San Francisco,1998,Vol.2:581-589
[35]Morrison G.QoS for applications.BT Technology Journal,2005,23(2):28-36
[36]Xiao Dan,Li Harry,Wang Wendong.QoS Management Network.2003 International Conference on Communication Technology Proceedings(ICCT2003),2003,Vol.1:320-323
[37]Giordano S,Potts M,Smirnov M,et al.Advances in QoS.IEEE Communications Magazine,2003,41(1):28-29
[38]Seitz N B,Wortendyke D R,Spies K P.User-Oriented performance measurements on the ARPANET.IEEE Communication Magazine,1983,1(5):28-44
[39]Henshall J,Shaw S.OSI Explained:End-to-End Computer Communication Standards.Ellis Horwood,1988,10-28
[40]Anderson D P,Herrtwich R G,Schaefer C.SRP:A resource reservation protocol for guaranteed performance communication in the Internet.Internet Report,University of California at Berkeley,1991
[41]Yoshikai N.B-ISDN.NTT Review,1994,6(5):57-59
[42]Campbell A,Coulson G,Garc A F,et al.Integrated quality of service for multimedia communications.IEEE INFOCOM'93.San Francisco,USA,April 1993,732-739
[43]Lazar A A.Challenges in multimedia networking.International Hi-Tech Forum,Osaka,Japan.February 1994,1-10
[44]Nilsson G,Dupuy E Chapman M.Overview of the telecommunications information networking architecture.Electronics & Communication Engineering Journal,1996,8(3):135-141
[45]Ferrari D.The tenet experience and the design of protocols for integrated services internetworks.Multiedia systems Journal,1998,6(3):179-185
[46]Volg C,Wolf L,Herrtwich R,et al.HeiRAT-Quality of service management for distributed multimedia systems.Multimedia Systems Journal,1998,6(3):152-166
[47]Braden R,Clark D,and Shenker S.Integrated services in the Internet architecture:an overview.IETF RFC1633,June 1994
[48]Awduche D,Chiu A,Elwalid A,et al.Overview and Principles of Internet Traffic Engineering.IETF RFC3272,May 2002
[49]林闯,单志广,任丰原.计算机网络的服务质量(QoS).北京:清华大学出版社,2004,3-13
[50]林闯.多媒体信息网络QoS的控制。软件学报,1999,10(10):1016-1024
[51]Crawley E,Nair R,Rajagopalan B,et al.A framework for QoS-based routing in the Internet.IETF RFC2386,August 1998
[52]Yavatkar R,Pendarakis D,Guerin R.A Framework for Policy-based Admission Control.IETF RFC2753,January 2000
[53]Bichler M,Setzer T.Admission control for media on demand services.Service Oriented Computing and Applications,2007,1(1):65-73
[54]Partridge C.A proposed flow specification.IETF RFC1363,September 1992
[55]Little T D C,Ghafoor A.Synchronization properties and storage models for multimedia objects.IEEE Journal of Selected Areas on Communications,1990,8(3):229-238
[56]Wroclawski J.Specification of the controlled -load network element service.IETF RFC2211,September 1997
[57]Shenker S,Partridge C,Guerin R.Specification of guaranteed quality of service.IETF RFC2212,September 1997
[58]Campbell A,Coulson G,Hutchison D.Supporting adaptive flows in a quality of service architecture.Multimedia Systems Journal,November 1995
[59]Bae J J,Suda T.Survey of traffic control schemes and protocols in ATM networks.Proceedings of the IEEE,1991,Vol.2:170-189
[60]Tobagi F A.Fast Packet Switch Architectures for Broad-Band Integrated Services Digital Network,Proc.IEEE,1990,78(1):133-167
[61]林闯,杨士强.ATM网络传输实时调度的最少缓沖优先方案和性能评价.计算机学报,1999,22(11):1189-1195
[62]Shenker S,Wroclawski J.General characterization parameters for integrated service network elements.IETF RFC2215,September 1997
[63]Shenker S,Wroclawski J.Network element service specification template.IETF RFC2216,September 1997
[64]Braden R,Zhang L,Berson S,et al.Resource ReSerVation Protocol(RSVP)-Version 1,Function Specification,IETF RFC2205,September 1997
[65]Borgonovo F,Fratta L,and Petrioli C.End-to-end QoS provisioning mechanism for Differentiated Services,IETF Internet Draft,29 July 1998
[66]Crawley E,Nair R,Rajagopalan Bet al.A framework for QoS-based routing in the Internet.IETF RFC2386,August 1998
[67] Cidon I, Rom R. Multi-path routing combined with resource reservation, IEEE INFOCOM'97, Kobe, Japan, April 1997, 92-100
[68] Orda A. Routing with end to end QoS Guarantees in Broadband Networks. IEEE INFOCOM'98, San Francisco, California, March 1998, 27-34
[69] Lorenz D H, Orda A. QoS routing in networks with uncertain parameters, IEEE INFOCOM'98, March 1998, San Francisco, California, 3-10
[70] Melody W M, Nguyen B. An Optimal QoS Guaranteed Multicast Routing Algorithm with Dynamic Membership Support. Proc of the IEEE International Conference on Communications, Vancouver, Canada, June 1999, 727-732
[71] Ye Ge, Jennifer C, Tyan H. A Packet Eligible Time Calculation Mechanism for Providing Temporal QoS for Multimedia Routing. Proc of the IEEE International Conference on Communications, Vancouver, Canada, June 1999, 721-726
[72] YuJin Lim, JongWon Choe. A Layered QoS Multicast Protocol. Proc of the IEEE International Conference on Communications, Vancouver, Canada, June 1999, 687-691
[73] Apostolopoulos G, Guerin R, Kamat S. Implementation and performance measurements of QoS routing extensions to OSPF. IEEE INFOCOM'99, New York City, March 1999,680-688
[74] Apostolopoulos G, Guerin R, Kamat S, et al. QoS Routing Mechanisms and OSPF Extensions, IETF RFC2676, December 1998
[75] Lin Chuang and Lam E C M. Dynamic queue length thresholds for scheduling realtime traffic in ATM networks. Proceedings of 1999 International Conference on Communications, IEEE Computer Society, Vancouver, BC Canada, June 6-10, 1999, 869-874
[76] Golestani S J. A self clocked fair queueing scheme for broadband applications. IEEE INFOCOM'94, Toronto, Canada, June 1994, 636 -646
[77] Zhang L. Virtual clock: a new traffic control algorithm for packet switching. ACM Trans. Comp. Syst., 1991, Vol.4: 101-124
[78] Bennett J C R, Zhang H. WF2Q: worstcase fair weighted fair queueing. IEEE INFOCOM'96, San Francisco, California, USA, March 1996, 120-128
[79] Chiussi F M, Francini A. Implementing fair queueing in ATM switches: the discreterate approach. IEEE INFOCOM'98, San Francisco, California, March 1998, 272-281
[80] Clark D D, Wenjia Fang. Explicit Allocation of Best-Effort Packet Delivery Service. IEEE/ACM Trans. on Networking, 1998, 6(4): 362-373
[81] Nichols K, Blake S, Baker F, et al. Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers.IETF Internet RFC 2474,December 1998
[82]Grossman D.New Terminology for Diffserv.IETF Internet Draft,October 1999
[83]Awduche D,Malcolm J,Agogbua J,etal.Requirements for Traffic Engineering Over MPLS.IETF RFC2702,1999
[84]Muthukrishnan K,Technologies L,Malis A.A Core MPLS IP VPN Architecture.IETF RFC2917,2000
[85]Muthukrishnan K,Malis A.A Core MPLS IP VPN Architecture.IETF RFC2917,September 2000
[86]Raj Jain,Wei Sun.QoS/Policy/Constraint based routing.Carrier IP Telephony 2000Comprehensive Report published by International Engineering Consortium,2000
[87]Lim S H,Yaacob M H,Phang K K,et al.Traffic engineering enhancement to QoS-OSPF in DiffServ and MPLS networks,lEE Proceedings:Communications,2004,151(1):101-106
[88]Tanenbaum A s.Computer Networks(熊喜桂,王小虎译).北京:清华大学出版社,1999,139-142
[89]Galles M.Spider:A High-speed Network Interconnect.IEEE Micro,1997,17(1):34-39
[90]Van Jacobson.Congestion avoidance and control.ACM Computer Communication Review,1988,18(4):314-329
[91]Stevens W.TCP slow start,congestion avoidance,fast retransmit,and fast recovery algorithms,RFC2001,1997
[92]Floyd S,Henderson T.The NewReno Modification to TCP's Fast Recovery Algorithm.IETF RFC2582,April 1999
[93]Miyake M,Inamura H.Enhancing fast recovery algorithm using loss recovery for NewReno TCP.2005 IEEE 16th International Symposium on Personal,Indoor and Mobile Radio Communications,2005,Vol.3:1555-1559
[94]Mathis M,Mahdavi J,Floyd S,et al.TCP selective acknowledgement options.RFC2018,1996
[95]Kim B,Kim D,Lee J.Lost retransmission detection for TCP SACK.IEEE Communications Letters,2004,8(9):600-602
[96]Brakmo L S,Peterson L L.TCP vegas:End-to-end congestion avoidance on a global Internet.IEEE Journal on Selected Areas in Communications,1995,13(8):1465 - 1480
[97]Kim K,Choi C H.Queue delay estimation and its application to TCP Vegas.Computer Networks,2003,43(3):619-631
[98]Byun H J,Lim J T.On a Fair Congestion Control Scheme for TCP Vegas.IEEE COMMUNICATIONS LETTERS,2005,9(2):190-192
[99]Chan Y C,Chan C T,Chen Y C.RoVegas:a router-based congestion avoidance mechanism for TCP Vegas.Computer Communications,2004,27(6):1624-1636
[100]Jensen K.,Coloured Petri Nets:Basic Concepts,Analysis Methods and Practical Use,Volume 1-Basic Concepts.Springer-Verlag,1992
[101]Jensen K.,Coloured Petri Nets:Basic Concepts,Analysis Methods and Practical Use,Volume2-Analysis Methods.Springer-Verlag,1995
[102]Petri C A.State transition structures in physics and in computation.International Journal of Theoretical Physics.1982,21(12):979-992
[103]袁崇义.PETRI网原理与应用,北京:电子工业出版社,2005
[104]Jensen K,Kristensen L M,Wells L.Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems.International Journal on Software Tools for Technology Transfer,2007,9(3):213-254
[105]Machado R J,Lassen K B,Oliveira S,et al.Requirements validation:Execution of UML models with CPN tools.International Journal on Software Tools for Technology Transfer,2007,9(3):353-369
[106]Jiang Zhibin,Zuo,Ming J;Fung Richard Y K,et al.Temporized coloured Petri nets with changeable structure(CPN-CS) for performance modelling of dynamic production systems.International Journal of Production Research,2000,38(8):1917-1945
[107]Shaowen Yao,Jonathan Billington,Mingtian Zhou.CPN Modeling of the WebMUX Protocol,Chinese Journal of Electronics,2000,9(4):437-441
[108]Combettes S,Hanachi C,Christophe S B.Organizational petri nets for protocol design and enactment.Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems,2006,1384-1386
[109]University of Aarhus CPN Group,CPN Tools Online:http://www.daimi.au.dk/CPNTools
[110]吴彦文,郑大力,仲肇伟.光网络的生存性技术.北京:北京邮电大学出版社,2002,1-30
[111]Changcheng Huang,Sharma V,Owens K,et al.Building reliable MPLS networks using a path protection mechanism.IEEE Communications Magazine,2002,40(3):156-162
[112]Agrawal G,Dijiang Huang,Medhi D.Network protection design for MPLS networks.5th International Workshop on Design of Reliable Communication Networks,2005,Vol.5:481-486
[113] Yinghua Ye, Assi C, Dixit S, Ali M A. A simple dynamic integrated provisioning/ protection scheme in IP over WDM networks. IEEE Communications Magazine, 2001, 39(11): 174-182
[114] Rao L, Praveen V, Ayan B, et al. Performance of path protection in IP/optical core mesh networks with source-routed GMPLS protocols. Conference on Optical Fiber Communication, Technical Digest Series, 2002, Vol.70: 430-431
[115] Griffith D, Lee S. A 1+1 protection architecture for optical burst switched networks. IEEE Journal on Selected Areas in Communications, 2003, 21(9): 1384 - 1398
[116] Lee S, Griffith D, Song N O. A New Analytical Model of Shared Backup Path Provisioning in gmpls Networks. Photonic Network Communications, 2002, 4(3): 271-283
[117] Clinker T, Mesko D, Viola G, Tapolcai J. Routing with partially disjoint shared path (PDSP) protection. Next Generation Internet Networks, 2005,47-52
[118] Li Guangzhi, Wang Dongmei, Kalmanek C, Doverspike R. Efficient distributed restoration path selection for shared mesh restoration. IEEE/ACM Transactions on Networking, 2003, 11(5): 761-771
[119] Urra A, Calle E, Marzo J L. Enhanced protection using shared segment backups in a multiservice GMPLS-based networks. 10th IEEE Symposium on Computers and Communications, 2005, Vol.10: 752-757
[120] Lee W S, Kim K, Cho P D, et al. Backup path provisioning scheme and delay time analysis in GMPLS networks. ICCS2002, 2002, 1227-1231
[121] Qing Huang, Gengsheng Kuo. Novel disjoint-LSP selection scheme with SRLG in GMPLS- based networks. IEEE Workshop on IP Operations and Management Proceedings, 2004, 160-164
[122] Lu Shen, Xi Yang, Ramamurthy B. Shared Risk Link Group (SRLG)-Diverse Path Provisioning Under Hybrid Service Level Agreements in Wavelength-Routed Optical Mesh Networks. IEEE/ACM Transactions on Networking, 2005, 13(4): 918-931
[123] Rostami M J, Khorsandi S, Khodaparast A A. CoSE: A SRLG-Disjoint Routing Algorithm. Fourth European Conference on Universal Multiservice Networks, 2007, Vol.4: 86-92
[124] Todimala A, Ramamurthy B. Survivable virtual topology routing under shared risk link groups in WDM networks. First International Conference on Broadband Networks, 2004, Vol.1: 130-139
[125] Todimala A, Ramamurthy B. IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks. 13th International Conference on Computer Communications and Networks, 2004, 199-204
[126] Fumagalli A, Tacca M. Differentiated reliability (DiR) in wavelength division multiplexing rings. IEEE/ACM Transactions on Networking, 2006, 14(1): 159-168
[127] Peng Ma, Luying Zhou, Mohan G. Dynamic routing of reliability-differentiated connections in WDM optical networks. The 30th IEEE Conference on Local Computer Networks, 2005, Vol.30: 190-197
[128] Kai Wu, Valcarenghi L, Fumagalli A. Restoration schemes with differentiated reliability. IEEE International Conference on Communications (ICC '03), 2003, Vol.3: 1968-1972
[129] Tacca M, Fumagalli A, Paradisi A, et al. Differentiated reliability in optical networks: theoretical and practical results. Journal of Lightwave Technology, 2003, 21(11): 2576 - 2586
[130] Fumagalli A, Tacca M, Unghvary F, et al. Shared path protection with differentiated reliability. IEEE International Conference on Communications, 2002, 2157-2161
[131] Otel, F D. On fast computing bypass tunnel routes in MPLS-based local restoration. 5th IEEE International Conference on High Speed Networks and Multimedia Communications, 2002, Vol.5: 234-238
[132] Nagarajan R, Ekici E. Flexible MPLS signaling (FMS) for mobile networks. IEEE International Conference on Communication, 2004, Vol.7: 4321-4325
[133] Sa-Ngiamsak W, Krachodnok P, Varakulsiripunth R. A Recovery Scheme for QoS Guaranteed Mobile DP Over MPLS Network. 1st International Symposium on Wireless Pervasive Computing, 2006, Vol.1: 1-5
[134] Park J T. Resilience in GMPLS path management: model and mechanism. IEEE Communications Magazine, 2004, 42(7): 128 - 135
[135] Luca V, Andrea F, Ramkumar G, et al. Preplanned weighted restoration in highly dynamic GMPLS networks. Conference on Optical Fiber Communication, Technical Digest Series, 2002, Vol.70: 428-430
[136] Ahn G, Chun W. Simulator for MPLS path restoration and performance evaluation. Joint 4th IEEE International Conference on ATM and High Speed Intelligent Internet Symposium, 2001, 32-36
[137] Tornatore M, Canhui Ou, Jing Zhang, Pattavina A, Mukherjee B. PHOTO: an efficient shared-path-protection strategy based on connection-holding-time awareness. Journal of Lightwave Technology, 2005, 23(10): 3138 - 3146
[138] Kodialam M, Lakshman T V. Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information. IEEE/ACM Transactions on Networking, 2003, 11(3): 399-410
[2]Tennenhouse D L,Wetherall D J.Towards an Active Network Architecture.Computer Communication Review,1996,26(2):5-18
[3]Tennenhouse D L,Smith J M,Sincoskie D W,et al.Survey of active network research.IEEE Communication Magazine,1997,35(1):80-86
[4]Van der,Merwe J E,et al.The Tempest-a practical framework for network programmability.IEEE Network,1998(5):20-28
[5]Michael Fry,Atanu Ghosh.Application Level Active Networking.Computer Networks,1999,31(7):655-667
[6]Boecking s.面向对象的网络协议(陈葆钰译).北京:机械工业出版社,2000,77-126
[7]Boecking S.Performance and software evaluation of the modular TIP communication system.IEEE Global Telecommunications Conference,1996,Vol.1:73-77
[8]Boecking S.Object-oriented network protocols.IEEE INFOCOM,1997,Vol.3:1245-1252
[9]Burkhard S.Configuration of Protocols in TIP.University of Cambridge Computer Laboratory's Technical Report,1995,368-373
[10]Braden B,Faber T,Handley M.From Protocol Stack to Protocol Heap - Role-Based Architecture.Computer Communication Review:2003,33(1):17- 22
[11]Peterson L,Anderson T,Blumenthal D,et al.GENI design principles.Computer,2006,39(9):102-105
[12]雷震洲.GENI的启示.电信工程技术与标准化,2006,7:1-4
[13]Goth G.Will GENI be a magic lamp or a dim bulb? IEEE Internet Computing,2005,9(6):7-9
[14]曾家智,徐洁,吴跃,等.服务元网络体系结构及其微通信元架构.电子学报,2004,32(5):42-46
[15]Zeng Jiazhi.Service unit based architecture.Parallel and Distributed Computing,Applications and Technologies,2003,12-16
[16]Peng Zheng,Zeng Jiazhi,Zhang Ming,et al.Micro-communication Element System.Parallel and Distributed Computing,Applications and Technologies,2004,424-428
[17]Carpenter B.Architectural Principles of the Internet.IETF RFC 1958,June 1996
[18]Mazzei J A.Network architecture puzzle.IEEE Military Communications Conference,1997,Vol.3:1528-1531
[19]李国庆,安建平,杨杰.深入理解网络体系结构.计算机工程,2004,30(21):1-2
[20]Komolafe O,Sventek J.RSVP performance evaluation using multi-objective evolutionary optimization.IEEE INFOCOM,2005,Vol.4:2447-2457
[21]Perkins C,Gharai L.RTP and the datagram congestion control protocol.2006 IEEE International Conference on Multimedia and Expo,2006,1521-1524
[22]Huitema C.Real Time Control Protocol(RTCP) attribute in Session Description Protocol (SDP).IETF RFC3605,October 2003
[23]Nichols K,Jacobson V,Zhang L,et al.ATwo bit Differentiated Services Architecture for the Internet.IETF RFC2638,July 1999
[24]Carlson M,Weiss W,Blake S,et al.An Architecture for Differentiated Services.IETF Internet RFC2475,December 1998
[25]Rosen E,Viswanathan A,Callon R.Multiprotocol Label Switching Architecture.IETF RFC3031,January 2001
[26]Plummer DC.Ethernet Address Resolution Protocol.IETF RFC826,November 1982
[27]Finlayson R,Mann T,Mogul J C,et al.Reverse Address Resolution Protocol.IETF RFC903,June 1984
[28]Daniel Decaper.A scable,high performance active network node.IEEE Network,1999,1:2-20
[29]Merugu S,Bhattacharjee S,Zegura E,et al.A Node OS for active networks.Infocom IEEE,2000,Vol.3:1127-1136
[30]DAVID J,WETHERALL D J.Service introduction in an active network.Massachusetts Institute of Technology,1999,15(2):66-68
[31]MERUGU S,BHATTACHARJEE S,CHUE Y,et al.Bowman and CANES:implementation of an active network.Proceedings of the 37th Annual Allerton Conference,1999
[32]Tschudin C,Lundgren H,Gulbrandsen H.Active routing for active networks.IEEE Communication Magazine,2000,38(4):122-127
[33]D Scott Alexander,William A.Arbaugh Michael W,et al.The switch ware active network architecture.IEEE Network,Special Issue on Active and Controllable Networks,1998,12(3):29-36
[34]Lehman L H,Garland S J,Tennenhouse D L.Active reliable multicast.Proceedings of the Conference on Computer Communications(IEEE Infocom),San Francisco,1998,Vol.2:581-589
[35]Morrison G.QoS for applications.BT Technology Journal,2005,23(2):28-36
[36]Xiao Dan,Li Harry,Wang Wendong.QoS Management Network.2003 International Conference on Communication Technology Proceedings(ICCT2003),2003,Vol.1:320-323
[37]Giordano S,Potts M,Smirnov M,et al.Advances in QoS.IEEE Communications Magazine,2003,41(1):28-29
[38]Seitz N B,Wortendyke D R,Spies K P.User-Oriented performance measurements on the ARPANET.IEEE Communication Magazine,1983,1(5):28-44
[39]Henshall J,Shaw S.OSI Explained:End-to-End Computer Communication Standards.Ellis Horwood,1988,10-28
[40]Anderson D P,Herrtwich R G,Schaefer C.SRP:A resource reservation protocol for guaranteed performance communication in the Internet.Internet Report,University of California at Berkeley,1991
[41]Yoshikai N.B-ISDN.NTT Review,1994,6(5):57-59
[42]Campbell A,Coulson G,Garc A F,et al.Integrated quality of service for multimedia communications.IEEE INFOCOM'93.San Francisco,USA,April 1993,732-739
[43]Lazar A A.Challenges in multimedia networking.International Hi-Tech Forum,Osaka,Japan.February 1994,1-10
[44]Nilsson G,Dupuy E Chapman M.Overview of the telecommunications information networking architecture.Electronics & Communication Engineering Journal,1996,8(3):135-141
[45]Ferrari D.The tenet experience and the design of protocols for integrated services internetworks.Multiedia systems Journal,1998,6(3):179-185
[46]Volg C,Wolf L,Herrtwich R,et al.HeiRAT-Quality of service management for distributed multimedia systems.Multimedia Systems Journal,1998,6(3):152-166
[47]Braden R,Clark D,and Shenker S.Integrated services in the Internet architecture:an overview.IETF RFC1633,June 1994
[48]Awduche D,Chiu A,Elwalid A,et al.Overview and Principles of Internet Traffic Engineering.IETF RFC3272,May 2002
[49]林闯,单志广,任丰原.计算机网络的服务质量(QoS).北京:清华大学出版社,2004,3-13
[50]林闯.多媒体信息网络QoS的控制。软件学报,1999,10(10):1016-1024
[51]Crawley E,Nair R,Rajagopalan B,et al.A framework for QoS-based routing in the Internet.IETF RFC2386,August 1998
[52]Yavatkar R,Pendarakis D,Guerin R.A Framework for Policy-based Admission Control.IETF RFC2753,January 2000
[53]Bichler M,Setzer T.Admission control for media on demand services.Service Oriented Computing and Applications,2007,1(1):65-73
[54]Partridge C.A proposed flow specification.IETF RFC1363,September 1992
[55]Little T D C,Ghafoor A.Synchronization properties and storage models for multimedia objects.IEEE Journal of Selected Areas on Communications,1990,8(3):229-238
[56]Wroclawski J.Specification of the controlled -load network element service.IETF RFC2211,September 1997
[57]Shenker S,Partridge C,Guerin R.Specification of guaranteed quality of service.IETF RFC2212,September 1997
[58]Campbell A,Coulson G,Hutchison D.Supporting adaptive flows in a quality of service architecture.Multimedia Systems Journal,November 1995
[59]Bae J J,Suda T.Survey of traffic control schemes and protocols in ATM networks.Proceedings of the IEEE,1991,Vol.2:170-189
[60]Tobagi F A.Fast Packet Switch Architectures for Broad-Band Integrated Services Digital Network,Proc.IEEE,1990,78(1):133-167
[61]林闯,杨士强.ATM网络传输实时调度的最少缓沖优先方案和性能评价.计算机学报,1999,22(11):1189-1195
[62]Shenker S,Wroclawski J.General characterization parameters for integrated service network elements.IETF RFC2215,September 1997
[63]Shenker S,Wroclawski J.Network element service specification template.IETF RFC2216,September 1997
[64]Braden R,Zhang L,Berson S,et al.Resource ReSerVation Protocol(RSVP)-Version 1,Function Specification,IETF RFC2205,September 1997
[65]Borgonovo F,Fratta L,and Petrioli C.End-to-end QoS provisioning mechanism for Differentiated Services,IETF Internet Draft,29 July 1998
[66]Crawley E,Nair R,Rajagopalan Bet al.A framework for QoS-based routing in the Internet.IETF RFC2386,August 1998
[67] Cidon I, Rom R. Multi-path routing combined with resource reservation, IEEE INFOCOM'97, Kobe, Japan, April 1997, 92-100
[68] Orda A. Routing with end to end QoS Guarantees in Broadband Networks. IEEE INFOCOM'98, San Francisco, California, March 1998, 27-34
[69] Lorenz D H, Orda A. QoS routing in networks with uncertain parameters, IEEE INFOCOM'98, March 1998, San Francisco, California, 3-10
[70] Melody W M, Nguyen B. An Optimal QoS Guaranteed Multicast Routing Algorithm with Dynamic Membership Support. Proc of the IEEE International Conference on Communications, Vancouver, Canada, June 1999, 727-732
[71] Ye Ge, Jennifer C, Tyan H. A Packet Eligible Time Calculation Mechanism for Providing Temporal QoS for Multimedia Routing. Proc of the IEEE International Conference on Communications, Vancouver, Canada, June 1999, 721-726
[72] YuJin Lim, JongWon Choe. A Layered QoS Multicast Protocol. Proc of the IEEE International Conference on Communications, Vancouver, Canada, June 1999, 687-691
[73] Apostolopoulos G, Guerin R, Kamat S. Implementation and performance measurements of QoS routing extensions to OSPF. IEEE INFOCOM'99, New York City, March 1999,680-688
[74] Apostolopoulos G, Guerin R, Kamat S, et al. QoS Routing Mechanisms and OSPF Extensions, IETF RFC2676, December 1998
[75] Lin Chuang and Lam E C M. Dynamic queue length thresholds for scheduling realtime traffic in ATM networks. Proceedings of 1999 International Conference on Communications, IEEE Computer Society, Vancouver, BC Canada, June 6-10, 1999, 869-874
[76] Golestani S J. A self clocked fair queueing scheme for broadband applications. IEEE INFOCOM'94, Toronto, Canada, June 1994, 636 -646
[77] Zhang L. Virtual clock: a new traffic control algorithm for packet switching. ACM Trans. Comp. Syst., 1991, Vol.4: 101-124
[78] Bennett J C R, Zhang H. WF2Q: worstcase fair weighted fair queueing. IEEE INFOCOM'96, San Francisco, California, USA, March 1996, 120-128
[79] Chiussi F M, Francini A. Implementing fair queueing in ATM switches: the discreterate approach. IEEE INFOCOM'98, San Francisco, California, March 1998, 272-281
[80] Clark D D, Wenjia Fang. Explicit Allocation of Best-Effort Packet Delivery Service. IEEE/ACM Trans. on Networking, 1998, 6(4): 362-373
[81] Nichols K, Blake S, Baker F, et al. Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers.IETF Internet RFC 2474,December 1998
[82]Grossman D.New Terminology for Diffserv.IETF Internet Draft,October 1999
[83]Awduche D,Malcolm J,Agogbua J,etal.Requirements for Traffic Engineering Over MPLS.IETF RFC2702,1999
[84]Muthukrishnan K,Technologies L,Malis A.A Core MPLS IP VPN Architecture.IETF RFC2917,2000
[85]Muthukrishnan K,Malis A.A Core MPLS IP VPN Architecture.IETF RFC2917,September 2000
[86]Raj Jain,Wei Sun.QoS/Policy/Constraint based routing.Carrier IP Telephony 2000Comprehensive Report published by International Engineering Consortium,2000
[87]Lim S H,Yaacob M H,Phang K K,et al.Traffic engineering enhancement to QoS-OSPF in DiffServ and MPLS networks,lEE Proceedings:Communications,2004,151(1):101-106
[88]Tanenbaum A s.Computer Networks(熊喜桂,王小虎译).北京:清华大学出版社,1999,139-142
[89]Galles M.Spider:A High-speed Network Interconnect.IEEE Micro,1997,17(1):34-39
[90]Van Jacobson.Congestion avoidance and control.ACM Computer Communication Review,1988,18(4):314-329
[91]Stevens W.TCP slow start,congestion avoidance,fast retransmit,and fast recovery algorithms,RFC2001,1997
[92]Floyd S,Henderson T.The NewReno Modification to TCP's Fast Recovery Algorithm.IETF RFC2582,April 1999
[93]Miyake M,Inamura H.Enhancing fast recovery algorithm using loss recovery for NewReno TCP.2005 IEEE 16th International Symposium on Personal,Indoor and Mobile Radio Communications,2005,Vol.3:1555-1559
[94]Mathis M,Mahdavi J,Floyd S,et al.TCP selective acknowledgement options.RFC2018,1996
[95]Kim B,Kim D,Lee J.Lost retransmission detection for TCP SACK.IEEE Communications Letters,2004,8(9):600-602
[96]Brakmo L S,Peterson L L.TCP vegas:End-to-end congestion avoidance on a global Internet.IEEE Journal on Selected Areas in Communications,1995,13(8):1465 - 1480
[97]Kim K,Choi C H.Queue delay estimation and its application to TCP Vegas.Computer Networks,2003,43(3):619-631
[98]Byun H J,Lim J T.On a Fair Congestion Control Scheme for TCP Vegas.IEEE COMMUNICATIONS LETTERS,2005,9(2):190-192
[99]Chan Y C,Chan C T,Chen Y C.RoVegas:a router-based congestion avoidance mechanism for TCP Vegas.Computer Communications,2004,27(6):1624-1636
[100]Jensen K.,Coloured Petri Nets:Basic Concepts,Analysis Methods and Practical Use,Volume 1-Basic Concepts.Springer-Verlag,1992
[101]Jensen K.,Coloured Petri Nets:Basic Concepts,Analysis Methods and Practical Use,Volume2-Analysis Methods.Springer-Verlag,1995
[102]Petri C A.State transition structures in physics and in computation.International Journal of Theoretical Physics.1982,21(12):979-992
[103]袁崇义.PETRI网原理与应用,北京:电子工业出版社,2005
[104]Jensen K,Kristensen L M,Wells L.Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems.International Journal on Software Tools for Technology Transfer,2007,9(3):213-254
[105]Machado R J,Lassen K B,Oliveira S,et al.Requirements validation:Execution of UML models with CPN tools.International Journal on Software Tools for Technology Transfer,2007,9(3):353-369
[106]Jiang Zhibin,Zuo,Ming J;Fung Richard Y K,et al.Temporized coloured Petri nets with changeable structure(CPN-CS) for performance modelling of dynamic production systems.International Journal of Production Research,2000,38(8):1917-1945
[107]Shaowen Yao,Jonathan Billington,Mingtian Zhou.CPN Modeling of the WebMUX Protocol,Chinese Journal of Electronics,2000,9(4):437-441
[108]Combettes S,Hanachi C,Christophe S B.Organizational petri nets for protocol design and enactment.Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems,2006,1384-1386
[109]University of Aarhus CPN Group,CPN Tools Online:http://www.daimi.au.dk/CPNTools
[110]吴彦文,郑大力,仲肇伟.光网络的生存性技术.北京:北京邮电大学出版社,2002,1-30
[111]Changcheng Huang,Sharma V,Owens K,et al.Building reliable MPLS networks using a path protection mechanism.IEEE Communications Magazine,2002,40(3):156-162
[112]Agrawal G,Dijiang Huang,Medhi D.Network protection design for MPLS networks.5th International Workshop on Design of Reliable Communication Networks,2005,Vol.5:481-486
[113] Yinghua Ye, Assi C, Dixit S, Ali M A. A simple dynamic integrated provisioning/ protection scheme in IP over WDM networks. IEEE Communications Magazine, 2001, 39(11): 174-182
[114] Rao L, Praveen V, Ayan B, et al. Performance of path protection in IP/optical core mesh networks with source-routed GMPLS protocols. Conference on Optical Fiber Communication, Technical Digest Series, 2002, Vol.70: 430-431
[115] Griffith D, Lee S. A 1+1 protection architecture for optical burst switched networks. IEEE Journal on Selected Areas in Communications, 2003, 21(9): 1384 - 1398
[116] Lee S, Griffith D, Song N O. A New Analytical Model of Shared Backup Path Provisioning in gmpls Networks. Photonic Network Communications, 2002, 4(3): 271-283
[117] Clinker T, Mesko D, Viola G, Tapolcai J. Routing with partially disjoint shared path (PDSP) protection. Next Generation Internet Networks, 2005,47-52
[118] Li Guangzhi, Wang Dongmei, Kalmanek C, Doverspike R. Efficient distributed restoration path selection for shared mesh restoration. IEEE/ACM Transactions on Networking, 2003, 11(5): 761-771
[119] Urra A, Calle E, Marzo J L. Enhanced protection using shared segment backups in a multiservice GMPLS-based networks. 10th IEEE Symposium on Computers and Communications, 2005, Vol.10: 752-757
[120] Lee W S, Kim K, Cho P D, et al. Backup path provisioning scheme and delay time analysis in GMPLS networks. ICCS2002, 2002, 1227-1231
[121] Qing Huang, Gengsheng Kuo. Novel disjoint-LSP selection scheme with SRLG in GMPLS- based networks. IEEE Workshop on IP Operations and Management Proceedings, 2004, 160-164
[122] Lu Shen, Xi Yang, Ramamurthy B. Shared Risk Link Group (SRLG)-Diverse Path Provisioning Under Hybrid Service Level Agreements in Wavelength-Routed Optical Mesh Networks. IEEE/ACM Transactions on Networking, 2005, 13(4): 918-931
[123] Rostami M J, Khorsandi S, Khodaparast A A. CoSE: A SRLG-Disjoint Routing Algorithm. Fourth European Conference on Universal Multiservice Networks, 2007, Vol.4: 86-92
[124] Todimala A, Ramamurthy B. Survivable virtual topology routing under shared risk link groups in WDM networks. First International Conference on Broadband Networks, 2004, Vol.1: 130-139
[125] Todimala A, Ramamurthy B. IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks. 13th International Conference on Computer Communications and Networks, 2004, 199-204
[126] Fumagalli A, Tacca M. Differentiated reliability (DiR) in wavelength division multiplexing rings. IEEE/ACM Transactions on Networking, 2006, 14(1): 159-168
[127] Peng Ma, Luying Zhou, Mohan G. Dynamic routing of reliability-differentiated connections in WDM optical networks. The 30th IEEE Conference on Local Computer Networks, 2005, Vol.30: 190-197
[128] Kai Wu, Valcarenghi L, Fumagalli A. Restoration schemes with differentiated reliability. IEEE International Conference on Communications (ICC '03), 2003, Vol.3: 1968-1972
[129] Tacca M, Fumagalli A, Paradisi A, et al. Differentiated reliability in optical networks: theoretical and practical results. Journal of Lightwave Technology, 2003, 21(11): 2576 - 2586
[130] Fumagalli A, Tacca M, Unghvary F, et al. Shared path protection with differentiated reliability. IEEE International Conference on Communications, 2002, 2157-2161
[131] Otel, F D. On fast computing bypass tunnel routes in MPLS-based local restoration. 5th IEEE International Conference on High Speed Networks and Multimedia Communications, 2002, Vol.5: 234-238
[132] Nagarajan R, Ekici E. Flexible MPLS signaling (FMS) for mobile networks. IEEE International Conference on Communication, 2004, Vol.7: 4321-4325
[133] Sa-Ngiamsak W, Krachodnok P, Varakulsiripunth R. A Recovery Scheme for QoS Guaranteed Mobile DP Over MPLS Network. 1st International Symposium on Wireless Pervasive Computing, 2006, Vol.1: 1-5
[134] Park J T. Resilience in GMPLS path management: model and mechanism. IEEE Communications Magazine, 2004, 42(7): 128 - 135
[135] Luca V, Andrea F, Ramkumar G, et al. Preplanned weighted restoration in highly dynamic GMPLS networks. Conference on Optical Fiber Communication, Technical Digest Series, 2002, Vol.70: 428-430
[136] Ahn G, Chun W. Simulator for MPLS path restoration and performance evaluation. Joint 4th IEEE International Conference on ATM and High Speed Intelligent Internet Symposium, 2001, 32-36
[137] Tornatore M, Canhui Ou, Jing Zhang, Pattavina A, Mukherjee B. PHOTO: an efficient shared-path-protection strategy based on connection-holding-time awareness. Journal of Lightwave Technology, 2005, 23(10): 3138 - 3146
[138] Kodialam M, Lakshman T V. Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information. IEEE/ACM Transactions on Networking, 2003, 11(3): 399-410
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |