支持QoS的可扩展可靠路由算法及转发技术研究
|
摘要
摘要：随着计算机网络技术的不断发展,网络为用户提供的服务正由传统的数据通信向包括视频会议、VOIP等多媒体实时应用在内的多样化服务转变.路由和转发作为分组网络的核心技术,在用户新业务需求的驱动下正面临着严峻的挑战.
首先,基于跳数的最短路径路由算法已不能满足多媒体实时业务可靠服务质量(QoS)路由的需求.设计有效的多维QoS约束下的分离路径路由算法,是新一代路由算法研究需要解决的问题.第二,要为业务进行端到端QoS控制服务就必须提供域间QoS路由,如何降低路由建立过程中所需扩散的数据量,提高域间QoS路由的可扩展性是QoS路由又一需要解决的关键问题.第三,现有IP网络难以为同一会话流的数据包提供确定的路由传输,这不仅给QoS控制带来了困难,也给网络计费、流量工程等管理和优化操作增加了难度.如何在IP网上提供快速灵活的路由转发也是网络QoS路由转发研究的关键问题.第四,网络精确的QoS控制往往依赖于对网络性能边界的定量计算,而传统的网络性能分析模型对具有高突发性和可变性的互联网流量不再有效.如何借助新的网络理论分析工具,对互联网业务流的QoS性能边界进行准确的定量运算,是QOS路由转发研究中十分值得研究的问题.
针对上述QoS路由与交换转发中的重要问题,本文进行了全面深入的研究.论文的主要创新工作如下：
(1)针对可靠QoS路由中现有多约束分离路径算法难以保证在任意网络中求得客观存在的可行解问题,提出了精确算法设计原则,设计了求解多约束最短链路分离路径对的精确算法LIDOMPA (Link Disjoint Optimal Multi-constrained Paths Algorithm),能够保证求得任意网络中客观存在的最优解.在此基础上,将LIDOMPA扩展为求解多约束最短节点分离路径对的精确算法NODOMPA(Node Disjoint Optimal Multi-constrained Paths Algorithm).理论分析和大量实验证明了本文所提算法能够有效求解多维QoS约束下的最短分离路径对,并实现了较低的算法复杂度.
(2)针对域间QoS路由的扩展性问题.提出了一种基于均匀折线的几何聚合方法.为进一步提高聚合性能,将均匀折线法与线段聚合法相结合,提出了一种基于六元组的混合式QoS信息几何聚合算法,该算法可根据聚合精确度选择不同的聚合模型进行聚合,聚合后的信息仅采用六元组数据便可表示,实现了常数阶O(1)的空间复杂度.定义了聚合误差率作为准则来精确衡量几何聚合算法性能的优劣.通过实验证明了本文所提聚合算法的性能优于现有算法,可以实现更低的聚合误差率.实验结果还表明,所设计聚合算法时间开销可行.
(3)针对现有网络难以实现可扩展的快速、灵活、安全转发问题.提出了一种基于链路接口ID编码(LIC:Link interface ID Code)的转发方法(LICF:LIC-based Forwarding).该方法通过在通信的源和目的间预先建立起面向连接的LIC路径,可直接根据LIC对数据包进行路由,避免了路由表查询开销,实现了基于显式路由的灵活快速转发,有助于网络服务质量的提高和流量工程的实现.由于不需要路由器存储和管理除路由表外的额外信息,LICF可获得良好的扩展性.由于可隐藏数据包报头的IP地址信息,LICF能有效增强网络通信的安全性.通过原型系统的实验验证了LICF能实现比现有转发技术更低的端到端延时并能有效提高网络的吞吐量和传输性能.
(4)在创新点(3)的基础上,将队列调度技术和分形漏桶技术引入到LICF网络,提出了QLICF(QoS-enhanced LICF)网络模型,使之能为业务提供更强的QoS服务.进一步利用近年来新兴起来的网络分析数学工具——网络微积分理论,对QLICF网络中自相关流的端到端延时上界、抖动上界、无丢包节点缓存需求大小上界等确定性QoS性能边界进行了讨论.给出了这些性能边界的定量计算结果.通过大量数值分析讨论了这些性能边界随数据流属性、优先级、网络路径长度等网络参数的变化规律.为进一步优化网络性能,实施网络QoS控制提供了理论依据.
ABSTRACT:With the development of network technologies, the service provided by networks is turning from traditional data communication into multiple services including many new real-time multimedia applications, such as video conference and VOIP. As the core technology of packet network, driven by the requirements of new services, routing and forwarding is meeting many great challenges.
First, hop-based shortest path routing algorithms can not meet demand of realibilty QoS routing for real-time multimedia applications. So, designing effective multi-constrained disjoint path algorithms is a key question of new gerenration routing algorithm. Second, in order to provide end-to-end (E2E) QoS control service for users, inter-domain QoS routing must be furnished. How to reduce the advertizing data quantity to improve inter-domain QoS routing scalability is a critical question to be solved. Third, current IP networks can hardly delivery the packet of a flow on a specified path, which makes it difficulty to do QoS control and to carry out network management and optimizition work, e.g. charging and traffic enginnering. Thus, how to provide E2E fast flexible forwarding over IP networks is a very important issue to be studied. Fourth, exact QoS control often depends on deterministic calculation of network performance bound, but the high variability and high burstness of internet traffic makes tradiational network analysis models invalid. How to do exact quantitative calculation with the bennifit of new network analysis tools for internet traffic also is a meaningful question greatly deserved to be studied.
Aiming at the problems mentioned above, this paper does much comprehensive and deep reaserch work. The main innovation work of our paper is as followes:
(1) To deal with the issue that existing algorithms cannot always ensure to find feasible solutions of multi-constrained link-/node-disjoint path pair (MCLPP/MCNPP) problem for realible QoS routing, we present the design principle for exact algorithms. Based on this, we propose the Link Disjoint Optimal Multi-constrained Paths Algorithm (LIDOMPA) for MCLPP problem. Moreover, we extend LIDOMPA and present the Node Disjoint Optimal Multi-constrained Paths Algorithm (NODOMPA) to solve the (MCNPP) problem. Theoritical analysis and extensive experiments show that our algorithms can find the shortest disjoint path pair under multiple QoS constraints and achieve accepted complexity.
(2) Directing towarding the scalability problem of inter-domain QoS routing. We present a regular polyline (RPL) based QoS-path aggregation algorithm. To further improve the aggregation performance, we propose a novel six-tuple based hybrid algorithm by combining the proposed RPL algorithm with the existing line segment (LS) approach. In the hybrid algorithm, a better model between the RPL model and the LS one can be adopted automatically to do aggregation. Only a six-tuple array is required to express the aggregated result and O(1) space complexity is achieved. Moreover, we define the aggregation error rate to evaluate the performances of geometric aggregation schemes accurately. Experiment results show that our methods outperform existing ones in terms of lower aggregation error rate and obtain feasible complexity.
(3) Aiming at the problem that current network can hardly do scalable fast flexible forwarding. We propose a Link-interface ID Code based Forwarding (LICF) approach, which can forward data packets directly according to the LIC in their headers via establishing connection-oriented LIC paths in advance. LICF is an explicit routing based forwarding approach, which avoids routing lookup in data packets forwarding and can improve network QoS performance and traffic engineering ability. Moreover, since besides the routing tables, no extra information needs to be stored and managed in routers, LICF achieves good scalability. As IP address information can be hidden in data packets transmission, LICF tends to enhance network security. Experiments performed on a prototype show that our scheme obtains fast forwarding and can help to increase network throughput effectively.
(4) Based on the work of (3) above, we present the QoS-enhanced LICF (QLICF) network model by introducing fractal leak bucket model and the WFQ model to enhance QoS ability of LICF network. Futher, we analyze the E2E delay bound, jitter bound and the non packet loss buffer size bound of QLICF network by means of the network calculus, a new effective theoretical tool on analyzing the QoS performance of Internet. The formulations of the three bounds mentioned above are presented and proved. We also analyze the variation patterns of these QoS bound versus the parametes including the traffic property and the queuing priority. The obtained conclusions can provide theoretical references for network optimization and QoS controll work.
首先,基于跳数的最短路径路由算法已不能满足多媒体实时业务可靠服务质量(QoS)路由的需求.设计有效的多维QoS约束下的分离路径路由算法,是新一代路由算法研究需要解决的问题.第二,要为业务进行端到端QoS控制服务就必须提供域间QoS路由,如何降低路由建立过程中所需扩散的数据量,提高域间QoS路由的可扩展性是QoS路由又一需要解决的关键问题.第三,现有IP网络难以为同一会话流的数据包提供确定的路由传输,这不仅给QoS控制带来了困难,也给网络计费、流量工程等管理和优化操作增加了难度.如何在IP网上提供快速灵活的路由转发也是网络QoS路由转发研究的关键问题.第四,网络精确的QoS控制往往依赖于对网络性能边界的定量计算,而传统的网络性能分析模型对具有高突发性和可变性的互联网流量不再有效.如何借助新的网络理论分析工具,对互联网业务流的QoS性能边界进行准确的定量运算,是QOS路由转发研究中十分值得研究的问题.
针对上述QoS路由与交换转发中的重要问题,本文进行了全面深入的研究.论文的主要创新工作如下：
(1)针对可靠QoS路由中现有多约束分离路径算法难以保证在任意网络中求得客观存在的可行解问题,提出了精确算法设计原则,设计了求解多约束最短链路分离路径对的精确算法LIDOMPA (Link Disjoint Optimal Multi-constrained Paths Algorithm),能够保证求得任意网络中客观存在的最优解.在此基础上,将LIDOMPA扩展为求解多约束最短节点分离路径对的精确算法NODOMPA(Node Disjoint Optimal Multi-constrained Paths Algorithm).理论分析和大量实验证明了本文所提算法能够有效求解多维QoS约束下的最短分离路径对,并实现了较低的算法复杂度.
(2)针对域间QoS路由的扩展性问题.提出了一种基于均匀折线的几何聚合方法.为进一步提高聚合性能,将均匀折线法与线段聚合法相结合,提出了一种基于六元组的混合式QoS信息几何聚合算法,该算法可根据聚合精确度选择不同的聚合模型进行聚合,聚合后的信息仅采用六元组数据便可表示,实现了常数阶O(1)的空间复杂度.定义了聚合误差率作为准则来精确衡量几何聚合算法性能的优劣.通过实验证明了本文所提聚合算法的性能优于现有算法,可以实现更低的聚合误差率.实验结果还表明,所设计聚合算法时间开销可行.
(3)针对现有网络难以实现可扩展的快速、灵活、安全转发问题.提出了一种基于链路接口ID编码(LIC:Link interface ID Code)的转发方法(LICF:LIC-based Forwarding).该方法通过在通信的源和目的间预先建立起面向连接的LIC路径,可直接根据LIC对数据包进行路由,避免了路由表查询开销,实现了基于显式路由的灵活快速转发,有助于网络服务质量的提高和流量工程的实现.由于不需要路由器存储和管理除路由表外的额外信息,LICF可获得良好的扩展性.由于可隐藏数据包报头的IP地址信息,LICF能有效增强网络通信的安全性.通过原型系统的实验验证了LICF能实现比现有转发技术更低的端到端延时并能有效提高网络的吞吐量和传输性能.
(4)在创新点(3)的基础上,将队列调度技术和分形漏桶技术引入到LICF网络,提出了QLICF(QoS-enhanced LICF)网络模型,使之能为业务提供更强的QoS服务.进一步利用近年来新兴起来的网络分析数学工具——网络微积分理论,对QLICF网络中自相关流的端到端延时上界、抖动上界、无丢包节点缓存需求大小上界等确定性QoS性能边界进行了讨论.给出了这些性能边界的定量计算结果.通过大量数值分析讨论了这些性能边界随数据流属性、优先级、网络路径长度等网络参数的变化规律.为进一步优化网络性能,实施网络QoS控制提供了理论依据.
ABSTRACT:With the development of network technologies, the service provided by networks is turning from traditional data communication into multiple services including many new real-time multimedia applications, such as video conference and VOIP. As the core technology of packet network, driven by the requirements of new services, routing and forwarding is meeting many great challenges.
First, hop-based shortest path routing algorithms can not meet demand of realibilty QoS routing for real-time multimedia applications. So, designing effective multi-constrained disjoint path algorithms is a key question of new gerenration routing algorithm. Second, in order to provide end-to-end (E2E) QoS control service for users, inter-domain QoS routing must be furnished. How to reduce the advertizing data quantity to improve inter-domain QoS routing scalability is a critical question to be solved. Third, current IP networks can hardly delivery the packet of a flow on a specified path, which makes it difficulty to do QoS control and to carry out network management and optimizition work, e.g. charging and traffic enginnering. Thus, how to provide E2E fast flexible forwarding over IP networks is a very important issue to be studied. Fourth, exact QoS control often depends on deterministic calculation of network performance bound, but the high variability and high burstness of internet traffic makes tradiational network analysis models invalid. How to do exact quantitative calculation with the bennifit of new network analysis tools for internet traffic also is a meaningful question greatly deserved to be studied.
Aiming at the problems mentioned above, this paper does much comprehensive and deep reaserch work. The main innovation work of our paper is as followes:
(1) To deal with the issue that existing algorithms cannot always ensure to find feasible solutions of multi-constrained link-/node-disjoint path pair (MCLPP/MCNPP) problem for realible QoS routing, we present the design principle for exact algorithms. Based on this, we propose the Link Disjoint Optimal Multi-constrained Paths Algorithm (LIDOMPA) for MCLPP problem. Moreover, we extend LIDOMPA and present the Node Disjoint Optimal Multi-constrained Paths Algorithm (NODOMPA) to solve the (MCNPP) problem. Theoritical analysis and extensive experiments show that our algorithms can find the shortest disjoint path pair under multiple QoS constraints and achieve accepted complexity.
(2) Directing towarding the scalability problem of inter-domain QoS routing. We present a regular polyline (RPL) based QoS-path aggregation algorithm. To further improve the aggregation performance, we propose a novel six-tuple based hybrid algorithm by combining the proposed RPL algorithm with the existing line segment (LS) approach. In the hybrid algorithm, a better model between the RPL model and the LS one can be adopted automatically to do aggregation. Only a six-tuple array is required to express the aggregated result and O(1) space complexity is achieved. Moreover, we define the aggregation error rate to evaluate the performances of geometric aggregation schemes accurately. Experiment results show that our methods outperform existing ones in terms of lower aggregation error rate and obtain feasible complexity.
(3) Aiming at the problem that current network can hardly do scalable fast flexible forwarding. We propose a Link-interface ID Code based Forwarding (LICF) approach, which can forward data packets directly according to the LIC in their headers via establishing connection-oriented LIC paths in advance. LICF is an explicit routing based forwarding approach, which avoids routing lookup in data packets forwarding and can improve network QoS performance and traffic engineering ability. Moreover, since besides the routing tables, no extra information needs to be stored and managed in routers, LICF achieves good scalability. As IP address information can be hidden in data packets transmission, LICF tends to enhance network security. Experiments performed on a prototype show that our scheme obtains fast forwarding and can help to increase network throughput effectively.
(4) Based on the work of (3) above, we present the QoS-enhanced LICF (QLICF) network model by introducing fractal leak bucket model and the WFQ model to enhance QoS ability of LICF network. Futher, we analyze the E2E delay bound, jitter bound and the non packet loss buffer size bound of QLICF network by means of the network calculus, a new effective theoretical tool on analyzing the QoS performance of Internet. The formulations of the three bounds mentioned above are presented and proved. We also analyze the variation patterns of these QoS bound versus the parametes including the traffic property and the queuing priority. The obtained conclusions can provide theoretical references for network optimization and QoS controll work.
引文
[AAM07]Alawieh B., Ahmed R.E., Mouftah H., Measurement of Restoration Time from Single-Link Failure in an Optical Testbed Environment,3rd International Conference on Testbeds and Research Infrastructure for the Development of Networks and Communities,2007, TridentCom 2007, pp.1-4.
[AAMX03]Amitabha B., Amitabh C., Michael T.G, Xu S.H., Constructing Disjoint Paths for Secure Communication, Lecture Notes in Computer Science, Distributed Computing,2003, pp. 181-195.
[Ahmadi09]Ahmadi S., An overview of next-generation mobile WiMAX technology, IEEE Communication Magzine,2009, vol.47, no.6, pp.84-98.
[AKH09]Al-Kuwaiti M., Kyriakopoulos N., Hussein S., A comparative analysis of network dependability, fault-tolerance, reliability, security, and survivability, IEEE Communications Surveys and Tutorials,2009, vol.11, no.2, pp.106-124.
[Aoyama08]Aoyama T., A new generation network - beyond NGN, First ITU-T Kaleidoscope Academic Conference on Innovations in NGN:Future Network and Services, K-INGN 2008, 2008, pp.3-10.
[ASFRM08]Ayatollahi Z., Sarukhani S., Fayazi F., Roknabady Z.A., Madani A., Interoperability problems in Next Generation Network protocols, Innovations in NGN:First ITU-T Kaleidoscope Academic Conference Future Network and Services, K-INGN 2008,2008, pp. 161-168.
[Bala01]Bala K., Internetworking between the IP and optical layer, Optical Networks Magazine, 2001, vol.2, no.3, pp.16-18.
[Baran64]Baran P., On Distributed Communications, RANDMemorandum, A series of eleven papers for work started in 1961,1964, http://www.rand.org/publications/RM/baran.list.html.
[Bell01]Bell M.G.H., The measurement of reliability in stochastic transport networks, Proceedings of 2001 IEEE Intelligent Transportation Systems,2001, pp.1183-1188.
[BGLT08]Bouillard A., Optimal routing for end-to-end guarantees using Network Calculus, Gaujal B., Lagrange S., Thierry E., Performance Evaluation,2008, vol.65, no.11-12, pp.883-906.
[BGMRSS00]Breitbart Y, Garofalakis M., Martin C., Rastogi R., Seshadri S., Silberschatz A., Topology discovery in heterogeneous IP networks, Proceedings-IEEE INFOCOM,2000, vol. 1, pp.265-274.
[Bhandari94] Bhandari R., Optimal diverse routing in telecommunication fiber networks, Proc. INFOCOM'94, Jun.1994, vol.3, pp.1498-1508.
[BHMPPT90]Brander H., Howard J., Menicou G., Plagemann S., Protonotarios E.N., Theologou M.E., Quality of service in broadband communications, International Conference on Integrated Broadband Services and Networks,1990, pp.166-171.
[BKP03]Beker S., Kofman D., Puech N., Off-line reduced complexity layout design for MPLS networks,3rd IEEE Workshop on IP Operations & Management,2003, (IPOM 2003), pp. 95-105.
[BO06]Baldi M., Ofek Y., Multi-Terabit/s IP Switching with Guaranteed Service for Streaming Traffic,25th IEEE International Conference on Computer Communications, INFOCOM 2006, Apr.2006, pp.1-5.
[Bollobas01] Bollobas B., "Random Graphs," 2nd ed. Cambridge, MA:Cambridge Univ. Press, 2001.
[Boymel93]Boymel D., Network management systems face the forces of change, Ascom technical review,1993, no.1, pp.24-27.
[BPIMM01]Becchetti L., Priscoli F.D., Inzerilli T., Mahonen P., Munoz L., Enhancing IP service provision over heterogeneous wireless networks:A path toward 4G, IEEE Communications Magazine,2001, vol.39, no.8, pp.74-81.
[BR01]Benjamin S., Rubin I., MPLS+:A scalable label switching network, Conference Record/ IEEE Global Telecommunications Conference,2001, vol.1, pp.1-6.
[BRTAR09]BGP Routing Table Analysis Reports,2009, Http://bgp.potaroo.net/as2.0/bgpact-ive.html.
[BT04]BT, http://www.btplc.com/21cn/
[BV03]Begtaseviii F., Van Mieghem P., Measurements of the Hopcount in Internet, http://www.ripe. net/pam2001/Abstracts/poster_03.pdf.
[BWSS05]Bi Y., Wu J., Song M., Song J.D., Seamless mobility management with QoS guarantee for next-Generation IP-based heterogeneous network environments, Proceedings-6th World Wireless Congress, WWC,2005, p 501-506.
[BZ96]Bennett J.C.R., Zhang H., WF2Q:worst-case fair weighted fair queueing, Proceedings of IEEE Fifteenth Annual Joint Conference of the IEEE Computer Societies, Networking the Next Generation,INFOCOM'96,1996, vol.1, pp.120-128.
[CASMRS04]Chakraborty D., Ashir A., Suganuma T., Mansfield K.G., Roy T.K., Shiratori N., Self-similar and fractal nature of internet traffic, International Journal of Network Management, vol.14, Issue 2,2004, pp.119-129.
[CBBCFFHSSW02] Clark D.D., Bellovin S., Braden B., Chiappa N., Faber T., Falk A., Handley M., Shenker S., Sollins K., Wroclawski J., NewArch:A New Architecture for an Internet. Report to Next Generation Internet PI Meeting, Work In Progress,2002.
[CC97]Campbell A.T., Coulson G., QoS adaptive transports:delivering scalable media to the desktop, IEEE Network,1997, vol.11, no.2, pp.18-27.
[CCF07]China Computer Federation(中国计算机协会),中国计算机科学技术发展报告,2007：庆祝“973”计划实施十周年／中国计算机学会主编,2007.
[CDW00]Ghani N., Dixit S., Wang T.S., On IP over WDM integration, IEEE Communication Magazine,2000, vol.38, no.3, pp.72-84.
[CE99]Charles E.P. and Elizabeth M.R., Ad hoc On-Demand Distance Vector Routing, Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, Feb.1999, pp.90-100.
[Chang98]Chang C.S., On deterministic traffic regulation and service guarantees:a systematic approach by filtering, IEEE Transactions on Information Theory, vol.44, no.3, May 1998, pp. 1097-1110.
[CH07]Chang C.L., Hsu C.C., Twin-bit based fast IP lookup and update algorithm, Journal of Internet Technology,2007, vol.8, no.3, pp.351-357.
[CLRS01]Cormen T.H., Leiserson C.E., Rivest R.L., Stein C., Introduction to Algorithms, Second Edition, MIT Press, Cambridge, MA,2001.
[CMYP09]Chen X.Q., Makki K., Yen K., Pissinou N., Sensor network security:A survey, IEEE Communications Surveys and Tutorials,2009, vol.11, no.2, pp.52-73.
[CN98]Chen S.G., Nahrstedt K., An overview of quality of service routing for next-generation high-speed networks:problems and solutions, IEEE Network,1998, vol.12, no.6, pp.64-79.
[CNNIC09]中国互联网信息中心(CNNIC:China Internet Network Information Center),中国互联网络发展状况统计报告,Jul.2009, http://www.cnnic.cn/index/OE/00/11/index.htm.
[Crovella97] Crovella M.E., Self-similarity in WWW Traffic:Evidence and Possible Causes, IEEE Transactions on Networking, vol.5, no.6, Dec.1997, pp.835-45.
[Cruz91]Cruz R.L., A Calculus for Network Delay, part Ⅰ:Network Elements in Isolation, IEEE Trascations on Information Theory, vol.17, no.1,1991, pp.114-131.
[Cruz91a]Cruz R.L., A Calculus for Network Delay, part Ⅱ:Network Analysis, IEEE Trascations on Information Theory, vol.17, no.1,1991, pp.132-141.
[CSTN03]China Science & Technology Network, http://www.cstnet.net.cn/cngi.jsp?Type=jianjie
[CV04]Chen D.Z., Varshney P,K., QoS support in wireless sensor networks:A survey, Proceedings of the International Conference on Wireless Networks, ICWN'04,2004, vol.1, pp.227-233.
[CW03]Christiansen H., Wessing H., Modeling GMPLS and optical MPLS networks, Proceedings of the 10th International Conference on Telecommunications,2003, ICT 2003, vol.1, pp. 288-294.
[CWKS97]Crow B.P., Widjaja I., Kim L.G., Sakai P.T., IEEE 802.11 Wireless Local Area Networks, IEEE Communications Magazine,1997, vol.35, no.9, pp.116-126.
[CXW03]Cui Y., Xu K., Wu J.P., precomputation for multi-constrained QoS routing in high-speed networks, proceedings of the IEEE INFOCOM'03,2003, pp.1414-1424.
[Davies65]Davies D., Packet Switching Proposal, Proposal and Prototype Implementation at UK National Physical Laboratories. Proposal and Prototype Implementation of packet-switching concepts,1965.
[DDRK98]David B.S., Doolan P. Rekhter Y, Kaufmann M., Switching in IP Networks:IP Switching, Tag Switching & Related Technologies, Baker & Taylor Books,1998.
[Dong07]董平(Dong P.),基于身份与位置分离映射的可扩展路由体系研究,北京交通大学博士论文,2007.
[DQZ08]董平(Dong P.),秦雅娟(QinY.J.),张宏科(Zhang H.K.).支持普适服务的一体化网络研究.电子学报,Vol.35, No.4,2007, pp.599-606.
[DR00]Davie B. and Rekhter Y., MPLS:Technology and Applications, Morgan Kaufmann Publishers,2000.
[DYY06]Deng Y.P., Yin K., Yu L., High Speed IP Routing Lookup Algorithm Based on RAM and TCAM Communications, International Conference on Circuits and Systems, Jun.2006, vol.3, pp.1677-1680.
[DV00]De Nevea H., Van Mieghem P., TAMCRA:a tunable accuracy multiple constraints routing algorithm, Computer Communications, vol.23,2000, pp.667-679.
[Eilam-Tzoreff98] Eilam-Tzoreff T., Disjoint shortest paths problem, Discrete Applied Mathematics, 1998, vol.85, nol.2, pp.113-138.
[EJLW01]Elwalid A., Jin C., Low S., Widjaja I., MATE:MPLS adaptive traffic engineering,20th
Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2001, Vol.3,2001, pp.1300-1309.
[ER98]Explicit Routing, http://www.juniper.net/techpubs/software/erx/junose52/swconfig-routing-vol2/html/mpls-config8.html, Juniper Networks, copyright,1998-2009.
[Etemad08]Etemad K., Overview of mobile WiMAX technology and evolution, IEEE Communications Magazine,2008, vol.46, no.10, pp.31-40.
[EY03]Ethan R., Yong S., WFQ:Weighted Fairness Queuing, http://nislab.bu.edu/sc546/sc441 Spring2003/wfq/index.htm
[Feng07]Feng G., The revisit of QoS routing based on non-linear Lagrange relaxation, International Journal of Communication Systems,2007, vol.20, no.1, pp.9-22.
[Feng08]Feng J., A special issue on advances in new generation Internet architecture research. Science in China Series F:Information Sciences, Public release date:Oct.22,2008.
[FPR08]Fgee E.B., Phillips W.J., Robertson W., Comparison between a Proposed QoS Mathematical Model and other IP QoS Models,6th Annual Communication Networks and Services Research Conference, CNSR'08, May 2008, pp.595-599.
[FPRES08]Fgee E.B., Phillips W.J., Robertson W., Elhounie A., Smeda A., the 3rd International Conference on Information and Communication Technologies:From Theory to Applications, ICTTA 2008, Apr.2008, pp.1-5.
[GC09]葛振斌(Ge Z.B.),陈辉(Chen H.),2009年光网络发展趋势展望,光电新闻网,通信世界,http://fiber.ofweek.com/2009-01/ART-210005-8400-26772001.html
[GG02]Garcia, L.E., Garijo M., Scalability Issues in the Configuration of Traditional ATM, PNNI ATM and MPLS Based Services, Journal of The Communications Network,2002, vol.1, no.2, pp.24-31.
[GJ79]Garey M.R. and Johnson D.S., Computers and Intractability:A Guide to the Theory of NP-completeness, San Francisco, CA:Freeman,1979.
[GKV03]Guo Y.C., Kuipers F.A., Van Mieghem P., A Link disjoint paths algorithm for reliable QoS routing, International Journal of Communication Systems,2003, vol.16, no.9, pp.779-798.
[GKVC05]郭宇春(Guo Y.C.), Kuipers F., Van Mieghem P.陈常嘉(Chen C.J.),多约束分离路径算法,铁道学报,2005, vol.27, no.2, pp.49-57.
[GN07]Gong M. and Naser H., Diverse delay-constrained restoration schemes, Optical Fiber Communication and the National Fiber Optic Engineers Conference, OFC/NFOEC 2007, pp. 1-12.
[GSM07]Gewali L., Selvaraj H., Mazzella D., Constrained Disjoint Paths in Geometric Network, International Conference on Computational Intelligence and Multimedia Applications,13-15, Dec.2007, Vol.2, pp. xxiii-xxiii.
[Gubbins05] Gubbins, Ed, MPLS moved downstream, Telephony,2005, vol.246, no.17, pp.24-26.
[Guo07]郭宇春(Guo Y.C.),因特网拓扑特征推断与建模,北京交通大学博士论文,2007,pp.123-138.
[GYL04]Guo L., Yu H.F., Li L.M., Double-link failure protection algorithm for shared sub-path in survivable WDM mesh networks, Chinese Optics Letters,2004, vol.2, no.7, pp.379-382.
[HDD08]Htira W., Dugeon O., Diaz M., A novel bandwidth broker architecture based on topology aggregation in delay bandwidth sensitive networks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), NETWORKING 2008:AdHoc and Sensor Networks, Wireless Networks, Next Generation Internet-7th International IFIP-TC6 Networking Conference, Proceedings, LNCS 2008, vol.4982, pp.482-493.
[HDX07]Huang L., Du X.W., Xiao J., Multi-constrained routing based on tabu search,2007 IEEE International Conference on Control and Automation, ICCA2007, pp.157-161.
[Henig86]Henig M.I., The shortest path problem with two objective functions, European Journal of Operational Research, Vol.25, no.2,1986, pp.281-291.
[Hinde98]Hinde S., Recent security surveys, Computers and Security,1998, vol.17, no.3, pp. 207-210.
[HKK02]Huang L., Kumar S., Kuo C.C.J., Quality of service provisioning for multimedia services in next-generation wireless networks, Proceedings of SPIE-The International Society for Optical Engineering,2002, vol.4861, pp.153-162.
[HL96]Heyman D.P. and Lakshman T.V., What are the Implications of Long-Range Dependence for VBR-Video Traffic Engineering, IEEE/ACM Transctions on Networking, vol.4, no.3, June 1996, pp.301-17.
[HR08]He J.Y., Rexford J., Toward Internet-Wide Multipath Routing, IEEE Network,2008, vol.22, no.2, pp.16-21.
[HS06]Hou R.H., Shi H.S., A localized algorithm for finding disjoint paths in wireless sensor networks, IEEE Communications Letters,2006, vol.10, no.12, pp.807-809.
[HWLW07]Hu C.H., Wu M., Liu G.P., Wang S.C., Hybrid scheduling model and analysis of performance for switched industrial Ethernet, Journal of Central South University of Technology, vol.14, no.2,2007, pp.271-277.
[HYWLL09]Hwang T., Yang C.Y, Wu G., Li S.Q., Li G., OFDM and its wireless applications:A survey, IEEE Transactions on Vehicular Technology,2009, vol.58, no.4, pp.1673-1694.
[HZ00]Hao F., Zegura E. W., On Scalable QoS Routing:Performance Evaluation of Topology Aggregation, INFOCOM,2000, pp.147-156.
[IAB06]The IAB Routing and Addressing Workshop report,2006, http://www.iab.org/about/work-shops/routingandaddressing/index.html
[ICT08]Information & Communication Technologies, Future Internet Research and Experiment-ation, http://cordis.europa.eu/fp7/ict/fire/
[ISC08]Internet Systems Consortium, https://www.isc.org/solutions/survey/history,2009.
[Jeon04]Jeon S.E., Topology aggregation method for multiple link parameters, IEEE GLOBECOM 2004. vol.3, pp.1378-1382.
[Jiang06b]Jiang Y.M., Delay bound and packet scale rate guarantee for some expedited forwarding networks, Computer Networks, Vol.50, no.1,2006, pp.15-28.
[Jiang06a]Jiang Y.M., A basic stochastic network calculus, Computer Communication Review,2006, vol.36, no.4, pp.123-134.
[JM96]Johnson D.B. and Maltz D.A., Dynamic Source Routing in Ad Hoc Wireless Networks, In Mobile Computing, Kluwer Academic Publishers, Chapter 5, pp.153-181,1996.
[JWP09]Jin J., Wang W.H., Palaniswami M., Utility max-min fair resource allocation for communication networks with multipath routing, Computer Communications,2009, vol.32, no.
17, pp.1802-1809.
[KC00]Ke, Y.K., Copeland J.A., Scalability of routing advertisement for QoS routing in an IP network with guaranteed QoS, IEEE Global Telecommunications Conference,2000, vol.1, pp. 605-610.
[KH04]Kim H., Hou J.C.,Network calculus based simulation for TCP congestion control:Theorems, implementation and evaluation, IEEE INFOCOM 2004-Conference on Computer Communications-Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies,2004, vol.4, pp.2844-2855.
[KK00]Korkmaz T., Krunz M., Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks, ACM Trans. Modeling Computer Simulation,2000, vol.10, no.4, pp. 295-325.
[KK77]Kleinrock L., Kamoun F., Hierarchical routing for large networks:Performance evaluation and optimization, Computer Network, vol.1, no.3, Jan.1977, pp.155-174.
[KL07]Kodialam M., Lakshman T.V., A Scalable Approach to Building Fast Switches using Slow Schedulers, Workshop on High Performance Switching and Routing,2007, HPSR'07,1 Jun., 2007, pp.1-6.
[Kleinrock61] Kleinrock L., Information Flow in Large Communication Nets,. MIT Proposal for PhD Thesis, Mar.1961, http://www.lk.cs.ucla.edu/LK/Bib/REPORT/PhD/.
[KM04]Kuurne A., Miettinen A.P., Weighted round robin scheduling strategies in (E)GPRS radio interface,2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall:Wireless Technologies for Global Security,2004, vol.60, no.5, pp.3155-3159.
[Kolic04]Kolic R., An introduction to Ultra Wideband (UWB) wireless, Feb.,2004, http://www. deviceforge.com/articles/AT8171287040.html.
[KT91]Koivo H.N., Tanttu J.T., Tuning of PID controllers:Survey of SISO and MIMO techniques, IFAC Symposia Series,1991, no.7, pp.75-80.
[Kuipers00] http://www.nas.ewi.tudelft.nl/people/Fernando/software.html
[KV03]Kuipers F.A. and Van Mieghem P., The impact of correlated link weights on QoS routing, Proceedings of IEEE INFOCOM'03, vol.2,2003, pp.1425-1434.
[LB06]Luo Y.J., Bai Y.C., Scalable topology aggregation algorithm for QoS routing in hierarchical networks, Journal of Southeast University (English Edition),2003, vol.19, no.4, pp.331-335.
[LBL07]Li C.Z., Burchard A., Liebeherr J., A network calculus with effective bandwidth, IEEE/ACM Transactions on Networking,2007, vol.15, no.6, pp.1442-1453.
[LC03]Le boudec J.Y., Charny A., Packet Scale Rate Guarantee for Non-FIFO Nodes, IEEE/ACM Transactions on Networking, vol.11, no.5,2003, pp.810-820.
[LC06]Leu S., Chang R.S., A fast and scalable IPv4 and 6 address lookup algorithm, Computer Communications,2006, vol.29, no.16, pp.3020-3036.
[LCKL08]Lee H., Choi G., Kim H., Lee K., A nature-inspired QoS routing algorithm for next generation networks, Proceedings-4th International Conference on Autonomic and Autonomous Systems, ICAS 2008, pp.226-232.
[Le02]Le boudec J.Y., Some Properties Of Variable Length Packet Shapers, ACM/IEEE Transac-tions on Networking,2002, Vol.10, Issue 3, pp.329-337.
[Lee95]Lee W.C., Topology aggregation for hierarchical routing in ATM networks, Computer Communication Review,1995, vol.25, no.2, pp.85-92.
[LG01]Lee S.J., Gerla M., Split multipath routing with maximally disjoint paths in ad hoc networks, IEEE International Conference on Communications,2001, ICC 2001, vol.10, pp.3201-3205.
[LGZ07]李昭桦(Li Z.H.),郜帅(Gao S.),张宏科(Zhang H.K.), IEEE802.15.4网络的IPv6报头压缩研究,北京交通大学学报,2007, vol.31, no.5, pp.63-66.
[LHXY07]陆慧梅(Lu H.M.),胡虹雨(Hu H.Y.),向勇(XiangY.),阎永航(Yan Y.H.),基于延时—带宽约束的新型层次拓扑聚集算法,通信学报,2007, vol.28, no.3, pp.93-99.
[Lin09]林闯(Lin C.),《新一代互联网体系结构》专辑前言,计算机学报,vol.32, no.3.
[LL06]Li S.S.S., Lui K.S.,2-Line Segment Topology Aggregation Mechanism for QoS Routing, IEEE Region 10 Annual International Conference,14-17 Nov.2006, pp.1-4.
[LL07]林闯(Lin C.),雷蕾(Lei L.),下一代互联网体系结构研究,计算机学报,2007,vol.30,no.5,pp.693-711.
[LLJ06]刘爱波(Liu A.B.),陆月明(Lu Y.M.),纪越峰(Ji Y.F.),基于非对称有向网络的拓扑抽象算法研究,电子学报,2006,第34卷,第1期,pp.180-184.
[LNC04]Lui K.S., Nahrstedt K., Chen S.G., Routing with Topology Aggregation in Delay-Bandwidth Senstive Networks, IEEE/ACM Transctions on Networking, Vol.12, No.1, Feb.2004, pp.17-29.
[LT04]Le Boudec J.Y, Thiran P., Network Calculus, Berlin:Springer Verlag, Version May 10,2004.
[LTWW94]Leland W.E., Taqqu M.S., Willinger W., Wilson D.V., On the self-similar nature of Ethernet traffic, IEEE/ACM Transctions on Networking, Vol.2, No.1,1994, pp.1-15.
[LWR08]林闯(Li C.),王元卓(WangY.Z.),任丰原(Ren F.Y.),新一代网络QoS研究,下一代互联网体系结构研究,计算机学报,2008, vol.31, no.9, pp.1525-1535.
[LZM07]Li Z.Q., Zheng D.Q., Ma Y, Tree, Segment Table, and Route Bucket:A Multi-Stage Algorithm for IPv6 Routing Table Lookup, IEEE International Conference on Computer Communications, INFOCOM, May.2007, pp.2426-2430.
[Ma05]马娅婕(Ma Y.J.), MPLS网络拓扑聚集算法的研究,华中科技大学博士学位论文,2005.
[Marciniak08] Marciniak M., Future Networks-beyond Next Generation Networking,10th Anniversary International Conference on Transparent Optical Networks, ICTON 2008,2008, vol.1, pp.25-28.
[MBF07]Metz C., Barth C., Filsfils C., Beyond MPLS...Less Is More, IEEE Internet Computing, 2007, vol.11, no.5, pp.72-76.
[MHZ09]Mellouk A., Hoceini S., Zeadally S., Design and performance analysis of an inductive QoS routing algorithm, Computer Communications, Computer Communications on Heterogeneous Networking for Quality, Reliability, Security and Robustness-Part Ⅱ,2009, vol. 32, no.12, pp.1371-1376.
[MIP08]Marwaha S., Indulska J., Portmann M., Challenges and recent advances in QoS provisioning, signaling, routing and MAC protocols for MANETs, Proceedings of the 2008 Australasian Telecommunication Networks and Applications Conference, ATNAC 2008,2008, pp.97-102.
[MLG03]Mohapatra P., Li J., Gui C., QoS in mobile ad hoc networks Source:IEEE Wireless Communications, June 2003, vol.10, no.3, pp.44-52.
[MM07]Minei I., Marques P.R., Scalability Considerations in BGP/MPLS IP VPNs, IEEE Communications Magazine, Apr.2007, vol.45, no.4, pp.26-31.
[MMSDO06]Marin-Tordera E., Masip-Bruin X., Sanchez-Lopez S., Domingo-Pascual J., Orda A., The prediction approach in QoS routing, IEEE International Conference on Communications, ICC 2006, vol.3, pp.1020-1025.
[Morin95]Morin P.R., The Impact of Self-Similarity on Network Performance Analysis, Ph.D. dissertation, Carleton Univ., Dec.1995.
[MS05]Mo L., Sandrasegaran K., Network management challenges for next generation networks, Proceedings of The IEEE Conference on Local Computer Networks,30th Anniversary, LCN 2005, pp.593-598.
[MXLL08]马建国(Ma J.G.),席明贤(Xi X.M.),林益民(Lin Y.M.),李幼平(Li Y.P.),中国Internet路由级跳数测量与分析,计算机应用研究,2008, vol.25, no.7. pp.37-42.
[MY06]Mario B., Yoram O., Multi-Terabit/s IP Switching with Guaranteed Service for Streaming Traffic,25th IEEE International Conference on Computer Communications, INFOCOM'06, Apr.2006, pp.1-5.
[MYDFCe05]Masip-Bruin X.,Yannuzzi M., Domingo-Pascual J., Fonte A., Curado M., et al., Research challenges in QoS routing, Computer Communications,2006, vol.29, no.5, p 563-581.
[MZT05]Ma Y.J., Zhang G.X., Tian X.C., A new topology aggregation scheme for scalable MPLS networks, Proceedings of SPIE-The International Society for Optical Engineering Network Architectures, Management, and Applications Ⅲ, vol.6022 Ⅱ,2005.
[MZZ08]马震远,周杰,张凌,基于隧道的全球可扩展IP-Anycast实现方法,华南理工大学学报,2008, vol.36, no.4, pp.75-79,103.
[Nagle87]Nagle J., On packet switches with infinite storage, IEEE Transactions on Communications, 1987, vol. COM-35, no.4.
[Nasser09]Nasser N., Service adaptability in multimedia wireless networks, IEEE Transactions on Multimedia,2009, vol.11, nol.4, pp.786-792.
[ND08]Naraghi-Pour M., Desai V, Loop-free traffic engineering with path protection in MPLS VPNs, Computer Networks,2008, vol.52, no.12, pp.2360-2372.
[NG07]Naser H. and Gong M., Link-Disjoint Shortest-Delay Path-Pair Computation Algorithms for Shared Mesh Restoration Networks,12th IEEE Symposium on Computers and Communications,2007, ISCC 2007, pp.269-274.
[NML98]Newman P., Minshall G., and Lyon T.L., IP Switching-ATM Under IP, IEEE/ACM Transactions on Networking,1998, vol.6, no.2, pp.117-129.
[NSF08]National Science Foundation, Future Internet Design, http://find.isi.edu/
[NSF09]National Science Foundation, Global Environment for Network Innovations, http://www. geni.net/?page_id=2
[NS2]The Network Simulator-ns-2, http://ww.isi.edu/nsnam/ns/.
[OMHC05]Okumus I.T., Mantar H.A., Hwang J., Chapin S.J., Inter-domain QoS routing on Diffserv networks:A region-based approach, Computer Communications,2005, vol.28, no.2, pp. 174-188.
[Orda05]Orda A., QoS routing:Challenges and solution approaches, Second International Confe-rence on Quality of Service in Heterogeneous Wired/Wireless Networks, Qshine 2005,2005.
[OS89]Oqier R., Shacham N., Distributed algorithm for finding shortest pairs of disjoint paths, Proceedings of INFOCOM'89,1989, pp.173-182.
[OS00]Orda A., Sprintson A., QoS Routing:The Precomputation Perspective, IEEE Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2000, Mar.2000, vol 1, pp.128-136.
[OS03]Orda A., Sprintson A., Precomputation schemes for QoS routing, IEEE/ACM Transactions on Networking, vol 11, no.4,2003, pp.578-591.
[OSMY03]Oki E., Matsuura N., Shiomoto K., Yamanaka N., A disjoint path selection scheme with shared risk link group constraints in GMPLS networks, IEICE Transactions on Communications,2003, vol. E86-B, no.8, pp.2455-2462.
[Pavlou06]Pavlou G., Traffic engineering and quality of service management for IP-based NGNs, 10th IEEE/IFIP Symposium Record on Network Operations and Management Symposium, 2006, pp.589.
[PB94]Perkins C.E., Bhagwat P., Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, ACM SIGCOMM Computer Communication Review,1994, vol.24, no.4, pp.234-244.
[PG93]Parekh A.K., Gallager R.G., A generalized processor sharing approach to flow control in integrated service networks:The single node case, IEEE/ACM Transactions on Networking, Vol. 1.no.3,1993, pp.344-357.
[PG94]Parekh A.K., Gallager R.G., A generalized processor sharing approach to flow control in integrated service networks:The multiple node case, IEEE/ACM Transactions on Networking, Vol.2, no.2,1994, pp.137-150.
[PGGS02]Procissi G., Garg A., Gerla M., Sanadidi M.Y., Token bucket characterization of long-range dependent traffic, Computer Communications, vol.25, no.11-12,2002, pp. 1009-1017.
[PKC96]Park K., Kim G., and Crovella M., On the Relation Between File Sizes, Transport Protocols, and Self-similar Network Traffic, Proceedings of IEEE International Conference on Network Protocols, Oct.1996, pp.171-80.
[PS06]Peng C., Shen H., An Improved Approximation Algorithm for Computing Disjoint QoS Paths, International Conference on Networking, International Conference on Systems andInternational Conference on Mobile Communications and Learning Technologies ICNICONSMCL,23 Apr. 2006, pp.10.
[QCZ08]Qi H.M., Chen Z.G., Zhang L.M., Towards end-to-end delay bounds on WMNs based on statistical network calculus, the 9th International Conference for Young Computer Scientists, ICYCS 2008, Nov.2008, pp.493-497.
[QGL08]钱华林(Qian H.L.),葛敬国(Ge J.G.),李俊(Li J.),层次交换网络体系结构,清华大学出版社,2008.11月,第一版.
[Qi05]齐小刚,训‘算机网络中的路由与性能优化,西安电子科技大学博士学位论文,Au更2005.
[RBT08]Rawat P., Bonnin J.M., Toutain L., Designing a tunneling header compression (TuCP) for tunneling over IP, Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems, ISWCS'08,2008, pp.273-278.
[RC07]Raman B., Chebrolu K., Experiences in using Wi-Fi for rural internet in India, IEEE Communications Magazine,2007, vol.45, no.1, pp.104-110.
[RFC793]Information Sciences Institute University of Southern California, Transmission Control Protocol, RFC 793.
[RFC1105]Lougheed K., Rekhter Y., A Border Gateway Protocol (BGP), June 1989.
[RFC1180]Socolofsky T., Kale C., TCP/IP tutorial, RFC 1180, Jan.1991.
[RFC1269]Willis S., Burruss J., Definitions of Managed Objects for the Border Gateway Protocol (Version 3), RFC 1269, Oct.1991.
[RFC 1518]Rekhter Y., Li T., An Architecture for IP Address Allocation with CIDR, RFC 1519, Sep. 1993.
[RFC1519]Fuller V., Li T., Yu J., Classless Inter-Domain Routing (CIDR):an Address Assignment and Aggregation Strategy, RFC 1519, Sep.1993.
[RFC1606]Onions J. A Historical Perspective On The Usage Of IP Version 9, RFC 1606, Apr.1994.
[RFC1633]Braden R., Clark D., Shenker S., Integrated Services in the Internet Architecture-an Overview. RFC 1633, Jun.1994.
[RFC1721]Malkin G., RIP Version 2 Protocol Analysis, RFC 1721, Nov.1994.
[RFC1772]Rekhter Y. and P. Gross, Application of the Border Gateway Protocol in the Internet, RFC 1772, March 1995.
[RFC1817]Rekhter Y., CIDR and Classful Routing, RFC 1817,Aug.1995.
[RFC1883]Deering S., Hinden R., Internet Protocol, Version 6 (IPv6) Specification", RFC 1883, Dec.1995.
[RFC 1884]Hinden R., Deering S., IP Version 6 Addressing Architecture, RFC 1884, Dec.1995.
[RFC 1887]Rekhter Y., Li T., An Architecture for IPv6 Unicast Address Allocation", RFC 1887, Dec. 1995.
[RFC2216]Shenker S., Wroclawski J., Network Element Service Specification Template, RFC 2216, Sep.1997.
[RFC2328]Moy J., OSPF Version 2, Apr.1998.
[RFC2791]Yu J., Scalable Routing Design Principles, Network Working Group, Request for Comments, RFC 2791,2000.
[RFC3031]Rosen E., Viswanathan A., Callon R., Multiprotocol Label Switching Architecture, RFC 3031, Jan.2001.
[RFC3550]Schulzrine H., Casner S., Frederick R., Jacobson V., RTP:A Transport Protocol for Real-Time Applications, RFC 3550, Jul.2003.
[RFC3561]Charles E.P., Elizabeth M.B., Samir D., Ad Hoc On Demand Distance Vector (AODV) Routing, IETF RFC 3561, July,2003.
[RFC3814]Nadeau T., Srinivasan C., Viswanathan A., Multiprotocol Label Switching (MPLS) Forwarding Equivalence Class To Next Hop Label Forwarding Entry (FEC-To-NHLFE) Management Information Base (MIB), RFC 3814, June 2004.
[RFC3945]Mannie E., Generalized Multi-Protocol Label Switching (GMPLS) Architecture, RFC 3945, Oct.2004.
[RFC3984]Weger S., Hannuksela M.M., Stockhammer T., Westerlund M., Singer D., RTP Payload Format for H.264 Video, RFC 3984, Feb.2005.
[RFC4216]Zhang R., Vasseur J.P., MPLS Inter-Autonomous System (AS) Traffic Engineering (TE) Requirements, RFC 4216, Nov.2005.
[RFC4271]Rekhter Y., Li T., A Border Gateway Protocol 4 (BGP-4), RFC 4271, Jan.2006.
[RFC4278]Johnson D., Hu Y., Maltz D., The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4, RFC4278, Feb.2007.
[RFC4632]Fuller V., Li T., Classless Inter-domain Routing (CIDR):The Internet Address Assignment and Aggregation Plan, RFC 4632, Aug.2006.
[RFC4984]Meyer D., Zhang L., Fall K., Report from the IAB Workshop on routing and addressing, RFC 4984, Sep.2007.
[RMB05]Ravikumar V.C., Mahapatra R.N., Bhuyan L.N., EaseCAM:An energy and storage efficient TCAM-based router architecture for IP lookup, IEEE Transactions on Computers, 2005, vol.54, no.5, pp.521-533.
[RRG07]http://rr-fs.caida.org/
[RPT96]Raghavan S.V., Prabhakaran B., Tripathi S.K., Handling QoS negotiations in orchestrated multimedia presentations, Journal of High Speed Networks,1996, vol.5, no.3, pp.277-292.
[SFAS05]Sangireddy R., Futamura N., Aluru S., Somani A.K., Scalable, memory efficient, high-speed IP lookup algorithms, IEEE/ACM Transactions on Networking,2005, vol.13, no.4, pp.802-812.
[SFM05]Solano F., Fabregat R., Marzo J.L., Full Label Space Reduction in MPLS Networks: Asymmetric Merged Tunneling, IEEE Communications Letters, vol.9, no.11, Nov.2005, pp.1021-1023.
[SGPSBB07]Siekkinen M., Goebel V., Plagemann T., Skevik K.A., Banfield M., Brusic I., Beyond the future internet-Requirements of autonomic networking architectures to address long term future networking challenges, Proceedings of the IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems, FTDCS 2007, pp.89-98.
[Shen03]沈鑫剡(Shen X.Y.), IP交换网原理、技术及实现,人民邮电出版社,2003.
[Sherrington07] Sherrington s., MPLS:Metro a No-Go?, http://www.lightreading.com/document.asp? doc_id=134968
[SHZY08]Sun Q., Huang X.H., Zhou X.J., Yan M., A dynamic binary hash scheme for ipv6 lookup, IEEE Global Telecommunications Conference, GLOBECOM 2008, pp.2324-2328.
[Simon04]Simon S., Back to the Future Part 4:The Internet, ACM SIGCOMM 2004, Keynote Speech,2004.
[SK08]Shin M.K., Kim Y.W., New challenges on future network and standardization, Proceedings of the 10th International Conference on Advanced Communication Technology, ICACT 2008, 2008, vol.1, pp.745-759.
[SLJ02]Science Links Japan, http://sciencelinks.jp/j-east/article/200321/000020032103A0697130. php
[SSBPKG07]Sheikh W., Shafiq B., Baqai S., Paul R.A. Khan M.F., Ghafoor H., A QoS framework for multimedia applications in mobile ad hoc networks, Computer Systems Science and Engineering,2007, vol.22, no.3, pp.165-173.
[ST84]Suurballe J.W., Tarjan R.E., A quick Method for Finding Shortest Pairs of Disjoint Paths, Networks, vol.14, no.2,1984, pp.325-333.
[ST99]Sahinoglu Z. and Tekinay S., On Multimedia Networks:Self-similar Traffic and Network Performance, IEEE Communication Megzine, vol.37, no.1,1999, pp.48-52.
[Suurballe74] Suurballe J.W., Disjoint paths in a network, Networks, vol.4, no.2,1974, pp. 125-145.
[SYOM07]Sprintson A., Yannuzzi M., Orda A., Masip-Bruin X., Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks,26th IEEE International Conference on Computer Communications, IEEE INFOCOM,6-12 May.2007, pp.1820-1828.
[SV95]Shreedhar M., Varghese G., Efficient fair queueing using deficit round robin, ACM SIGCOMM Computer Communication Review,1995, vol.25, no.4. pp.231.
[SVM09]Srivastava S., Van de L.A., Medhi D., Traffic engineering of MPLS backbone networks in the presence of heterogeneous streams, Computer Networks,2009, vol.53, no.15, pp. 2688-2702.
[SZF08]Schmitt J.B., Zdarsky F.A., Fidler M., Delay bounds under arbitrary multiplexing:When network calculus leaves you in the lurch,2008, Proceedings-27th IEEE Communications Society Conference on Computer Communications, INFOCOM,2008, pp.2342-2350.
[Talbot05]Talbot D., The Internet is Broken, Technology Review, Dec.2005.
[Teixeira03] Teixeira R., In search of path diversity in ISP networks, Proceedings of the ACM SIGCOMM Internet Measurement Conference 2003, IMC 2003, pp.313-318.
[TC04]Tang Y., Chen S..G,. QoS information approximation for aggregated networks, IEEE International Conference on Communications, Paris, France,2004, pp.2107-2111.
[TC07]Tang Y., Chen S.G., Ling Y.B., State aggregation of large network domains, Computer Communications,2007, vol.30, no.4, pp.873-885.
[TL07]Tizghadam A., Leon-Garcia A., LSP and back up path setup in MPLS networks based on path criticality index,2007 IEEE International Conference on Communications, ICC'07, pp. 441-448.
[TLUN07]Tam W.Y, Lui K.S., Uludag S., Nahrstedt K, Quality-of-Service routing with path information aggregation, Computer Networks,2007, vol.51, no.12, pp.3574-3594.
[TMF04]Tacca M., Monti P., Fumagalli A., The disjoint path-pair matrix approach for online routing in reliable WDM networks,2004 IEEE International Conference on Communications, 2004, vol.2, pp.1187-1191.
[TMSV03]Teixeira R.; Marzullo K., Savage S., Voelker G.M., Characterizing and Measuring Path Diversity of Internet Topologies, Performance Evaluation Review, International Conference on Measurement and Modeling of Computer Systems, ACM SIGMETRICS 2003, Jun.2003, vol. 21, no.1, pp.304-305.
[Towela00]Towela N.J., Impact of Traffic Aggregation on Network Capacity and Quality of Service, University of Kansas, http://www.ittc.ukans.edu. Feb.2000.
[ULNB07]Uludag S., Lui K.S., Nahrstedt K., Brewster G., Analysis of Topology Aggregation Techniques for QoS Routing, ACM Computing Surveys,2007, vol.39, No.3, Article 7.
[VDK01]Van Mieghem P., De Nevea H., Kuipers F.A., Hop by hop quality of service routing, Computer Networks, vol.37,2001, pp.407-423.
[Van01]Van Mieghem P., Paths in the simple random graph and the Waxman graph, Probability in the Engineering and Informational Sciences, vol.15,2001, pp.535-555.
[VK99]Veeraraghavan M., Karol M., Internetworking connectionless and connection-oriented networks, IEEE Communications Magazine,1999, vol.37, no.12, pp.130-138.
[VK03]Van Mieghem P., Kuipers F.A., On the complexity of QoS routing, Computer Communications, Mar.2003, vol.26, no.4, pp.376-387.
[VK04]Van Mieghem P. and Kuipers F.A., Concepts of Exact QoS Routing Algorithms, IEEE/ACM TRANSACTIONS ON NETWORKING, Oct.2004, vol.12, no.5, pp.851-863.
[VKK03]Van Mieghem P., Kuipers F.A., Korkmaz T., et al., Quality of Service Routing, Chapter 3 in Quality of Future Intern Services, EU-COST 263 Final Report, in Springer LNCS 2856, 2003, pp.80-117.
[WC96]Wang Z. and Crowcroft J., Quality-of-service routing for supporting multimedia applications, IEEE Journal on Selected Areas in Communications, Sept.1996, vol.14, no.7, pp. 1228-1234.
[WCL05]Wuu L.C., Chen K.M., Liu T.J., A longest prefix first search tree for IP lookup, IEEE International Conference on Communications, ICC 2005,2005, vol.2, pp.989-993.
[Welcher00] Welcher P.J., Introduction to MPLS, http://www.netcraftsmen.net/welcher/papers/ mplsin-tro.html,2000.
[WHPH08]Wang N., Ho K.H., Pavlou G., Howarth, M., An overview of routing optimization for internet traffic engineering, IEEE Communications Surveys & Tutorials,2008, vol.10, no.l, pp.36-56.
[Wikipedia08] Wikipedia, http://en.wikipedia.org/wiki/List_of_countries_by_number_of_Internet_hosts.
[WLX08]Wang Y., Li L.M., Xu D., Pervasive QoS routing in next generation networks, Computer Communications,2008, vol.31, no.14, pp.3485-3491.
[WO04]Wang L., Olariu S., A unifying look at clustering in mobile ad hoc networks,Wireless Communications and Mobile Computing,2004, vol.4, no.6, pp.623-637.
[WSJL07]吴正宇(Wu Z.Y.),宋瀚涛(Song H.T.),姜少峰(Jiang S.F.),梁野(Liang Y), Ad-Hoc网络中一种可靠的节点不相交多路径路由算法,北京理工大学学报,2007, vol.27, no.3, pp. 243-246.
[WSLDH06]Wang C.G., Sohraby K., Li B., Daneshmand M., Hu, Y.M., A survey of transport protocols for wireless sensor networks, IEEE Network,2006, vol.20, no.3, pp.34-40.
[WTZ01]Wang H., Tian C., Zheng S.R., A Novel Method for Label Switching, International Conference on Communication Technology, WCC-ICCT 2000,21-25 Aug.2000, Vol.1, pp. 841-844.
[WW99]Wang Y.F., Wang Z., Explicit Routing algorithms for Internet traffic engineering, the 8th International Conference on Computer Communications and Networks,11-13 Oct.1999. pp. 582-588.
[WWHT07]Wang X.W., Wang Q., Huang M., Tian Y, A flexible intelligent QoS unicast routing scheme in NGI, ICIEA 2007:2007 Second IEEE Conference on Industrial Electronics and Applications,2007, pp.2371-2376.
[XCXQH06]Xu D.H., Chen Y, Xiong YZ, Qiao C.M, He X., On the Complexity of and Algorithms for Finding the Shortest Path With a Disjoint Counterpart, IEEE/ACM Transactions on Networking, Feb.2006, vol.14, no.1, pp.147-158.
[XN99]Xiao X.P., Ni L.M., Internet QoS:A big picture, IEEE Network,1999, vol.13, no.2, pp. 8-18.
[XOSC06]The Xich Open Source Community, Speex:A Free Codec for Free Speech. http://speex.org.
[XQGZ09a]熊轲(Xiong K.),裘正定(Qiu Z.D.),郭宇春(Guo Y.C.),张宏科(Zhang H.K.),基于端口编码的面向连接的快速转发方法,北京交通大学学报,2009,vol.33,no.5.
[XQGZ09b]Xiong K., Qiu Z.D., Guo Y.C., Zhang H.K., LIC-based Fast Forwarding towards Scalability, Simplicity, Flexibility and Security,2009 International Conference on Computer and Network Technology, ICCNT 2009, Jul.2009, pp.13-18.
[XQGZ09c]Xiong K., Qiu Z.D., Guo Y.C., Zhang H.K., Multi-constrained Shortest Disjoint Paths for Reliable QoS Routing, ETRI Journal,2009, vol.31, no.5, pp.534-544.
[XQGZ10]Xiong K., Qiu Z.D., Guo Y.C., Zhang H.K., Two Scalable LIC-Based Fast Forwarding Approaches For Explicit Routing, Journal of Internet Technology,2010.
[XQGZQ09]熊轲(Xiong K.),裘正定(Qiu Z.D.),郭宇春(Guo Y.C.),张宏科(Zhang H.K.),秦雅娟(QinY.J.),多约束最短链路分离路径精确算法,软件学报,2009. vol.20, no.12.
[XQZ08a]Xiong K., Qiu Z.D., Zhang H.K., Towards Link-disjoint paths under multiple additive QoS constraints, the 2nd IET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2008, pp.119-127.
[XQZ08b]Xiong K., Qiu Z.D., Zhang H.K., QoS State Information Aggregation for Inter-domain Routing, the 9th International Conference on Signal Processing Proceedings, ICSP,2008, vol.3, pp.1997-2001.
[XQZGZ10]Xiong K., Qiu Z.D., Zhang Y, Guo Y.C., Zhang H.K., End-to-End Delay Bound of Multimedia Stream in TNPOSS Network, Journal of Beijing Jiaotong University,2010, vol.34, no.2.
[XQZLC08]Xiong K., Qiu Z.D., Zhang H.K., Li C.S., Chao H.C., A Scalable Fast Forwarding Approach for IP Networks, International Journal of Internet Protocol Technology,2008, Vol.3, No.2,pp.119-127.
[XQZQZ09]Xiong K., Qiu Z.D., Zhang Y, Qin Y.J., Zhang H.K., A Math-ematical QoS Model for Multimedia Flows on the basis of Network Calculus, ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM 2009, Aug.7-9,2009, pp. 246-249.
[XQZZ09]熊轲(Xiong K.),裘正定(Qiu Z.D.),张煜(Zhang Y.),张宏科(Zhang H.K.),基于六元组的混合式QoS信息聚合算法,高技术通讯,vol.19, no.7, pp.686-692.
[XTX06]Xiao Y, Thulasiraman K., and Xue G. L., Constrained Shortest Link-Disjoint Paths Selection:A Network Programming Based Approach, IEEE Transactions on Circuits and Systems-I:Regular Papers, vol.53, no.5, May 2006, pp.1174-1187.
[Xu08]徐荣(Xu R.),面向IP的分组传送网发展思路,中兴通讯技术,2008年,第4期,pp.29-33.
[XWLN04]Xiao L., Wang J., Lui K.S., Nahrstedt K., Advertising interdomain QoS routing information, IEEE Journal on Selected Areas in Communications,2004, vol.22, no.10, pp. 1949-1964.
[XZQSQ10]Xiong K., Zhang Y, Qiu Z.D., Sun D.M., Qin Y.J., QoS-enhanced TNPOSS Network Model and its E2E Delay Bound for Multimedia Flows, Journal of Networks,2010.
[XZQWS09]Xiong K., Zhang Y., Qiu Z.D., Wang S.H., Sun D.M., Maximum E2E Delay of Multimedia Traffic in QTNPOSS Network, the 2nd International Symposium on Information Processing, the 2nd ISIP 2009, August,21-23,2009, pp.334-337.
[YA00]Yoneda S., Aoki T., Simple IP network based on QoS free concept,2000 IEEE International Conference on Communications,2000, ICC 2000, vol.2, pp.701-707.
[Yang08]杨晓光(Yang X.G.),数据结构实例教程,清华大学出版社,北京交通大学出版社,2008,12月,第1版.
[YCWZ08]Yu H., Chen J., Wang J.P., Zheng S.Q., High-performance TCAM-based IP lookup engines, Proceedings-IEEE INFOCOM,2008,2008 IEEE INFOCOM Workshops.
[YF03]Younis O., and Fahmy S., Constraint-based routing in the internet:Basic principles and recent research, IEEE Communication Survey & Tutorials,2003, vol.5, no.1.2003.
[YFH99]Yap M.T., Fong S., Hutchison D., Guaranteeing delay in ATM switches by using output port QoS controllers, Electronics Letters,1999, vol.35, no.23, pp.2002-2003.
[YLWZ09]杨冬(Yang D.),李世勇(Li S.Y.),王博(Wang B.),张宏科(Zhang H.K.),支持普适服务的新一代网络传输层构架,计算机学报,2009, vol.32, no.3, pp.359-370.
[YM00]Yazdani N., Min P.S., Fast and scalable schemes for the IP address lookup problem, Proceedings of IEEE ATM Workshop,2000, pp.83-92.
[Y.1291]International Telecommunication Union, LC-Text:Recommendation Y.1291-An architectural framework for support of quality of service (QoS) in packet networks.
[Y.1291s]International Telecommunication Union, LC-Summary:Recommendation Y.1291-An architectural framework for support of quality of service (QoS) in packet networks.
[Young89]Young J.W., Hierarchical network control, IEEE Global Telecommunications Conference and Exhibition, vol.2, pp.1197-1200.
[YQZ01]屈军锁(Qu J.S.),郑震铎(Zheng Z.D),三网合一技术的发展趋势,现代电信科技,2001年,第5期,pp.33-40.
[YYK00]Yamanaka N., Yamakoshi K., Kawano R., High-speed switch system for multimedia service nodes, NTT R and D,2000, vol.49, nol.12, pp.698-705.
[YWCCL06]Yang W.H., Wu C.S., Chen K.J., Lee S.S.W., Link failure protection by bifurcate algorithm in wavelength-routed WDM networks, WSEAS Transactions on Communications, 2006, vol.5, no.3, pp.405-410.
[ZC07]张连明(Zhang L.M.),陈志刚(Chen Z.G.)基于网络演算的GPS系统性能边界模型与分析,计算机工程,2007, vol.33, no.6, pp.30-32.
[ZCG01]张信明(Zhang X.M.),陈国良(Chen G.L.),顾钧(Gu J.),基于网络演算计算保证服务端到端延迟上界,软件学报,2001,第12卷,第6期,pp.889-893.
[ZCG02]张信明(Zhang X.M.),陈国良(Chen G.L.),顾钧(Gu J.),基于网络演算理论流量整形模型,软件学报,2002,第13卷,第2期,pp.2225-2230.
[ZDY08]张宏科(Zhang H.K.),董平(Dong P.),杨冬(Yang D.),新互联网体系理论及关键技术.中兴通讯技术,2008, vol.14, no.1, pp.17-20.
[ZG04]张继军(Zhang J.J.),高鹏(Gao P.),基于分组网的服务质量保证,北京邮电大学出版社,2004年5月.
[ZHC08]张连明(Zhang L.M.),黄大足(Huang D.Z.),陈志刚(Chen Z.G.),基于分形漏桶的长相
关业务端到端延时上界模型,通信学报,2008,第29卷,第7期,pp.32-43.
[ZHLL06]Zheng K., Hu C.C., Lu H.B., Liu B., A TCAM-based distributed parallel IP lookup scheme and performance analysis, IEEE/ACM Transactions on Networking,2006, vol.14, no. 4, pp.863-875.
[Zhu05]朱小龙(Zhu X.L.),实施MPLS/VPN联网的复杂问题,有线电视技术,2005, vol.12, no. 5, pp.16-19.
[ZHW08]Zhang, J.J., Han Y.B., Wang L.G., New topology aggregation mechanisms for delay-bandwidth sensitive networks,2008 11th IEEE Singapore International Conference on Communication Systems, ICCS 2008,2008, pp.737-742.
[ZNYL05]Zarifzaderh S., Nayyeri A.; Yazdani N.; Lucas C., ADAM:An adaptive model for state aggregation in hierarchical networks,2005 Asia-Pacific Conference on Communications, vol. 2005, pp.901-905.
[ZYD08]张宏科(Zhang H.K.),杨冬(Yang D.),董平(Dong P.),新互联网体系下的普适服务机理及关键技术,中兴通讯技术,2008,vol.14,no.1,pp.42-47.
[ZQM07]Zhang Y., Qiu X.S., Meng L.M., A Web services-based dynamically cooperative network management architectur, First International Conference on Communications and Networking in China, ChinaCom'06, Issue 2007.
[ZS07]张宏科(Zhang H.K.),苏伟(Su W.),新网络体系基础研究——一体化网络与普适服务,电子学报,2007,第35卷,第4期,pp.593-598.
[ZTC07]赵有健(Zhao Y.J.),张铁蕾(Zhang T.L.),崔勇(Cui Y),多约束服务质量路由中的路径压缩算法,计算机学报,2007, vol.30, no.12, pp.2090-2099.
[ZZLW06]张品(Zhang P.),张坚武(Zhang J.W.),李乐民(Li L.M.),王晟(Wang S.), QoS约束下的链路分离问题的研究,通信学报,2006,第27卷,第6期,pp.37-42.
[ZZ05]Zhang R.T., Zhu X.M., Fuzzy routing in QoS networks, Lecture Notes in Artificial Intelligence(Subseries of Lecture Notes in Computer Science), Proceedings of the Second International Conference on Fuzzy Systems and Knowledge Discovery:, FSKD 2005, vol.3614, no. PART Ⅱ, pp.880-890.
[ZZ09]Zhang F., Zhong W.D., Performance evaluation of optical multicast protection approaches for combined node and link failure recovery, Journal of Lightwave Technology,2009, vol.27, no.18, pp.4017-4025.
[AAMX03]Amitabha B., Amitabh C., Michael T.G, Xu S.H., Constructing Disjoint Paths for Secure Communication, Lecture Notes in Computer Science, Distributed Computing,2003, pp. 181-195.
[Ahmadi09]Ahmadi S., An overview of next-generation mobile WiMAX technology, IEEE Communication Magzine,2009, vol.47, no.6, pp.84-98.
[AKH09]Al-Kuwaiti M., Kyriakopoulos N., Hussein S., A comparative analysis of network dependability, fault-tolerance, reliability, security, and survivability, IEEE Communications Surveys and Tutorials,2009, vol.11, no.2, pp.106-124.
[Aoyama08]Aoyama T., A new generation network - beyond NGN, First ITU-T Kaleidoscope Academic Conference on Innovations in NGN:Future Network and Services, K-INGN 2008, 2008, pp.3-10.
[ASFRM08]Ayatollahi Z., Sarukhani S., Fayazi F., Roknabady Z.A., Madani A., Interoperability problems in Next Generation Network protocols, Innovations in NGN:First ITU-T Kaleidoscope Academic Conference Future Network and Services, K-INGN 2008,2008, pp. 161-168.
[Bala01]Bala K., Internetworking between the IP and optical layer, Optical Networks Magazine, 2001, vol.2, no.3, pp.16-18.
[Baran64]Baran P., On Distributed Communications, RANDMemorandum, A series of eleven papers for work started in 1961,1964, http://www.rand.org/publications/RM/baran.list.html.
[Bell01]Bell M.G.H., The measurement of reliability in stochastic transport networks, Proceedings of 2001 IEEE Intelligent Transportation Systems,2001, pp.1183-1188.
[BGLT08]Bouillard A., Optimal routing for end-to-end guarantees using Network Calculus, Gaujal B., Lagrange S., Thierry E., Performance Evaluation,2008, vol.65, no.11-12, pp.883-906.
[BGMRSS00]Breitbart Y, Garofalakis M., Martin C., Rastogi R., Seshadri S., Silberschatz A., Topology discovery in heterogeneous IP networks, Proceedings-IEEE INFOCOM,2000, vol. 1, pp.265-274.
[Bhandari94] Bhandari R., Optimal diverse routing in telecommunication fiber networks, Proc. INFOCOM'94, Jun.1994, vol.3, pp.1498-1508.
[BHMPPT90]Brander H., Howard J., Menicou G., Plagemann S., Protonotarios E.N., Theologou M.E., Quality of service in broadband communications, International Conference on Integrated Broadband Services and Networks,1990, pp.166-171.
[BKP03]Beker S., Kofman D., Puech N., Off-line reduced complexity layout design for MPLS networks,3rd IEEE Workshop on IP Operations & Management,2003, (IPOM 2003), pp. 95-105.
[BO06]Baldi M., Ofek Y., Multi-Terabit/s IP Switching with Guaranteed Service for Streaming Traffic,25th IEEE International Conference on Computer Communications, INFOCOM 2006, Apr.2006, pp.1-5.
[Bollobas01] Bollobas B., "Random Graphs," 2nd ed. Cambridge, MA:Cambridge Univ. Press, 2001.
[Boymel93]Boymel D., Network management systems face the forces of change, Ascom technical review,1993, no.1, pp.24-27.
[BPIMM01]Becchetti L., Priscoli F.D., Inzerilli T., Mahonen P., Munoz L., Enhancing IP service provision over heterogeneous wireless networks:A path toward 4G, IEEE Communications Magazine,2001, vol.39, no.8, pp.74-81.
[BR01]Benjamin S., Rubin I., MPLS+:A scalable label switching network, Conference Record/ IEEE Global Telecommunications Conference,2001, vol.1, pp.1-6.
[BRTAR09]BGP Routing Table Analysis Reports,2009, Http://bgp.potaroo.net/as2.0/bgpact-ive.html.
[BT04]BT, http://www.btplc.com/21cn/
[BV03]Begtaseviii F., Van Mieghem P., Measurements of the Hopcount in Internet, http://www.ripe. net/pam2001/Abstracts/poster_03.pdf.
[BWSS05]Bi Y., Wu J., Song M., Song J.D., Seamless mobility management with QoS guarantee for next-Generation IP-based heterogeneous network environments, Proceedings-6th World Wireless Congress, WWC,2005, p 501-506.
[BZ96]Bennett J.C.R., Zhang H., WF2Q:worst-case fair weighted fair queueing, Proceedings of IEEE Fifteenth Annual Joint Conference of the IEEE Computer Societies, Networking the Next Generation,INFOCOM'96,1996, vol.1, pp.120-128.
[CASMRS04]Chakraborty D., Ashir A., Suganuma T., Mansfield K.G., Roy T.K., Shiratori N., Self-similar and fractal nature of internet traffic, International Journal of Network Management, vol.14, Issue 2,2004, pp.119-129.
[CBBCFFHSSW02] Clark D.D., Bellovin S., Braden B., Chiappa N., Faber T., Falk A., Handley M., Shenker S., Sollins K., Wroclawski J., NewArch:A New Architecture for an Internet. Report to Next Generation Internet PI Meeting, Work In Progress,2002.
[CC97]Campbell A.T., Coulson G., QoS adaptive transports:delivering scalable media to the desktop, IEEE Network,1997, vol.11, no.2, pp.18-27.
[CCF07]China Computer Federation(中国计算机协会),中国计算机科学技术发展报告,2007：庆祝“973”计划实施十周年／中国计算机学会主编,2007.
[CDW00]Ghani N., Dixit S., Wang T.S., On IP over WDM integration, IEEE Communication Magazine,2000, vol.38, no.3, pp.72-84.
[CE99]Charles E.P. and Elizabeth M.R., Ad hoc On-Demand Distance Vector Routing, Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, Feb.1999, pp.90-100.
[Chang98]Chang C.S., On deterministic traffic regulation and service guarantees:a systematic approach by filtering, IEEE Transactions on Information Theory, vol.44, no.3, May 1998, pp. 1097-1110.
[CH07]Chang C.L., Hsu C.C., Twin-bit based fast IP lookup and update algorithm, Journal of Internet Technology,2007, vol.8, no.3, pp.351-357.
[CLRS01]Cormen T.H., Leiserson C.E., Rivest R.L., Stein C., Introduction to Algorithms, Second Edition, MIT Press, Cambridge, MA,2001.
[CMYP09]Chen X.Q., Makki K., Yen K., Pissinou N., Sensor network security:A survey, IEEE Communications Surveys and Tutorials,2009, vol.11, no.2, pp.52-73.
[CN98]Chen S.G., Nahrstedt K., An overview of quality of service routing for next-generation high-speed networks:problems and solutions, IEEE Network,1998, vol.12, no.6, pp.64-79.
[CNNIC09]中国互联网信息中心(CNNIC:China Internet Network Information Center),中国互联网络发展状况统计报告,Jul.2009, http://www.cnnic.cn/index/OE/00/11/index.htm.
[Crovella97] Crovella M.E., Self-similarity in WWW Traffic:Evidence and Possible Causes, IEEE Transactions on Networking, vol.5, no.6, Dec.1997, pp.835-45.
[Cruz91]Cruz R.L., A Calculus for Network Delay, part Ⅰ:Network Elements in Isolation, IEEE Trascations on Information Theory, vol.17, no.1,1991, pp.114-131.
[Cruz91a]Cruz R.L., A Calculus for Network Delay, part Ⅱ:Network Analysis, IEEE Trascations on Information Theory, vol.17, no.1,1991, pp.132-141.
[CSTN03]China Science & Technology Network, http://www.cstnet.net.cn/cngi.jsp?Type=jianjie
[CV04]Chen D.Z., Varshney P,K., QoS support in wireless sensor networks:A survey, Proceedings of the International Conference on Wireless Networks, ICWN'04,2004, vol.1, pp.227-233.
[CW03]Christiansen H., Wessing H., Modeling GMPLS and optical MPLS networks, Proceedings of the 10th International Conference on Telecommunications,2003, ICT 2003, vol.1, pp. 288-294.
[CWKS97]Crow B.P., Widjaja I., Kim L.G., Sakai P.T., IEEE 802.11 Wireless Local Area Networks, IEEE Communications Magazine,1997, vol.35, no.9, pp.116-126.
[CXW03]Cui Y., Xu K., Wu J.P., precomputation for multi-constrained QoS routing in high-speed networks, proceedings of the IEEE INFOCOM'03,2003, pp.1414-1424.
[Davies65]Davies D., Packet Switching Proposal, Proposal and Prototype Implementation at UK National Physical Laboratories. Proposal and Prototype Implementation of packet-switching concepts,1965.
[DDRK98]David B.S., Doolan P. Rekhter Y, Kaufmann M., Switching in IP Networks:IP Switching, Tag Switching & Related Technologies, Baker & Taylor Books,1998.
[Dong07]董平(Dong P.),基于身份与位置分离映射的可扩展路由体系研究,北京交通大学博士论文,2007.
[DQZ08]董平(Dong P.),秦雅娟(QinY.J.),张宏科(Zhang H.K.).支持普适服务的一体化网络研究.电子学报,Vol.35, No.4,2007, pp.599-606.
[DR00]Davie B. and Rekhter Y., MPLS:Technology and Applications, Morgan Kaufmann Publishers,2000.
[DYY06]Deng Y.P., Yin K., Yu L., High Speed IP Routing Lookup Algorithm Based on RAM and TCAM Communications, International Conference on Circuits and Systems, Jun.2006, vol.3, pp.1677-1680.
[DV00]De Nevea H., Van Mieghem P., TAMCRA:a tunable accuracy multiple constraints routing algorithm, Computer Communications, vol.23,2000, pp.667-679.
[Eilam-Tzoreff98] Eilam-Tzoreff T., Disjoint shortest paths problem, Discrete Applied Mathematics, 1998, vol.85, nol.2, pp.113-138.
[EJLW01]Elwalid A., Jin C., Low S., Widjaja I., MATE:MPLS adaptive traffic engineering,20th
Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2001, Vol.3,2001, pp.1300-1309.
[ER98]Explicit Routing, http://www.juniper.net/techpubs/software/erx/junose52/swconfig-routing-vol2/html/mpls-config8.html, Juniper Networks, copyright,1998-2009.
[Etemad08]Etemad K., Overview of mobile WiMAX technology and evolution, IEEE Communications Magazine,2008, vol.46, no.10, pp.31-40.
[EY03]Ethan R., Yong S., WFQ:Weighted Fairness Queuing, http://nislab.bu.edu/sc546/sc441 Spring2003/wfq/index.htm
[Feng07]Feng G., The revisit of QoS routing based on non-linear Lagrange relaxation, International Journal of Communication Systems,2007, vol.20, no.1, pp.9-22.
[Feng08]Feng J., A special issue on advances in new generation Internet architecture research. Science in China Series F:Information Sciences, Public release date:Oct.22,2008.
[FPR08]Fgee E.B., Phillips W.J., Robertson W., Comparison between a Proposed QoS Mathematical Model and other IP QoS Models,6th Annual Communication Networks and Services Research Conference, CNSR'08, May 2008, pp.595-599.
[FPRES08]Fgee E.B., Phillips W.J., Robertson W., Elhounie A., Smeda A., the 3rd International Conference on Information and Communication Technologies:From Theory to Applications, ICTTA 2008, Apr.2008, pp.1-5.
[GC09]葛振斌(Ge Z.B.),陈辉(Chen H.),2009年光网络发展趋势展望,光电新闻网,通信世界,http://fiber.ofweek.com/2009-01/ART-210005-8400-26772001.html
[GG02]Garcia, L.E., Garijo M., Scalability Issues in the Configuration of Traditional ATM, PNNI ATM and MPLS Based Services, Journal of The Communications Network,2002, vol.1, no.2, pp.24-31.
[GJ79]Garey M.R. and Johnson D.S., Computers and Intractability:A Guide to the Theory of NP-completeness, San Francisco, CA:Freeman,1979.
[GKV03]Guo Y.C., Kuipers F.A., Van Mieghem P., A Link disjoint paths algorithm for reliable QoS routing, International Journal of Communication Systems,2003, vol.16, no.9, pp.779-798.
[GKVC05]郭宇春(Guo Y.C.), Kuipers F., Van Mieghem P.陈常嘉(Chen C.J.),多约束分离路径算法,铁道学报,2005, vol.27, no.2, pp.49-57.
[GN07]Gong M. and Naser H., Diverse delay-constrained restoration schemes, Optical Fiber Communication and the National Fiber Optic Engineers Conference, OFC/NFOEC 2007, pp. 1-12.
[GSM07]Gewali L., Selvaraj H., Mazzella D., Constrained Disjoint Paths in Geometric Network, International Conference on Computational Intelligence and Multimedia Applications,13-15, Dec.2007, Vol.2, pp. xxiii-xxiii.
[Gubbins05] Gubbins, Ed, MPLS moved downstream, Telephony,2005, vol.246, no.17, pp.24-26.
[Guo07]郭宇春(Guo Y.C.),因特网拓扑特征推断与建模,北京交通大学博士论文,2007,pp.123-138.
[GYL04]Guo L., Yu H.F., Li L.M., Double-link failure protection algorithm for shared sub-path in survivable WDM mesh networks, Chinese Optics Letters,2004, vol.2, no.7, pp.379-382.
[HDD08]Htira W., Dugeon O., Diaz M., A novel bandwidth broker architecture based on topology aggregation in delay bandwidth sensitive networks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), NETWORKING 2008:AdHoc and Sensor Networks, Wireless Networks, Next Generation Internet-7th International IFIP-TC6 Networking Conference, Proceedings, LNCS 2008, vol.4982, pp.482-493.
[HDX07]Huang L., Du X.W., Xiao J., Multi-constrained routing based on tabu search,2007 IEEE International Conference on Control and Automation, ICCA2007, pp.157-161.
[Henig86]Henig M.I., The shortest path problem with two objective functions, European Journal of Operational Research, Vol.25, no.2,1986, pp.281-291.
[Hinde98]Hinde S., Recent security surveys, Computers and Security,1998, vol.17, no.3, pp. 207-210.
[HKK02]Huang L., Kumar S., Kuo C.C.J., Quality of service provisioning for multimedia services in next-generation wireless networks, Proceedings of SPIE-The International Society for Optical Engineering,2002, vol.4861, pp.153-162.
[HL96]Heyman D.P. and Lakshman T.V., What are the Implications of Long-Range Dependence for VBR-Video Traffic Engineering, IEEE/ACM Transctions on Networking, vol.4, no.3, June 1996, pp.301-17.
[HR08]He J.Y., Rexford J., Toward Internet-Wide Multipath Routing, IEEE Network,2008, vol.22, no.2, pp.16-21.
[HS06]Hou R.H., Shi H.S., A localized algorithm for finding disjoint paths in wireless sensor networks, IEEE Communications Letters,2006, vol.10, no.12, pp.807-809.
[HWLW07]Hu C.H., Wu M., Liu G.P., Wang S.C., Hybrid scheduling model and analysis of performance for switched industrial Ethernet, Journal of Central South University of Technology, vol.14, no.2,2007, pp.271-277.
[HYWLL09]Hwang T., Yang C.Y, Wu G., Li S.Q., Li G., OFDM and its wireless applications:A survey, IEEE Transactions on Vehicular Technology,2009, vol.58, no.4, pp.1673-1694.
[HZ00]Hao F., Zegura E. W., On Scalable QoS Routing:Performance Evaluation of Topology Aggregation, INFOCOM,2000, pp.147-156.
[IAB06]The IAB Routing and Addressing Workshop report,2006, http://www.iab.org/about/work-shops/routingandaddressing/index.html
[ICT08]Information & Communication Technologies, Future Internet Research and Experiment-ation, http://cordis.europa.eu/fp7/ict/fire/
[ISC08]Internet Systems Consortium, https://www.isc.org/solutions/survey/history,2009.
[Jeon04]Jeon S.E., Topology aggregation method for multiple link parameters, IEEE GLOBECOM 2004. vol.3, pp.1378-1382.
[Jiang06b]Jiang Y.M., Delay bound and packet scale rate guarantee for some expedited forwarding networks, Computer Networks, Vol.50, no.1,2006, pp.15-28.
[Jiang06a]Jiang Y.M., A basic stochastic network calculus, Computer Communication Review,2006, vol.36, no.4, pp.123-134.
[JM96]Johnson D.B. and Maltz D.A., Dynamic Source Routing in Ad Hoc Wireless Networks, In Mobile Computing, Kluwer Academic Publishers, Chapter 5, pp.153-181,1996.
[JWP09]Jin J., Wang W.H., Palaniswami M., Utility max-min fair resource allocation for communication networks with multipath routing, Computer Communications,2009, vol.32, no.
17, pp.1802-1809.
[KC00]Ke, Y.K., Copeland J.A., Scalability of routing advertisement for QoS routing in an IP network with guaranteed QoS, IEEE Global Telecommunications Conference,2000, vol.1, pp. 605-610.
[KH04]Kim H., Hou J.C.,Network calculus based simulation for TCP congestion control:Theorems, implementation and evaluation, IEEE INFOCOM 2004-Conference on Computer Communications-Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies,2004, vol.4, pp.2844-2855.
[KK00]Korkmaz T., Krunz M., Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks, ACM Trans. Modeling Computer Simulation,2000, vol.10, no.4, pp. 295-325.
[KK77]Kleinrock L., Kamoun F., Hierarchical routing for large networks:Performance evaluation and optimization, Computer Network, vol.1, no.3, Jan.1977, pp.155-174.
[KL07]Kodialam M., Lakshman T.V., A Scalable Approach to Building Fast Switches using Slow Schedulers, Workshop on High Performance Switching and Routing,2007, HPSR'07,1 Jun., 2007, pp.1-6.
[Kleinrock61] Kleinrock L., Information Flow in Large Communication Nets,. MIT Proposal for PhD Thesis, Mar.1961, http://www.lk.cs.ucla.edu/LK/Bib/REPORT/PhD/.
[KM04]Kuurne A., Miettinen A.P., Weighted round robin scheduling strategies in (E)GPRS radio interface,2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall:Wireless Technologies for Global Security,2004, vol.60, no.5, pp.3155-3159.
[Kolic04]Kolic R., An introduction to Ultra Wideband (UWB) wireless, Feb.,2004, http://www. deviceforge.com/articles/AT8171287040.html.
[KT91]Koivo H.N., Tanttu J.T., Tuning of PID controllers:Survey of SISO and MIMO techniques, IFAC Symposia Series,1991, no.7, pp.75-80.
[Kuipers00] http://www.nas.ewi.tudelft.nl/people/Fernando/software.html
[KV03]Kuipers F.A. and Van Mieghem P., The impact of correlated link weights on QoS routing, Proceedings of IEEE INFOCOM'03, vol.2,2003, pp.1425-1434.
[LB06]Luo Y.J., Bai Y.C., Scalable topology aggregation algorithm for QoS routing in hierarchical networks, Journal of Southeast University (English Edition),2003, vol.19, no.4, pp.331-335.
[LBL07]Li C.Z., Burchard A., Liebeherr J., A network calculus with effective bandwidth, IEEE/ACM Transactions on Networking,2007, vol.15, no.6, pp.1442-1453.
[LC03]Le boudec J.Y., Charny A., Packet Scale Rate Guarantee for Non-FIFO Nodes, IEEE/ACM Transactions on Networking, vol.11, no.5,2003, pp.810-820.
[LC06]Leu S., Chang R.S., A fast and scalable IPv4 and 6 address lookup algorithm, Computer Communications,2006, vol.29, no.16, pp.3020-3036.
[LCKL08]Lee H., Choi G., Kim H., Lee K., A nature-inspired QoS routing algorithm for next generation networks, Proceedings-4th International Conference on Autonomic and Autonomous Systems, ICAS 2008, pp.226-232.
[Le02]Le boudec J.Y., Some Properties Of Variable Length Packet Shapers, ACM/IEEE Transac-tions on Networking,2002, Vol.10, Issue 3, pp.329-337.
[Lee95]Lee W.C., Topology aggregation for hierarchical routing in ATM networks, Computer Communication Review,1995, vol.25, no.2, pp.85-92.
[LG01]Lee S.J., Gerla M., Split multipath routing with maximally disjoint paths in ad hoc networks, IEEE International Conference on Communications,2001, ICC 2001, vol.10, pp.3201-3205.
[LGZ07]李昭桦(Li Z.H.),郜帅(Gao S.),张宏科(Zhang H.K.), IEEE802.15.4网络的IPv6报头压缩研究,北京交通大学学报,2007, vol.31, no.5, pp.63-66.
[LHXY07]陆慧梅(Lu H.M.),胡虹雨(Hu H.Y.),向勇(XiangY.),阎永航(Yan Y.H.),基于延时—带宽约束的新型层次拓扑聚集算法,通信学报,2007, vol.28, no.3, pp.93-99.
[Lin09]林闯(Lin C.),《新一代互联网体系结构》专辑前言,计算机学报,vol.32, no.3.
[LL06]Li S.S.S., Lui K.S.,2-Line Segment Topology Aggregation Mechanism for QoS Routing, IEEE Region 10 Annual International Conference,14-17 Nov.2006, pp.1-4.
[LL07]林闯(Lin C.),雷蕾(Lei L.),下一代互联网体系结构研究,计算机学报,2007,vol.30,no.5,pp.693-711.
[LLJ06]刘爱波(Liu A.B.),陆月明(Lu Y.M.),纪越峰(Ji Y.F.),基于非对称有向网络的拓扑抽象算法研究,电子学报,2006,第34卷,第1期,pp.180-184.
[LNC04]Lui K.S., Nahrstedt K., Chen S.G., Routing with Topology Aggregation in Delay-Bandwidth Senstive Networks, IEEE/ACM Transctions on Networking, Vol.12, No.1, Feb.2004, pp.17-29.
[LT04]Le Boudec J.Y, Thiran P., Network Calculus, Berlin:Springer Verlag, Version May 10,2004.
[LTWW94]Leland W.E., Taqqu M.S., Willinger W., Wilson D.V., On the self-similar nature of Ethernet traffic, IEEE/ACM Transctions on Networking, Vol.2, No.1,1994, pp.1-15.
[LWR08]林闯(Li C.),王元卓(WangY.Z.),任丰原(Ren F.Y.),新一代网络QoS研究,下一代互联网体系结构研究,计算机学报,2008, vol.31, no.9, pp.1525-1535.
[LZM07]Li Z.Q., Zheng D.Q., Ma Y, Tree, Segment Table, and Route Bucket:A Multi-Stage Algorithm for IPv6 Routing Table Lookup, IEEE International Conference on Computer Communications, INFOCOM, May.2007, pp.2426-2430.
[Ma05]马娅婕(Ma Y.J.), MPLS网络拓扑聚集算法的研究,华中科技大学博士学位论文,2005.
[Marciniak08] Marciniak M., Future Networks-beyond Next Generation Networking,10th Anniversary International Conference on Transparent Optical Networks, ICTON 2008,2008, vol.1, pp.25-28.
[MBF07]Metz C., Barth C., Filsfils C., Beyond MPLS...Less Is More, IEEE Internet Computing, 2007, vol.11, no.5, pp.72-76.
[MHZ09]Mellouk A., Hoceini S., Zeadally S., Design and performance analysis of an inductive QoS routing algorithm, Computer Communications, Computer Communications on Heterogeneous Networking for Quality, Reliability, Security and Robustness-Part Ⅱ,2009, vol. 32, no.12, pp.1371-1376.
[MIP08]Marwaha S., Indulska J., Portmann M., Challenges and recent advances in QoS provisioning, signaling, routing and MAC protocols for MANETs, Proceedings of the 2008 Australasian Telecommunication Networks and Applications Conference, ATNAC 2008,2008, pp.97-102.
[MLG03]Mohapatra P., Li J., Gui C., QoS in mobile ad hoc networks Source:IEEE Wireless Communications, June 2003, vol.10, no.3, pp.44-52.
[MM07]Minei I., Marques P.R., Scalability Considerations in BGP/MPLS IP VPNs, IEEE Communications Magazine, Apr.2007, vol.45, no.4, pp.26-31.
[MMSDO06]Marin-Tordera E., Masip-Bruin X., Sanchez-Lopez S., Domingo-Pascual J., Orda A., The prediction approach in QoS routing, IEEE International Conference on Communications, ICC 2006, vol.3, pp.1020-1025.
[Morin95]Morin P.R., The Impact of Self-Similarity on Network Performance Analysis, Ph.D. dissertation, Carleton Univ., Dec.1995.
[MS05]Mo L., Sandrasegaran K., Network management challenges for next generation networks, Proceedings of The IEEE Conference on Local Computer Networks,30th Anniversary, LCN 2005, pp.593-598.
[MXLL08]马建国(Ma J.G.),席明贤(Xi X.M.),林益民(Lin Y.M.),李幼平(Li Y.P.),中国Internet路由级跳数测量与分析,计算机应用研究,2008, vol.25, no.7. pp.37-42.
[MY06]Mario B., Yoram O., Multi-Terabit/s IP Switching with Guaranteed Service for Streaming Traffic,25th IEEE International Conference on Computer Communications, INFOCOM'06, Apr.2006, pp.1-5.
[MYDFCe05]Masip-Bruin X.,Yannuzzi M., Domingo-Pascual J., Fonte A., Curado M., et al., Research challenges in QoS routing, Computer Communications,2006, vol.29, no.5, p 563-581.
[MZT05]Ma Y.J., Zhang G.X., Tian X.C., A new topology aggregation scheme for scalable MPLS networks, Proceedings of SPIE-The International Society for Optical Engineering Network Architectures, Management, and Applications Ⅲ, vol.6022 Ⅱ,2005.
[MZZ08]马震远,周杰,张凌,基于隧道的全球可扩展IP-Anycast实现方法,华南理工大学学报,2008, vol.36, no.4, pp.75-79,103.
[Nagle87]Nagle J., On packet switches with infinite storage, IEEE Transactions on Communications, 1987, vol. COM-35, no.4.
[Nasser09]Nasser N., Service adaptability in multimedia wireless networks, IEEE Transactions on Multimedia,2009, vol.11, nol.4, pp.786-792.
[ND08]Naraghi-Pour M., Desai V, Loop-free traffic engineering with path protection in MPLS VPNs, Computer Networks,2008, vol.52, no.12, pp.2360-2372.
[NG07]Naser H. and Gong M., Link-Disjoint Shortest-Delay Path-Pair Computation Algorithms for Shared Mesh Restoration Networks,12th IEEE Symposium on Computers and Communications,2007, ISCC 2007, pp.269-274.
[NML98]Newman P., Minshall G., and Lyon T.L., IP Switching-ATM Under IP, IEEE/ACM Transactions on Networking,1998, vol.6, no.2, pp.117-129.
[NSF08]National Science Foundation, Future Internet Design, http://find.isi.edu/
[NSF09]National Science Foundation, Global Environment for Network Innovations, http://www. geni.net/?page_id=2
[NS2]The Network Simulator-ns-2, http://ww.isi.edu/nsnam/ns/.
[OMHC05]Okumus I.T., Mantar H.A., Hwang J., Chapin S.J., Inter-domain QoS routing on Diffserv networks:A region-based approach, Computer Communications,2005, vol.28, no.2, pp. 174-188.
[Orda05]Orda A., QoS routing:Challenges and solution approaches, Second International Confe-rence on Quality of Service in Heterogeneous Wired/Wireless Networks, Qshine 2005,2005.
[OS89]Oqier R., Shacham N., Distributed algorithm for finding shortest pairs of disjoint paths, Proceedings of INFOCOM'89,1989, pp.173-182.
[OS00]Orda A., Sprintson A., QoS Routing:The Precomputation Perspective, IEEE Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2000, Mar.2000, vol 1, pp.128-136.
[OS03]Orda A., Sprintson A., Precomputation schemes for QoS routing, IEEE/ACM Transactions on Networking, vol 11, no.4,2003, pp.578-591.
[OSMY03]Oki E., Matsuura N., Shiomoto K., Yamanaka N., A disjoint path selection scheme with shared risk link group constraints in GMPLS networks, IEICE Transactions on Communications,2003, vol. E86-B, no.8, pp.2455-2462.
[Pavlou06]Pavlou G., Traffic engineering and quality of service management for IP-based NGNs, 10th IEEE/IFIP Symposium Record on Network Operations and Management Symposium, 2006, pp.589.
[PB94]Perkins C.E., Bhagwat P., Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, ACM SIGCOMM Computer Communication Review,1994, vol.24, no.4, pp.234-244.
[PG93]Parekh A.K., Gallager R.G., A generalized processor sharing approach to flow control in integrated service networks:The single node case, IEEE/ACM Transactions on Networking, Vol. 1.no.3,1993, pp.344-357.
[PG94]Parekh A.K., Gallager R.G., A generalized processor sharing approach to flow control in integrated service networks:The multiple node case, IEEE/ACM Transactions on Networking, Vol.2, no.2,1994, pp.137-150.
[PGGS02]Procissi G., Garg A., Gerla M., Sanadidi M.Y., Token bucket characterization of long-range dependent traffic, Computer Communications, vol.25, no.11-12,2002, pp. 1009-1017.
[PKC96]Park K., Kim G., and Crovella M., On the Relation Between File Sizes, Transport Protocols, and Self-similar Network Traffic, Proceedings of IEEE International Conference on Network Protocols, Oct.1996, pp.171-80.
[PS06]Peng C., Shen H., An Improved Approximation Algorithm for Computing Disjoint QoS Paths, International Conference on Networking, International Conference on Systems andInternational Conference on Mobile Communications and Learning Technologies ICNICONSMCL,23 Apr. 2006, pp.10.
[QCZ08]Qi H.M., Chen Z.G., Zhang L.M., Towards end-to-end delay bounds on WMNs based on statistical network calculus, the 9th International Conference for Young Computer Scientists, ICYCS 2008, Nov.2008, pp.493-497.
[QGL08]钱华林(Qian H.L.),葛敬国(Ge J.G.),李俊(Li J.),层次交换网络体系结构,清华大学出版社,2008.11月,第一版.
[Qi05]齐小刚,训‘算机网络中的路由与性能优化,西安电子科技大学博士学位论文,Au更2005.
[RBT08]Rawat P., Bonnin J.M., Toutain L., Designing a tunneling header compression (TuCP) for tunneling over IP, Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems, ISWCS'08,2008, pp.273-278.
[RC07]Raman B., Chebrolu K., Experiences in using Wi-Fi for rural internet in India, IEEE Communications Magazine,2007, vol.45, no.1, pp.104-110.
[RFC793]Information Sciences Institute University of Southern California, Transmission Control Protocol, RFC 793.
[RFC1105]Lougheed K., Rekhter Y., A Border Gateway Protocol (BGP), June 1989.
[RFC1180]Socolofsky T., Kale C., TCP/IP tutorial, RFC 1180, Jan.1991.
[RFC1269]Willis S., Burruss J., Definitions of Managed Objects for the Border Gateway Protocol (Version 3), RFC 1269, Oct.1991.
[RFC 1518]Rekhter Y., Li T., An Architecture for IP Address Allocation with CIDR, RFC 1519, Sep. 1993.
[RFC1519]Fuller V., Li T., Yu J., Classless Inter-Domain Routing (CIDR):an Address Assignment and Aggregation Strategy, RFC 1519, Sep.1993.
[RFC1606]Onions J. A Historical Perspective On The Usage Of IP Version 9, RFC 1606, Apr.1994.
[RFC1633]Braden R., Clark D., Shenker S., Integrated Services in the Internet Architecture-an Overview. RFC 1633, Jun.1994.
[RFC1721]Malkin G., RIP Version 2 Protocol Analysis, RFC 1721, Nov.1994.
[RFC1772]Rekhter Y. and P. Gross, Application of the Border Gateway Protocol in the Internet, RFC 1772, March 1995.
[RFC1817]Rekhter Y., CIDR and Classful Routing, RFC 1817,Aug.1995.
[RFC1883]Deering S., Hinden R., Internet Protocol, Version 6 (IPv6) Specification", RFC 1883, Dec.1995.
[RFC 1884]Hinden R., Deering S., IP Version 6 Addressing Architecture, RFC 1884, Dec.1995.
[RFC 1887]Rekhter Y., Li T., An Architecture for IPv6 Unicast Address Allocation", RFC 1887, Dec. 1995.
[RFC2216]Shenker S., Wroclawski J., Network Element Service Specification Template, RFC 2216, Sep.1997.
[RFC2328]Moy J., OSPF Version 2, Apr.1998.
[RFC2791]Yu J., Scalable Routing Design Principles, Network Working Group, Request for Comments, RFC 2791,2000.
[RFC3031]Rosen E., Viswanathan A., Callon R., Multiprotocol Label Switching Architecture, RFC 3031, Jan.2001.
[RFC3550]Schulzrine H., Casner S., Frederick R., Jacobson V., RTP:A Transport Protocol for Real-Time Applications, RFC 3550, Jul.2003.
[RFC3561]Charles E.P., Elizabeth M.B., Samir D., Ad Hoc On Demand Distance Vector (AODV) Routing, IETF RFC 3561, July,2003.
[RFC3814]Nadeau T., Srinivasan C., Viswanathan A., Multiprotocol Label Switching (MPLS) Forwarding Equivalence Class To Next Hop Label Forwarding Entry (FEC-To-NHLFE) Management Information Base (MIB), RFC 3814, June 2004.
[RFC3945]Mannie E., Generalized Multi-Protocol Label Switching (GMPLS) Architecture, RFC 3945, Oct.2004.
[RFC3984]Weger S., Hannuksela M.M., Stockhammer T., Westerlund M., Singer D., RTP Payload Format for H.264 Video, RFC 3984, Feb.2005.
[RFC4216]Zhang R., Vasseur J.P., MPLS Inter-Autonomous System (AS) Traffic Engineering (TE) Requirements, RFC 4216, Nov.2005.
[RFC4271]Rekhter Y., Li T., A Border Gateway Protocol 4 (BGP-4), RFC 4271, Jan.2006.
[RFC4278]Johnson D., Hu Y., Maltz D., The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4, RFC4278, Feb.2007.
[RFC4632]Fuller V., Li T., Classless Inter-domain Routing (CIDR):The Internet Address Assignment and Aggregation Plan, RFC 4632, Aug.2006.
[RFC4984]Meyer D., Zhang L., Fall K., Report from the IAB Workshop on routing and addressing, RFC 4984, Sep.2007.
[RMB05]Ravikumar V.C., Mahapatra R.N., Bhuyan L.N., EaseCAM:An energy and storage efficient TCAM-based router architecture for IP lookup, IEEE Transactions on Computers, 2005, vol.54, no.5, pp.521-533.
[RRG07]http://rr-fs.caida.org/
[RPT96]Raghavan S.V., Prabhakaran B., Tripathi S.K., Handling QoS negotiations in orchestrated multimedia presentations, Journal of High Speed Networks,1996, vol.5, no.3, pp.277-292.
[SFAS05]Sangireddy R., Futamura N., Aluru S., Somani A.K., Scalable, memory efficient, high-speed IP lookup algorithms, IEEE/ACM Transactions on Networking,2005, vol.13, no.4, pp.802-812.
[SFM05]Solano F., Fabregat R., Marzo J.L., Full Label Space Reduction in MPLS Networks: Asymmetric Merged Tunneling, IEEE Communications Letters, vol.9, no.11, Nov.2005, pp.1021-1023.
[SGPSBB07]Siekkinen M., Goebel V., Plagemann T., Skevik K.A., Banfield M., Brusic I., Beyond the future internet-Requirements of autonomic networking architectures to address long term future networking challenges, Proceedings of the IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems, FTDCS 2007, pp.89-98.
[Shen03]沈鑫剡(Shen X.Y.), IP交换网原理、技术及实现,人民邮电出版社,2003.
[Sherrington07] Sherrington s., MPLS:Metro a No-Go?, http://www.lightreading.com/document.asp? doc_id=134968
[SHZY08]Sun Q., Huang X.H., Zhou X.J., Yan M., A dynamic binary hash scheme for ipv6 lookup, IEEE Global Telecommunications Conference, GLOBECOM 2008, pp.2324-2328.
[Simon04]Simon S., Back to the Future Part 4:The Internet, ACM SIGCOMM 2004, Keynote Speech,2004.
[SK08]Shin M.K., Kim Y.W., New challenges on future network and standardization, Proceedings of the 10th International Conference on Advanced Communication Technology, ICACT 2008, 2008, vol.1, pp.745-759.
[SLJ02]Science Links Japan, http://sciencelinks.jp/j-east/article/200321/000020032103A0697130. php
[SSBPKG07]Sheikh W., Shafiq B., Baqai S., Paul R.A. Khan M.F., Ghafoor H., A QoS framework for multimedia applications in mobile ad hoc networks, Computer Systems Science and Engineering,2007, vol.22, no.3, pp.165-173.
[ST84]Suurballe J.W., Tarjan R.E., A quick Method for Finding Shortest Pairs of Disjoint Paths, Networks, vol.14, no.2,1984, pp.325-333.
[ST99]Sahinoglu Z. and Tekinay S., On Multimedia Networks:Self-similar Traffic and Network Performance, IEEE Communication Megzine, vol.37, no.1,1999, pp.48-52.
[Suurballe74] Suurballe J.W., Disjoint paths in a network, Networks, vol.4, no.2,1974, pp. 125-145.
[SYOM07]Sprintson A., Yannuzzi M., Orda A., Masip-Bruin X., Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks,26th IEEE International Conference on Computer Communications, IEEE INFOCOM,6-12 May.2007, pp.1820-1828.
[SV95]Shreedhar M., Varghese G., Efficient fair queueing using deficit round robin, ACM SIGCOMM Computer Communication Review,1995, vol.25, no.4. pp.231.
[SVM09]Srivastava S., Van de L.A., Medhi D., Traffic engineering of MPLS backbone networks in the presence of heterogeneous streams, Computer Networks,2009, vol.53, no.15, pp. 2688-2702.
[SZF08]Schmitt J.B., Zdarsky F.A., Fidler M., Delay bounds under arbitrary multiplexing:When network calculus leaves you in the lurch,2008, Proceedings-27th IEEE Communications Society Conference on Computer Communications, INFOCOM,2008, pp.2342-2350.
[Talbot05]Talbot D., The Internet is Broken, Technology Review, Dec.2005.
[Teixeira03] Teixeira R., In search of path diversity in ISP networks, Proceedings of the ACM SIGCOMM Internet Measurement Conference 2003, IMC 2003, pp.313-318.
[TC04]Tang Y., Chen S..G,. QoS information approximation for aggregated networks, IEEE International Conference on Communications, Paris, France,2004, pp.2107-2111.
[TC07]Tang Y., Chen S.G., Ling Y.B., State aggregation of large network domains, Computer Communications,2007, vol.30, no.4, pp.873-885.
[TL07]Tizghadam A., Leon-Garcia A., LSP and back up path setup in MPLS networks based on path criticality index,2007 IEEE International Conference on Communications, ICC'07, pp. 441-448.
[TLUN07]Tam W.Y, Lui K.S., Uludag S., Nahrstedt K, Quality-of-Service routing with path information aggregation, Computer Networks,2007, vol.51, no.12, pp.3574-3594.
[TMF04]Tacca M., Monti P., Fumagalli A., The disjoint path-pair matrix approach for online routing in reliable WDM networks,2004 IEEE International Conference on Communications, 2004, vol.2, pp.1187-1191.
[TMSV03]Teixeira R.; Marzullo K., Savage S., Voelker G.M., Characterizing and Measuring Path Diversity of Internet Topologies, Performance Evaluation Review, International Conference on Measurement and Modeling of Computer Systems, ACM SIGMETRICS 2003, Jun.2003, vol. 21, no.1, pp.304-305.
[Towela00]Towela N.J., Impact of Traffic Aggregation on Network Capacity and Quality of Service, University of Kansas, http://www.ittc.ukans.edu. Feb.2000.
[ULNB07]Uludag S., Lui K.S., Nahrstedt K., Brewster G., Analysis of Topology Aggregation Techniques for QoS Routing, ACM Computing Surveys,2007, vol.39, No.3, Article 7.
[VDK01]Van Mieghem P., De Nevea H., Kuipers F.A., Hop by hop quality of service routing, Computer Networks, vol.37,2001, pp.407-423.
[Van01]Van Mieghem P., Paths in the simple random graph and the Waxman graph, Probability in the Engineering and Informational Sciences, vol.15,2001, pp.535-555.
[VK99]Veeraraghavan M., Karol M., Internetworking connectionless and connection-oriented networks, IEEE Communications Magazine,1999, vol.37, no.12, pp.130-138.
[VK03]Van Mieghem P., Kuipers F.A., On the complexity of QoS routing, Computer Communications, Mar.2003, vol.26, no.4, pp.376-387.
[VK04]Van Mieghem P. and Kuipers F.A., Concepts of Exact QoS Routing Algorithms, IEEE/ACM TRANSACTIONS ON NETWORKING, Oct.2004, vol.12, no.5, pp.851-863.
[VKK03]Van Mieghem P., Kuipers F.A., Korkmaz T., et al., Quality of Service Routing, Chapter 3 in Quality of Future Intern Services, EU-COST 263 Final Report, in Springer LNCS 2856, 2003, pp.80-117.
[WC96]Wang Z. and Crowcroft J., Quality-of-service routing for supporting multimedia applications, IEEE Journal on Selected Areas in Communications, Sept.1996, vol.14, no.7, pp. 1228-1234.
[WCL05]Wuu L.C., Chen K.M., Liu T.J., A longest prefix first search tree for IP lookup, IEEE International Conference on Communications, ICC 2005,2005, vol.2, pp.989-993.
[Welcher00] Welcher P.J., Introduction to MPLS, http://www.netcraftsmen.net/welcher/papers/ mplsin-tro.html,2000.
[WHPH08]Wang N., Ho K.H., Pavlou G., Howarth, M., An overview of routing optimization for internet traffic engineering, IEEE Communications Surveys & Tutorials,2008, vol.10, no.l, pp.36-56.
[Wikipedia08] Wikipedia, http://en.wikipedia.org/wiki/List_of_countries_by_number_of_Internet_hosts.
[WLX08]Wang Y., Li L.M., Xu D., Pervasive QoS routing in next generation networks, Computer Communications,2008, vol.31, no.14, pp.3485-3491.
[WO04]Wang L., Olariu S., A unifying look at clustering in mobile ad hoc networks,Wireless Communications and Mobile Computing,2004, vol.4, no.6, pp.623-637.
[WSJL07]吴正宇(Wu Z.Y.),宋瀚涛(Song H.T.),姜少峰(Jiang S.F.),梁野(Liang Y), Ad-Hoc网络中一种可靠的节点不相交多路径路由算法,北京理工大学学报,2007, vol.27, no.3, pp. 243-246.
[WSLDH06]Wang C.G., Sohraby K., Li B., Daneshmand M., Hu, Y.M., A survey of transport protocols for wireless sensor networks, IEEE Network,2006, vol.20, no.3, pp.34-40.
[WTZ01]Wang H., Tian C., Zheng S.R., A Novel Method for Label Switching, International Conference on Communication Technology, WCC-ICCT 2000,21-25 Aug.2000, Vol.1, pp. 841-844.
[WW99]Wang Y.F., Wang Z., Explicit Routing algorithms for Internet traffic engineering, the 8th International Conference on Computer Communications and Networks,11-13 Oct.1999. pp. 582-588.
[WWHT07]Wang X.W., Wang Q., Huang M., Tian Y, A flexible intelligent QoS unicast routing scheme in NGI, ICIEA 2007:2007 Second IEEE Conference on Industrial Electronics and Applications,2007, pp.2371-2376.
[XCXQH06]Xu D.H., Chen Y, Xiong YZ, Qiao C.M, He X., On the Complexity of and Algorithms for Finding the Shortest Path With a Disjoint Counterpart, IEEE/ACM Transactions on Networking, Feb.2006, vol.14, no.1, pp.147-158.
[XN99]Xiao X.P., Ni L.M., Internet QoS:A big picture, IEEE Network,1999, vol.13, no.2, pp. 8-18.
[XOSC06]The Xich Open Source Community, Speex:A Free Codec for Free Speech. http://speex.org.
[XQGZ09a]熊轲(Xiong K.),裘正定(Qiu Z.D.),郭宇春(Guo Y.C.),张宏科(Zhang H.K.),基于端口编码的面向连接的快速转发方法,北京交通大学学报,2009,vol.33,no.5.
[XQGZ09b]Xiong K., Qiu Z.D., Guo Y.C., Zhang H.K., LIC-based Fast Forwarding towards Scalability, Simplicity, Flexibility and Security,2009 International Conference on Computer and Network Technology, ICCNT 2009, Jul.2009, pp.13-18.
[XQGZ09c]Xiong K., Qiu Z.D., Guo Y.C., Zhang H.K., Multi-constrained Shortest Disjoint Paths for Reliable QoS Routing, ETRI Journal,2009, vol.31, no.5, pp.534-544.
[XQGZ10]Xiong K., Qiu Z.D., Guo Y.C., Zhang H.K., Two Scalable LIC-Based Fast Forwarding Approaches For Explicit Routing, Journal of Internet Technology,2010.
[XQGZQ09]熊轲(Xiong K.),裘正定(Qiu Z.D.),郭宇春(Guo Y.C.),张宏科(Zhang H.K.),秦雅娟(QinY.J.),多约束最短链路分离路径精确算法,软件学报,2009. vol.20, no.12.
[XQZ08a]Xiong K., Qiu Z.D., Zhang H.K., Towards Link-disjoint paths under multiple additive QoS constraints, the 2nd IET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2008, pp.119-127.
[XQZ08b]Xiong K., Qiu Z.D., Zhang H.K., QoS State Information Aggregation for Inter-domain Routing, the 9th International Conference on Signal Processing Proceedings, ICSP,2008, vol.3, pp.1997-2001.
[XQZGZ10]Xiong K., Qiu Z.D., Zhang Y, Guo Y.C., Zhang H.K., End-to-End Delay Bound of Multimedia Stream in TNPOSS Network, Journal of Beijing Jiaotong University,2010, vol.34, no.2.
[XQZLC08]Xiong K., Qiu Z.D., Zhang H.K., Li C.S., Chao H.C., A Scalable Fast Forwarding Approach for IP Networks, International Journal of Internet Protocol Technology,2008, Vol.3, No.2,pp.119-127.
[XQZQZ09]Xiong K., Qiu Z.D., Zhang Y, Qin Y.J., Zhang H.K., A Math-ematical QoS Model for Multimedia Flows on the basis of Network Calculus, ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM 2009, Aug.7-9,2009, pp. 246-249.
[XQZZ09]熊轲(Xiong K.),裘正定(Qiu Z.D.),张煜(Zhang Y.),张宏科(Zhang H.K.),基于六元组的混合式QoS信息聚合算法,高技术通讯,vol.19, no.7, pp.686-692.
[XTX06]Xiao Y, Thulasiraman K., and Xue G. L., Constrained Shortest Link-Disjoint Paths Selection:A Network Programming Based Approach, IEEE Transactions on Circuits and Systems-I:Regular Papers, vol.53, no.5, May 2006, pp.1174-1187.
[Xu08]徐荣(Xu R.),面向IP的分组传送网发展思路,中兴通讯技术,2008年,第4期,pp.29-33.
[XWLN04]Xiao L., Wang J., Lui K.S., Nahrstedt K., Advertising interdomain QoS routing information, IEEE Journal on Selected Areas in Communications,2004, vol.22, no.10, pp. 1949-1964.
[XZQSQ10]Xiong K., Zhang Y, Qiu Z.D., Sun D.M., Qin Y.J., QoS-enhanced TNPOSS Network Model and its E2E Delay Bound for Multimedia Flows, Journal of Networks,2010.
[XZQWS09]Xiong K., Zhang Y., Qiu Z.D., Wang S.H., Sun D.M., Maximum E2E Delay of Multimedia Traffic in QTNPOSS Network, the 2nd International Symposium on Information Processing, the 2nd ISIP 2009, August,21-23,2009, pp.334-337.
[YA00]Yoneda S., Aoki T., Simple IP network based on QoS free concept,2000 IEEE International Conference on Communications,2000, ICC 2000, vol.2, pp.701-707.
[Yang08]杨晓光(Yang X.G.),数据结构实例教程,清华大学出版社,北京交通大学出版社,2008,12月,第1版.
[YCWZ08]Yu H., Chen J., Wang J.P., Zheng S.Q., High-performance TCAM-based IP lookup engines, Proceedings-IEEE INFOCOM,2008,2008 IEEE INFOCOM Workshops.
[YF03]Younis O., and Fahmy S., Constraint-based routing in the internet:Basic principles and recent research, IEEE Communication Survey & Tutorials,2003, vol.5, no.1.2003.
[YFH99]Yap M.T., Fong S., Hutchison D., Guaranteeing delay in ATM switches by using output port QoS controllers, Electronics Letters,1999, vol.35, no.23, pp.2002-2003.
[YLWZ09]杨冬(Yang D.),李世勇(Li S.Y.),王博(Wang B.),张宏科(Zhang H.K.),支持普适服务的新一代网络传输层构架,计算机学报,2009, vol.32, no.3, pp.359-370.
[YM00]Yazdani N., Min P.S., Fast and scalable schemes for the IP address lookup problem, Proceedings of IEEE ATM Workshop,2000, pp.83-92.
[Y.1291]International Telecommunication Union, LC-Text:Recommendation Y.1291-An architectural framework for support of quality of service (QoS) in packet networks.
[Y.1291s]International Telecommunication Union, LC-Summary:Recommendation Y.1291-An architectural framework for support of quality of service (QoS) in packet networks.
[Young89]Young J.W., Hierarchical network control, IEEE Global Telecommunications Conference and Exhibition, vol.2, pp.1197-1200.
[YQZ01]屈军锁(Qu J.S.),郑震铎(Zheng Z.D),三网合一技术的发展趋势,现代电信科技,2001年,第5期,pp.33-40.
[YYK00]Yamanaka N., Yamakoshi K., Kawano R., High-speed switch system for multimedia service nodes, NTT R and D,2000, vol.49, nol.12, pp.698-705.
[YWCCL06]Yang W.H., Wu C.S., Chen K.J., Lee S.S.W., Link failure protection by bifurcate algorithm in wavelength-routed WDM networks, WSEAS Transactions on Communications, 2006, vol.5, no.3, pp.405-410.
[ZC07]张连明(Zhang L.M.),陈志刚(Chen Z.G.)基于网络演算的GPS系统性能边界模型与分析,计算机工程,2007, vol.33, no.6, pp.30-32.
[ZCG01]张信明(Zhang X.M.),陈国良(Chen G.L.),顾钧(Gu J.),基于网络演算计算保证服务端到端延迟上界,软件学报,2001,第12卷,第6期,pp.889-893.
[ZCG02]张信明(Zhang X.M.),陈国良(Chen G.L.),顾钧(Gu J.),基于网络演算理论流量整形模型,软件学报,2002,第13卷,第2期,pp.2225-2230.
[ZDY08]张宏科(Zhang H.K.),董平(Dong P.),杨冬(Yang D.),新互联网体系理论及关键技术.中兴通讯技术,2008, vol.14, no.1, pp.17-20.
[ZG04]张继军(Zhang J.J.),高鹏(Gao P.),基于分组网的服务质量保证,北京邮电大学出版社,2004年5月.
[ZHC08]张连明(Zhang L.M.),黄大足(Huang D.Z.),陈志刚(Chen Z.G.),基于分形漏桶的长相
关业务端到端延时上界模型,通信学报,2008,第29卷,第7期,pp.32-43.
[ZHLL06]Zheng K., Hu C.C., Lu H.B., Liu B., A TCAM-based distributed parallel IP lookup scheme and performance analysis, IEEE/ACM Transactions on Networking,2006, vol.14, no. 4, pp.863-875.
[Zhu05]朱小龙(Zhu X.L.),实施MPLS/VPN联网的复杂问题,有线电视技术,2005, vol.12, no. 5, pp.16-19.
[ZHW08]Zhang, J.J., Han Y.B., Wang L.G., New topology aggregation mechanisms for delay-bandwidth sensitive networks,2008 11th IEEE Singapore International Conference on Communication Systems, ICCS 2008,2008, pp.737-742.
[ZNYL05]Zarifzaderh S., Nayyeri A.; Yazdani N.; Lucas C., ADAM:An adaptive model for state aggregation in hierarchical networks,2005 Asia-Pacific Conference on Communications, vol. 2005, pp.901-905.
[ZYD08]张宏科(Zhang H.K.),杨冬(Yang D.),董平(Dong P.),新互联网体系下的普适服务机理及关键技术,中兴通讯技术,2008,vol.14,no.1,pp.42-47.
[ZQM07]Zhang Y., Qiu X.S., Meng L.M., A Web services-based dynamically cooperative network management architectur, First International Conference on Communications and Networking in China, ChinaCom'06, Issue 2007.
[ZS07]张宏科(Zhang H.K.),苏伟(Su W.),新网络体系基础研究——一体化网络与普适服务,电子学报,2007,第35卷,第4期,pp.593-598.
[ZTC07]赵有健(Zhao Y.J.),张铁蕾(Zhang T.L.),崔勇(Cui Y),多约束服务质量路由中的路径压缩算法,计算机学报,2007, vol.30, no.12, pp.2090-2099.
[ZZLW06]张品(Zhang P.),张坚武(Zhang J.W.),李乐民(Li L.M.),王晟(Wang S.), QoS约束下的链路分离问题的研究,通信学报,2006,第27卷,第6期,pp.37-42.
[ZZ05]Zhang R.T., Zhu X.M., Fuzzy routing in QoS networks, Lecture Notes in Artificial Intelligence(Subseries of Lecture Notes in Computer Science), Proceedings of the Second International Conference on Fuzzy Systems and Knowledge Discovery:, FSKD 2005, vol.3614, no. PART Ⅱ, pp.880-890.
[ZZ09]Zhang F., Zhong W.D., Performance evaluation of optical multicast protection approaches for combined node and link failure recovery, Journal of Lightwave Technology,2009, vol.27, no.18, pp.4017-4025.