节点势能导向多下一跳路由协议研究与性能评价
|
摘要
随着信息技术的不断发展以及对人类生活各个方面影响力的日益加深,网络基础设施已经成为关系国计民生的战略资源,网络快速自愈的重要性也日益凸现。近年来,尽管大量的人力、物力被投入到网络的管理、维护环节,但是故障恢复技术仍是各个协议层次必不可少的组成部分。提高网络快速自愈能力仍然面临两个方面的挑战:首先,如何在军事打击、恐怖袭击以及自然灾害等极端环境下提高网络的抗毁自愈能力;其次,如何应付平时环境下针对网络设备的恶意攻击和侵害所造成的网络节点设备毁坏。
网络快速自愈技术贯穿网络层、链路层以及物理层传输技术等研究开发的全过程。课题结合国家863计划信息技术领域目标导向类项目“快速自愈路由协议与试验系统”,着眼于在特定场景下增强网络路由层的快速自愈能力。在不改变现有网络基本路由架构以及路由协议的前提下,论文提出了一种适用于网络遭受重大破坏或普通网络故障在路由收敛期间能够保证报文正常传输的新型路由协议——节点势能导向的快速自愈路由协议,并对协议机制进行分析优化,提高协议的自适应能力和可扩展性,拓展协议应用环境;并提出了可高效实现新型路由协议的负载自适应路由节点体系结构。
论文的主要内容如下:
提出了多下一跳路由协议,该协议不改变IP逐跳转发的技术体系,通过路由度量约束报文的传输方向,利用多个下一跳进行网络报文并行转发,可最大限度利用网络中所有可行下一跳,使网络链路利用率整体均衡。与传统最短路径转发的单一下一跳路由协议相比,该协议可有效避免拥塞,保护切换时延较短;与多径路由相比,路径的建立维护通过相邻节点间信息通告完成,其协议控制开销较小,建立的可用下一跳数量更多,在并发多故障网络环境下,其故障修复概率更高。
提出了基于节点统计信息的链路可用带宽估计算法,设计出跳数和可用带宽字典序结合的节点势能,并证明了势能具有等压性,保证了节点势能导向路由协议构造的多下一跳路由表的无环特性。
研究并设计了一种网络拓扑信息和可达性信息相分离的路由信息传播机制,并分析评估了该机制降低路由协议控制开销的效果。通过该机制,可以减少网络中路由更新的频度,对提高网络性能具有重要价值。该机制具有较高实用价值,可推广应用于其他网络路由协议。
提出了一种近邻同步的分布式广度优先遍历算法——NS-DBFS算法,以完成协议中节点势能信息扩散和网络势能图的分布式构造。
提出一种基于带划分的路由协议可扩展方法,划分―带‖的依据是节点的转发时延。该方法首先定义基准的单跳转发时延,然后将节点按照转发时延的等级不同划分成若干环状带,每个环状带是一个路由子区域,基于节点势能路由度量运行节点势能导向路由协议;环状带之间基于环状带时延性能的路由度量进行路由选择。该体系解决节点势能导向多下一跳路由协议在异构异质网络环境的应用问题,并可推广应用于解决其他网络路由协议的可扩展性问题。
为了进一步完善节点势能导向多下一跳路由协议,未来还需要从协议的安全机制、基于节点势能导向路由协议的网络规划等方面开展研究。
With the continuous development of information technology and the increasing influence for every aspect of human life, network infrastructure has been strategy resource related the benefit of nations and people and the importance of the network fast recovery becomes increasing remarkably. Recently, though, people invest a large number of manpower resources and material resources into managing and maintaining network, recovery techniques are still indispensable. Nowadays, enhancing the fast self-recovery capability still faces two challenges: under extreme environments such as military attacks, terrorism attacks and natural disasters how to improve network self-recovery and under normal environments how to deal with node failures.
Network fast self-recovery technique is used in several layers, including network layer, network layer,data link layer and physical layer. Combined with the national 863 objective orientation project in information technology field–―self- recovery routing protocol and test system‖, the subject is concerned on the fast self-recovery in network layer under certain scenarios. This dissertation proposes a new routing protocol—Node Potential Oriented Multi-NextHop Routing Protocol by the prerequistite not to alter the current network routing framework, which can guarantee packets to forward during the convergence time when the network suffers from huge destruction or normal failures. Through analyzing and optimizing protocol mechanism, self-adaptive ability and scalability of protocol is enhanced and application environment is extended.
This dissertation is organized as follows:
A Multi-NextHop routing forwarding architecture is proposed, which do not alter the current IP hop-by-hop forwarding mechanism. The propagation direction of packets is constrained by routing metrics. The packets can be distributed into multiple next hops in parallel, making maximum use of all feasible next hops, so that the link utility ratio is globally even. Compared with the single shortest-path routing, this architecture can effectively avoid congestion and shorten protection switching delay. The path establishment and maintenance can be accomplished by routing information advertisement mechanism between peers. The control overhead of the protocol is smaller than that of multi-path routing protocol. This mechanism can provide more feasible next hops and high recovery probability, when the network incurs multiple concurrent failures.
This paper presents an algorithm for estimating available bandwidth of network nodes, based on statistical information, and designs node potential in combination with lexicographic order including hop count and available bandwidth. According to node potential, the multi-nexthop loop-free routing table can be established through proving the isopiestic pressure of the node potential.
A routing information propagation mechanism is designed, which decouples the network topology information from the reachability information. This technique can cut down the control overhead of the protocol trough analysis and estimation and reduce the frequency of routing updated, which has the important value for enhancing the network performance. It also can be widely applied for other network routing protocols.
A neighbor synchronize distributed breadth first search algorithm named NS-DBFS has been designed to complete node potential information propagation for NP-MNRP protocol and distributed construct a potential energy diagram in the network. This article proposes a multi-nexthop routing protocol based on node potential divided by“zone”which is determined by the node forwarding delay. This method defines the reference of the forwarding delay of the single next hop and then divides the forwarding delay into several cyclic zones according to different levels of forwarding delay. Every cyclic zone is a routing subregion, in which nodes implement node potential oriented Multi-NextHop routing protocol. Routing between two cyclic zones is selected on the basis of the cyclic zone delay. Using this hierarchical structure, node potential oriented multi-nexthop routing protocol can be applied in heterogeneous networks and solve the problem of scalability in other routing protocols.
In order to improve node potential oriented multi-nexthop routing protocol further, security mechanisms, network plans and other potential definitions are needed to study.
网络快速自愈技术贯穿网络层、链路层以及物理层传输技术等研究开发的全过程。课题结合国家863计划信息技术领域目标导向类项目“快速自愈路由协议与试验系统”,着眼于在特定场景下增强网络路由层的快速自愈能力。在不改变现有网络基本路由架构以及路由协议的前提下,论文提出了一种适用于网络遭受重大破坏或普通网络故障在路由收敛期间能够保证报文正常传输的新型路由协议——节点势能导向的快速自愈路由协议,并对协议机制进行分析优化,提高协议的自适应能力和可扩展性,拓展协议应用环境;并提出了可高效实现新型路由协议的负载自适应路由节点体系结构。
论文的主要内容如下:
提出了多下一跳路由协议,该协议不改变IP逐跳转发的技术体系,通过路由度量约束报文的传输方向,利用多个下一跳进行网络报文并行转发,可最大限度利用网络中所有可行下一跳,使网络链路利用率整体均衡。与传统最短路径转发的单一下一跳路由协议相比,该协议可有效避免拥塞,保护切换时延较短;与多径路由相比,路径的建立维护通过相邻节点间信息通告完成,其协议控制开销较小,建立的可用下一跳数量更多,在并发多故障网络环境下,其故障修复概率更高。
提出了基于节点统计信息的链路可用带宽估计算法,设计出跳数和可用带宽字典序结合的节点势能,并证明了势能具有等压性,保证了节点势能导向路由协议构造的多下一跳路由表的无环特性。
研究并设计了一种网络拓扑信息和可达性信息相分离的路由信息传播机制,并分析评估了该机制降低路由协议控制开销的效果。通过该机制,可以减少网络中路由更新的频度,对提高网络性能具有重要价值。该机制具有较高实用价值,可推广应用于其他网络路由协议。
提出了一种近邻同步的分布式广度优先遍历算法——NS-DBFS算法,以完成协议中节点势能信息扩散和网络势能图的分布式构造。
提出一种基于带划分的路由协议可扩展方法,划分―带‖的依据是节点的转发时延。该方法首先定义基准的单跳转发时延,然后将节点按照转发时延的等级不同划分成若干环状带,每个环状带是一个路由子区域,基于节点势能路由度量运行节点势能导向路由协议;环状带之间基于环状带时延性能的路由度量进行路由选择。该体系解决节点势能导向多下一跳路由协议在异构异质网络环境的应用问题,并可推广应用于解决其他网络路由协议的可扩展性问题。
为了进一步完善节点势能导向多下一跳路由协议,未来还需要从协议的安全机制、基于节点势能导向路由协议的网络规划等方面开展研究。
With the continuous development of information technology and the increasing influence for every aspect of human life, network infrastructure has been strategy resource related the benefit of nations and people and the importance of the network fast recovery becomes increasing remarkably. Recently, though, people invest a large number of manpower resources and material resources into managing and maintaining network, recovery techniques are still indispensable. Nowadays, enhancing the fast self-recovery capability still faces two challenges: under extreme environments such as military attacks, terrorism attacks and natural disasters how to improve network self-recovery and under normal environments how to deal with node failures.
Network fast self-recovery technique is used in several layers, including network layer, network layer,data link layer and physical layer. Combined with the national 863 objective orientation project in information technology field–―self- recovery routing protocol and test system‖, the subject is concerned on the fast self-recovery in network layer under certain scenarios. This dissertation proposes a new routing protocol—Node Potential Oriented Multi-NextHop Routing Protocol by the prerequistite not to alter the current network routing framework, which can guarantee packets to forward during the convergence time when the network suffers from huge destruction or normal failures. Through analyzing and optimizing protocol mechanism, self-adaptive ability and scalability of protocol is enhanced and application environment is extended.
This dissertation is organized as follows:
A Multi-NextHop routing forwarding architecture is proposed, which do not alter the current IP hop-by-hop forwarding mechanism. The propagation direction of packets is constrained by routing metrics. The packets can be distributed into multiple next hops in parallel, making maximum use of all feasible next hops, so that the link utility ratio is globally even. Compared with the single shortest-path routing, this architecture can effectively avoid congestion and shorten protection switching delay. The path establishment and maintenance can be accomplished by routing information advertisement mechanism between peers. The control overhead of the protocol is smaller than that of multi-path routing protocol. This mechanism can provide more feasible next hops and high recovery probability, when the network incurs multiple concurrent failures.
This paper presents an algorithm for estimating available bandwidth of network nodes, based on statistical information, and designs node potential in combination with lexicographic order including hop count and available bandwidth. According to node potential, the multi-nexthop loop-free routing table can be established through proving the isopiestic pressure of the node potential.
A routing information propagation mechanism is designed, which decouples the network topology information from the reachability information. This technique can cut down the control overhead of the protocol trough analysis and estimation and reduce the frequency of routing updated, which has the important value for enhancing the network performance. It also can be widely applied for other network routing protocols.
A neighbor synchronize distributed breadth first search algorithm named NS-DBFS has been designed to complete node potential information propagation for NP-MNRP protocol and distributed construct a potential energy diagram in the network. This article proposes a multi-nexthop routing protocol based on node potential divided by“zone”which is determined by the node forwarding delay. This method defines the reference of the forwarding delay of the single next hop and then divides the forwarding delay into several cyclic zones according to different levels of forwarding delay. Every cyclic zone is a routing subregion, in which nodes implement node potential oriented Multi-NextHop routing protocol. Routing between two cyclic zones is selected on the basis of the cyclic zone delay. Using this hierarchical structure, node potential oriented multi-nexthop routing protocol can be applied in heterogeneous networks and solve the problem of scalability in other routing protocols.
In order to improve node potential oriented multi-nexthop routing protocol further, security mechanisms, network plans and other potential definitions are needed to study.
引文
[1] Feather,M.S.,A Risk-Centric Decision Process in Software Engineering for High Assurance Systems[C]. SEHAS'2003Portland,OR
[2] CNNIC,《中国互联网络发展状况统计报告》[R],2008.12.
[3] R.J. Ellison, D.A. Fischer, R.C. Linger, H.F. Lipson, T. Longstaff, and N.R. Mead. Survivable Network Systems: An Emerging Discipline[R]. Technical Report CMU/SEI-97-TR-013, Carnegie Mellon Univ., May 1999
[4] S. Rai, B. Mukherjee, and O. Deshpande. IP resilience within an. autonomous system: Current approaches, challenges, and future directions [J]. IEEE Communications Magazine, vol. 43, no. 10, pp. 142–149,
[5] A. Nucci et al., IGP Link Weight Assignment for Transient Link Failures[J]. Elsevier ITC 18, 2003.
[6] B. Fortz and M. Thorup. Optimizing OSPF/IS-IS Weights in a Changing World[J]. IEEE JSAC, vol. 20, no. 4, May 2002, pp. 756–67.
[7] P. Narvaez, Routing Reconfiguration in IP Networks.[D]Ph.D. dissertation, MIT, June 2000
[8] A. Atlas, et al. Basic specification for IP fast-reroute : loop-free alternate[S]. Internet draft, draft-ietf-rtgwg-ipfrr-spec-base-01.txt, September 2004.
[9] S. Bryant, C. Filsfils, S. Previdi, and M. Shand. IP Fast Reroute using Tunnels[S]. Internet draft, draft-bryant-ipfrr-tunnels-01.txt,Oct 2004.
[10] S. Bryant and M. Shand. IP Fast Reroute using Not via Addresses[S]. Internet draft,draft-bryant-shand-ipfrr-notvia-addresses-00.txt, March 2005.
[11] Timothy G. Griffin and Brian J. Premore. An Experimental Analysis of BGP Convergence Time[C]. In Proc. of ICNP, November 2001.
[12]赵金晶,朱培栋,卢锡城; BGP收敛性及其对网络性能影响的定量分析[J];通信学报, VO1.28 No.8 ,2007-08
[13] Pei Dan,Zhao Xiao—liang,Wang Lan.Daniel Massey,Allison Mankin,S. FelixW u,Lixia Zhang. Improving BGP convergence through consistency assertions[C].Proceedings IEEE INFOCOM 2002 Co nference on Computer Communications. Twenty—First Annual Joint Conference of the IEEE Computerand Communications Societies(Cat.No.37364),2002.
[14] P. Francois, C. Filsfils, J. Evans, and O. Bonaventure,―Achieving sub-second IGP convergence in large IP networks[C],‖ACM SIGCOMM Computer Communication Review, vol. 35, no. 2, pp. 35– 44, July 2005
[15] A. Nucci et al.,―IGP Link Weight Assignment for Transient Link Failures[C],‖Elsevier ITC 18, 2003.
[16] B. Fortz and M. Thorup. Optimizing OSPF/IS-IS Weights in a Changing World[J]. IEEE JSAC, vol. 20, no. 4, May 2002, pp. 756–67.
[17] A. Atlas, et al. Basic specification for IP fast-reroute : loop-free alternate[S]. Internet draft,draft-ietf-rtgwg-ipfrr-spec-base-03.txt, September 2006.
[18] S. Bryant, C. Filsfils, S. Previdi, and M. Shand. IP Fast Reroute using Tunnels[S]. Internet draft, draft-bryant-ipfrr-tunnels-04.txt,Oct 2005.
[19] S. Bryant and M. Shand. IP Fast Reroute using Not via Addresses[S]. Internet draft,draft-bryant-shand-ipfrr-notvia-addresses-01.txt, March 2006.
[20] S. Vellanki and A. L. N. Reddy. Improving Service Availability During Link Failure Transients through Alternate Routing[J] .Texas A & M Univ., Tech. Report. TAMUECE-2003-02, Feb. 2003.
[21] V. Naidu. IP Fast Reroute using Multiple Path Algorithm (MPA)[S]. IETF Internet draft, June, 2004.
[22] Z. Zhong, S. Nelakuditi, Y. Yu, S. Lee, J. Wang, and C.-N. Chuah. Failure inferencing based fast rerouting for handling transient link and node failures[C]. in Proceedings of IEEE Global Internet, Mar. 2005.
[23] S. Vellanki and A. L. N. Reddy. Improving Service Availability During Link Failure Transients through Alternate Routing[R]. Texas A & M Univ., Tech. rep. TAMUECE-2003-02, Feb. 2003.
[24] M. Menth, R. Martin. Network Resilience Through Multi-Topology Routing[R]. Technical Report no. 353, University of Wuerzburg, Institute of Computer Science, May 2004
[25] A. Kvalbein, T. Cicic, S. Gjessing. Post-Failure Routing Performance with Multiple Routing Configurations[C]. In Proceedings IEEE 26th Annual Conference on Computer Communications, INFOCOM 2007.
[26] A. Kvalbein, A. F. Hansen, T. Cicic, S. Gjessing, and O. Lysne. Fast recovery from link failures using resilient routing layers[C]. in Proceedings 10th IEEE Symposium on Computers and Communications (ISCC), June 2005.
[27] S. Iyer, S. Bhattacharyya, N. Taft, and C. Diot. An approach toalleviate link overload as observed on an IP backbone[C]. in Proceedings of INFOCOM’03, Mar. 2003, pp. 406–416.
[28] S. Lee et al..Proactive vs. Reactive Approaches to Failure Resilient Routing[A]. INFOCOM 2004[C], Hong Kong, China.2004.176.-186
[29] A. Kvalbein et al. Fast IP Network Recovery using Multiple Routing Configurations[C] Proceedings of INFOCOM 2006, Spain, April 2006
[30] C. Hendrick, Routing Information Protocol[S],RFC1058, June 1988.
[31] R. Albrightson, J.J. Garcia -Luna-Aceves, and J. Boyle. EIGRP-A Fast Routing Protcol Based on Distance Vectors[C].Proc. Networld/Interop. 94, May 1994.
[32] J. Moy. OSPF version 2[S]. RFC2328, 1988.
[33] RFC1195. Use of OSI IS-IS for Routing in TCP/IP and Dual Environments[S].1990
[34] RFC1771. A Border Gateway Protocol 4 (BGP-4)[S]. 1995.
[35] A. Basu and J. G. Riecke. Stability Issues in OSPF Routing[C].in Proceedings of SIGCOMM 2001, August 2001, pp. 225–236.
[36] C. Villamizar. OSPF Optimized Multipath (OSPF-OMP)[S]. Expired Internet Draft, 1999. Available:http://www.ietf.org/proceedings/99mar/I-D/draft-ietf-ospf-omp-02.txt
[37] P. Narvaez, K. Y. Siu. Efficient Algorithms for Multi-Path Link State Routing[C]. ISCOM'99, Kaohsiung, Taiwan, 1999.
[38] Hari Shri Palakurthi. Study of Multipath Routing for QoS Provisioning[C]. INFOCOM 2001
[39] S. Vutukury and J.J. Garcia -Luna-Aceves. MDVA: A Distance-Vector Multipath Routing Protocol[C]. In Proceedings of the INFOCOM, 2001.
[40] Srinivas Vutukury. Multipath routing mechanisms for traffic engineering and quality of service in the Internet[D].Ph.D thesis, University of California, Santa Cruz, March 2001
[41] L. Wang, L.F. Zhang, et al. Multi-path source routing in wireless ad hoc networks[C]. In: Proceeding of 2000 Canadian Conference on Electrical and Computer Engineering, Pp. 479 -483, 2000.
[42] L. Wang, L.F. Zhang, et al. Adaptive multipath source routing in ad hoc networks[C]. in Proceeding of IEEE International Conference on Communi- cations, pp. 867 -871, 2001.
[43] L.F. Zhang, Z.H. Zhao, et al. Load balancing of multipath source routing in ad hoc networks[C]. in Proceeding of IEEE International Conference on Communications, pp. 3197 -3201, 2002.
[44] X. Dong, A. Puri. A DSDV-Based multipath routing protocol for Ad hoc mobile networks[C].in Proceedings of IEEE ICC’2001, pp. 37-43, 2001.
[45] M.K. Marina, S.R. Das. On-demand multipath distance vector routing for ad hoc networks[C]. in Proc. of the Int’l Conf. for Network Procotols (ICNP), pp. 14-23, 2001.
[46]陈跃泉,郭晓峰. Ad Hoc移动网络多路径研究[J]计算机科学. 2005(6): 456-464.
[47]史美林,英春.自组网路由协议综述[J].通信学报. 2001(11): 898-907.
[48] V.D. Park and M.S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks[C]. in Proc. IEEE INFOCOM’97, pp. 1405–1413, 1997
[49] V.D. Park, M.S. Corson. Temporally ordered routing algorithm (TORA) : functional specifications (version 1.0)[S]. Internet Engineering Task Force, 2004.
[50] V.D. Park, M, J.P. Macker, M.S. Corson. Applicability of the temporally ordered routing algorithm for use in mobile tactical networks[C]. in Proceedings of MILCOM 98, pp. 426– 430, 1998.
[51]刘强,匡镜明,王华,毕志明.基于TORA的移动Ad hoc网络多径路由协议M_TORA[J].北京理工大学学报. 26(5): 442-446, 2006.
[52]P. Sebos. Effectiveness of shared risk link group auto-discovery in optical networks[A]. In: Optical Fiber Communication Conference and Exhibit[C]. Paris: IEEE, 2002: 493-495.
[53]Dahai Xu, Yizhi Xiong. A Novel Segment Protection Approach for SRLG Networks[A]. In: IEEE Journal on Selected Areas in Communications[C]. 2003: 1320-1331.
[54] A. Khanna,J. Zinky. The revised ARPANET routing metric[C].ACM SIGCOMM, September 1989.
[55] Radia Perlman. Incorporation of Service Classes into a Network Architecture [C].Seventh Data Communication Symposium, Mexico, October 1981.
[56] P.Almquist.Type of Service in the Internet Protocol Suite[S]. RFC-1349,July 1992
[57] J. Bond and U. S. R. Murty, Graph Theory with Applications[M] (London and Basingstoke, MacMillan Press LTD, 1976.
[58] Roger Karrer, Ashutosh Sabharwal, and Edward Knightly.Enabling Large-scale Wireless Broadband: The Case for TAPs [C]. in Proceedingsof HotNets, Cambridge, MA, 2003.
[59] Aiguo Fei, Guangyu Pei, Roy Liu, Lixia Zhang.Measurements on delay and hop-count of the internet[C] .IEEE GLOBECOM'98,1998.
[60] K Fujii, S Goto. Correlation between hop count and packet transfer time[C]. APAN/IWS2000, February, 2000.
[61] STRAUSS J, KATABI D, KAASHOEK F. A measurement study of available bandwidth estimation tools[A]. Proceedings of ACM SIGCOMM Conference on Internet Measurement[C]. Karlsruhe, Germany, 2003.39-44.
[62] M. Jain and C. Dovrolis. Pathload: a measurement tool for end-to-end available bandwidth[C]. in Passive and Active Measurements (PAM) Workshop 2002 Proceedings, pp 14-25, Ft Collins, USA, March 2002.
[63] B. Melander, M. Bj?rkman, and P. Gunningberg. A new end-to-end probing and analysis method for estimating bandwidth bottleecks[C]. in Proceedings of IEEE Globecomm’00, San Francisco, USA, November 2000.
[64] V. Ribeiro, R. Riedi, R. Baraniuk, J. Navratil, L. Cottrell.pathChirp: efficient available bandwidth estimation for network paths[C]. in Passive and Active Measurements (PAM) Workshop 2003 Proceedings.
[65] HU N, STEENKISTE P. Evaluation and characterization of available bandwidth probing techniques[J]. IEEE Journal on Selected Areas in Communications, 2003,21(6): 879-894.
[66] RIBEIRO V, COATES M, RIEDI R, et al. Multifractal cross-traffic estimation[A]. Proceedings ITC Specialist Seminar on IP Traffic.
[67]周安福,刘敏,李忠诚,谢高岗.自适应的端到端可用带宽测量方法[J].通信学报.年29卷12期,12,2008.
[68] Z.-L. Zhang et al. Small-Time Scaling behaviors of internet backbone traffic: An Empirical Study[C]. In IEEE Infocom, San Francisco, March 2003.
[69] Svante Ekelin and Martin Nilsson. Continuous Monitoring of Available Bandwidth over a Network Path[C], SNCNW 2004
[70]W. James. Modeling Behavior Trends and Detecting Abnormal Events using Seasonal Kalman Filters[R]. USA: Computer Science and Engineering University, 2006.
[71]S. Prajakta. Time Series Forecasting Using Holt-Winters Exponential Smoothing[J]. Kanwal Rekhi School of Information Technology, 2004, 10(5): 54-58.
[72]W. James and A. Keck. Modeling Behavior Trends and Detecting Abnormal Events using Seasonal Kalman Filters[J].Computer Science and Engineering, 2006, 20(9): 98-103.
[73]沈伟,冯瑞,邵惠鹤.基于Kalman算法及神经网络预测的网络流量控制[J].计算机研究与发展,2003,40(8):1162-1166.
[74]沈伟,冯瑞,邵惠鹤.网络流量控制系统的设计—Kalman算法[J].通信学报.2005,24(4):48-55.
[75]T. Jo-Anne. A Kalman Filter for Robust Outlier Detection[A]. In: IEEE/RSJ International Conference on Intelligent Robots and Systems[C], Nice, France, April 8, 2007: 1423-1429.
[76]K. Florian and L. Douglas. Adaptive Kalman Filtering for Anomaly Detection in Software Appliances[A]. In: IEEE Workshop on Automated Network Management[C], Phoenix, USA, 18 April 2008: 1175-1182.
[77]乔芃喆，任慧玉，陈志国.基于小波分析和卡尔曼滤波的网络流量分析算法研究[J].电子与信息学报,2007,37(3):300-306.
[78] Sundar Iyer, Supratik Bhattacharyya etc,An approach to alleviate link overload as observed on an IP backbone [C].INFOCOM 2003,April 2003.
[79] Anindya Basu, Alvin Lin, Subramanian Ramanathan; Routing Using Potentials: A Dynamic Traffic-Aware Routing Algorithm[C]. Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications,Karlsruhe, GermanySIGCOMM’03, August 25–29, 2003.
[80] Gouda, M.G.; Schneider. M. Maximizable routing metrics[J]. IEEE/ACM Transactions on Networking ,Volume 11, Issue 4, Aug. 2003 Page(s): 663– 675.
[81] Chen SG.. Routing support for providing guaranteed end-to-end quality-of-service [D]. Engineering College of Computer Science, University of Illinois at Urbana-Champaign, 1999.
[82]E.W.Dijkstra and C.S.Scholten. Termination Detection for Diffusing Computations[C]. Information Processing Letters, 11:1–4, August 1980.
[83]J. M. Jaffe and F. H. Moss. A Responsive Distributed Routing Algorithm for Computer Networks[J]. IEEE Trans. Commun., 30:1758–1762, July 1982.
[84]P.M.Merlin and A. Segall. A Failsafe Distributed Routing Protocol[J]. IEEE Trans. Commun., 27:1280–1287, SAEPtember 1979.
[85] W. T. Zaumen and J.J. Garcia-Luna-Aceves. Loop-Free Multipath Routing Using Generalized Diffusing Computations[C]. Proc. IEEE INFOCOM, March 1998
[86]R. Albrightson, J.J. Garcia-Luna-Aceves, J. Boyle. EIGRP-A Fast Routing Protcol Based on Distance Vectors[A]. Networld/Interop. 1994[C], Berlin Germany, 1994.
[87]J.J. Garcia-Luna-Aceves. Loop-Free Routing Using Diffusing Computations[J]. IEEE/ACM Trans. Networking, 1993,1(1):130–141.
[88]汪小帆,李翔,陈观荣.复杂网络理论及其应用[M].清华大学出版社, P150,
[89] Adamic L A, Lukose R M, Puniyani A R, Huberman B A. Search in power-law networks[J]. Phys.Rev. E, 2001,64:046135
[90] Adamic L A, Lukose R M, Huberman B A. Local search in unstructured network[M]. In S.Bornholdt and H.G..Schuster(eds.), Handbook of Graphs and Network, Wiley-VCH, Berlin, 2003
[91] Gerard Tel,荷兰.分布式算法导论[M].机械工业出版社,P255-264.
[92]SSFNet 1.5[EB/OL]. http:// www .ssfnet .org/
[93]BRITE Topology Generator[EB/OL]. http://www.cs.bu.edu/brite/.
[94]Andy T.Ogielski and James H.Cowie.SSFNet:Scalable Simulation Framework NetworkModels[EB/OL].http://www.ssfnet.org/.
[95] IRTF Routing Research Group (RRG)[EB/OL],http://www.irtf.org/charter?gtype= rg&group=rrg,
[96] Lakshminarayanan S., Matthew C., Cheng Tien E., Mark H., Morley M., Scott S.,Ion S. HLP: a next generation inter-domain routing protocol[A]. In: ACM SIGCOMM[C], Philadelphia, Pennsylvania, USA, 2005: 13-24.
[97] Xu X.,Guo D. Hierarchical Routing Architecture (HRA) [EB/OL],draft-xu-rrg-hra-00.txt February 2008 .
[98] Oliveira R., Lad M., Zhang B.,Zhang L. Geographically Informed Inter-domain Routing[A]. In: IEEE International Conference on Network Protocols 2007 (ICNP2007)[C], Beijing, China, 2007: 103-112.
[99] Atoms-atomised routing[EB/OL],http://www.caida.org/projects/routing/atoms/.
[100]Krioukov D., Fall K.,Yang X. Compact Routing on Internet-like graphs[A]. In: IEEE INFOCOM[C], 2004: 219-229.
[101]IETF. IP Flow Information Export (IPFIX) Working Group [EB/OL]. http://www. ietf.org/html.charters/ipfix-charter.html.
[102]Cisco System. NetFlow Services Solutions Guide [EB/OL]. http://www.cisco.com/ en/US/docs/ios/solutions_docs/netflow/nfwhite.html.
[2] CNNIC,《中国互联网络发展状况统计报告》[R],2008.12.
[3] R.J. Ellison, D.A. Fischer, R.C. Linger, H.F. Lipson, T. Longstaff, and N.R. Mead. Survivable Network Systems: An Emerging Discipline[R]. Technical Report CMU/SEI-97-TR-013, Carnegie Mellon Univ., May 1999
[4] S. Rai, B. Mukherjee, and O. Deshpande. IP resilience within an. autonomous system: Current approaches, challenges, and future directions [J]. IEEE Communications Magazine, vol. 43, no. 10, pp. 142–149,
[5] A. Nucci et al., IGP Link Weight Assignment for Transient Link Failures[J]. Elsevier ITC 18, 2003.
[6] B. Fortz and M. Thorup. Optimizing OSPF/IS-IS Weights in a Changing World[J]. IEEE JSAC, vol. 20, no. 4, May 2002, pp. 756–67.
[7] P. Narvaez, Routing Reconfiguration in IP Networks.[D]Ph.D. dissertation, MIT, June 2000
[8] A. Atlas, et al. Basic specification for IP fast-reroute : loop-free alternate[S]. Internet draft, draft-ietf-rtgwg-ipfrr-spec-base-01.txt, September 2004.
[9] S. Bryant, C. Filsfils, S. Previdi, and M. Shand. IP Fast Reroute using Tunnels[S]. Internet draft, draft-bryant-ipfrr-tunnels-01.txt,Oct 2004.
[10] S. Bryant and M. Shand. IP Fast Reroute using Not via Addresses[S]. Internet draft,draft-bryant-shand-ipfrr-notvia-addresses-00.txt, March 2005.
[11] Timothy G. Griffin and Brian J. Premore. An Experimental Analysis of BGP Convergence Time[C]. In Proc. of ICNP, November 2001.
[12]赵金晶,朱培栋,卢锡城; BGP收敛性及其对网络性能影响的定量分析[J];通信学报, VO1.28 No.8 ,2007-08
[13] Pei Dan,Zhao Xiao—liang,Wang Lan.Daniel Massey,Allison Mankin,S. FelixW u,Lixia Zhang. Improving BGP convergence through consistency assertions[C].Proceedings IEEE INFOCOM 2002 Co nference on Computer Communications. Twenty—First Annual Joint Conference of the IEEE Computerand Communications Societies(Cat.No.37364),2002.
[14] P. Francois, C. Filsfils, J. Evans, and O. Bonaventure,―Achieving sub-second IGP convergence in large IP networks[C],‖ACM SIGCOMM Computer Communication Review, vol. 35, no. 2, pp. 35– 44, July 2005
[15] A. Nucci et al.,―IGP Link Weight Assignment for Transient Link Failures[C],‖Elsevier ITC 18, 2003.
[16] B. Fortz and M. Thorup. Optimizing OSPF/IS-IS Weights in a Changing World[J]. IEEE JSAC, vol. 20, no. 4, May 2002, pp. 756–67.
[17] A. Atlas, et al. Basic specification for IP fast-reroute : loop-free alternate[S]. Internet draft,draft-ietf-rtgwg-ipfrr-spec-base-03.txt, September 2006.
[18] S. Bryant, C. Filsfils, S. Previdi, and M. Shand. IP Fast Reroute using Tunnels[S]. Internet draft, draft-bryant-ipfrr-tunnels-04.txt,Oct 2005.
[19] S. Bryant and M. Shand. IP Fast Reroute using Not via Addresses[S]. Internet draft,draft-bryant-shand-ipfrr-notvia-addresses-01.txt, March 2006.
[20] S. Vellanki and A. L. N. Reddy. Improving Service Availability During Link Failure Transients through Alternate Routing[J] .Texas A & M Univ., Tech. Report. TAMUECE-2003-02, Feb. 2003.
[21] V. Naidu. IP Fast Reroute using Multiple Path Algorithm (MPA)[S]. IETF Internet draft, June, 2004.
[22] Z. Zhong, S. Nelakuditi, Y. Yu, S. Lee, J. Wang, and C.-N. Chuah. Failure inferencing based fast rerouting for handling transient link and node failures[C]. in Proceedings of IEEE Global Internet, Mar. 2005.
[23] S. Vellanki and A. L. N. Reddy. Improving Service Availability During Link Failure Transients through Alternate Routing[R]. Texas A & M Univ., Tech. rep. TAMUECE-2003-02, Feb. 2003.
[24] M. Menth, R. Martin. Network Resilience Through Multi-Topology Routing[R]. Technical Report no. 353, University of Wuerzburg, Institute of Computer Science, May 2004
[25] A. Kvalbein, T. Cicic, S. Gjessing. Post-Failure Routing Performance with Multiple Routing Configurations[C]. In Proceedings IEEE 26th Annual Conference on Computer Communications, INFOCOM 2007.
[26] A. Kvalbein, A. F. Hansen, T. Cicic, S. Gjessing, and O. Lysne. Fast recovery from link failures using resilient routing layers[C]. in Proceedings 10th IEEE Symposium on Computers and Communications (ISCC), June 2005.
[27] S. Iyer, S. Bhattacharyya, N. Taft, and C. Diot. An approach toalleviate link overload as observed on an IP backbone[C]. in Proceedings of INFOCOM’03, Mar. 2003, pp. 406–416.
[28] S. Lee et al..Proactive vs. Reactive Approaches to Failure Resilient Routing[A]. INFOCOM 2004[C], Hong Kong, China.2004.176.-186
[29] A. Kvalbein et al. Fast IP Network Recovery using Multiple Routing Configurations[C] Proceedings of INFOCOM 2006, Spain, April 2006
[30] C. Hendrick, Routing Information Protocol[S],RFC1058, June 1988.
[31] R. Albrightson, J.J. Garcia -Luna-Aceves, and J. Boyle. EIGRP-A Fast Routing Protcol Based on Distance Vectors[C].Proc. Networld/Interop. 94, May 1994.
[32] J. Moy. OSPF version 2[S]. RFC2328, 1988.
[33] RFC1195. Use of OSI IS-IS for Routing in TCP/IP and Dual Environments[S].1990
[34] RFC1771. A Border Gateway Protocol 4 (BGP-4)[S]. 1995.
[35] A. Basu and J. G. Riecke. Stability Issues in OSPF Routing[C].in Proceedings of SIGCOMM 2001, August 2001, pp. 225–236.
[36] C. Villamizar. OSPF Optimized Multipath (OSPF-OMP)[S]. Expired Internet Draft, 1999. Available:http://www.ietf.org/proceedings/99mar/I-D/draft-ietf-ospf-omp-02.txt
[37] P. Narvaez, K. Y. Siu. Efficient Algorithms for Multi-Path Link State Routing[C]. ISCOM'99, Kaohsiung, Taiwan, 1999.
[38] Hari Shri Palakurthi. Study of Multipath Routing for QoS Provisioning[C]. INFOCOM 2001
[39] S. Vutukury and J.J. Garcia -Luna-Aceves. MDVA: A Distance-Vector Multipath Routing Protocol[C]. In Proceedings of the INFOCOM, 2001.
[40] Srinivas Vutukury. Multipath routing mechanisms for traffic engineering and quality of service in the Internet[D].Ph.D thesis, University of California, Santa Cruz, March 2001
[41] L. Wang, L.F. Zhang, et al. Multi-path source routing in wireless ad hoc networks[C]. In: Proceeding of 2000 Canadian Conference on Electrical and Computer Engineering, Pp. 479 -483, 2000.
[42] L. Wang, L.F. Zhang, et al. Adaptive multipath source routing in ad hoc networks[C]. in Proceeding of IEEE International Conference on Communi- cations, pp. 867 -871, 2001.
[43] L.F. Zhang, Z.H. Zhao, et al. Load balancing of multipath source routing in ad hoc networks[C]. in Proceeding of IEEE International Conference on Communications, pp. 3197 -3201, 2002.
[44] X. Dong, A. Puri. A DSDV-Based multipath routing protocol for Ad hoc mobile networks[C].in Proceedings of IEEE ICC’2001, pp. 37-43, 2001.
[45] M.K. Marina, S.R. Das. On-demand multipath distance vector routing for ad hoc networks[C]. in Proc. of the Int’l Conf. for Network Procotols (ICNP), pp. 14-23, 2001.
[46]陈跃泉,郭晓峰. Ad Hoc移动网络多路径研究[J]计算机科学. 2005(6): 456-464.
[47]史美林,英春.自组网路由协议综述[J].通信学报. 2001(11): 898-907.
[48] V.D. Park and M.S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks[C]. in Proc. IEEE INFOCOM’97, pp. 1405–1413, 1997
[49] V.D. Park, M.S. Corson. Temporally ordered routing algorithm (TORA) : functional specifications (version 1.0)[S]. Internet Engineering Task Force, 2004.
[50] V.D. Park, M, J.P. Macker, M.S. Corson. Applicability of the temporally ordered routing algorithm for use in mobile tactical networks[C]. in Proceedings of MILCOM 98, pp. 426– 430, 1998.
[51]刘强,匡镜明,王华,毕志明.基于TORA的移动Ad hoc网络多径路由协议M_TORA[J].北京理工大学学报. 26(5): 442-446, 2006.
[52]P. Sebos. Effectiveness of shared risk link group auto-discovery in optical networks[A]. In: Optical Fiber Communication Conference and Exhibit[C]. Paris: IEEE, 2002: 493-495.
[53]Dahai Xu, Yizhi Xiong. A Novel Segment Protection Approach for SRLG Networks[A]. In: IEEE Journal on Selected Areas in Communications[C]. 2003: 1320-1331.
[54] A. Khanna,J. Zinky. The revised ARPANET routing metric[C].ACM SIGCOMM, September 1989.
[55] Radia Perlman. Incorporation of Service Classes into a Network Architecture [C].Seventh Data Communication Symposium, Mexico, October 1981.
[56] P.Almquist.Type of Service in the Internet Protocol Suite[S]. RFC-1349,July 1992
[57] J. Bond and U. S. R. Murty, Graph Theory with Applications[M] (London and Basingstoke, MacMillan Press LTD, 1976.
[58] Roger Karrer, Ashutosh Sabharwal, and Edward Knightly.Enabling Large-scale Wireless Broadband: The Case for TAPs [C]. in Proceedingsof HotNets, Cambridge, MA, 2003.
[59] Aiguo Fei, Guangyu Pei, Roy Liu, Lixia Zhang.Measurements on delay and hop-count of the internet[C] .IEEE GLOBECOM'98,1998.
[60] K Fujii, S Goto. Correlation between hop count and packet transfer time[C]. APAN/IWS2000, February, 2000.
[61] STRAUSS J, KATABI D, KAASHOEK F. A measurement study of available bandwidth estimation tools[A]. Proceedings of ACM SIGCOMM Conference on Internet Measurement[C]. Karlsruhe, Germany, 2003.39-44.
[62] M. Jain and C. Dovrolis. Pathload: a measurement tool for end-to-end available bandwidth[C]. in Passive and Active Measurements (PAM) Workshop 2002 Proceedings, pp 14-25, Ft Collins, USA, March 2002.
[63] B. Melander, M. Bj?rkman, and P. Gunningberg. A new end-to-end probing and analysis method for estimating bandwidth bottleecks[C]. in Proceedings of IEEE Globecomm’00, San Francisco, USA, November 2000.
[64] V. Ribeiro, R. Riedi, R. Baraniuk, J. Navratil, L. Cottrell.pathChirp: efficient available bandwidth estimation for network paths[C]. in Passive and Active Measurements (PAM) Workshop 2003 Proceedings.
[65] HU N, STEENKISTE P. Evaluation and characterization of available bandwidth probing techniques[J]. IEEE Journal on Selected Areas in Communications, 2003,21(6): 879-894.
[66] RIBEIRO V, COATES M, RIEDI R, et al. Multifractal cross-traffic estimation[A]. Proceedings ITC Specialist Seminar on IP Traffic.
[67]周安福,刘敏,李忠诚,谢高岗.自适应的端到端可用带宽测量方法[J].通信学报.年29卷12期,12,2008.
[68] Z.-L. Zhang et al. Small-Time Scaling behaviors of internet backbone traffic: An Empirical Study[C]. In IEEE Infocom, San Francisco, March 2003.
[69] Svante Ekelin and Martin Nilsson. Continuous Monitoring of Available Bandwidth over a Network Path[C], SNCNW 2004
[70]W. James. Modeling Behavior Trends and Detecting Abnormal Events using Seasonal Kalman Filters[R]. USA: Computer Science and Engineering University, 2006.
[71]S. Prajakta. Time Series Forecasting Using Holt-Winters Exponential Smoothing[J]. Kanwal Rekhi School of Information Technology, 2004, 10(5): 54-58.
[72]W. James and A. Keck. Modeling Behavior Trends and Detecting Abnormal Events using Seasonal Kalman Filters[J].Computer Science and Engineering, 2006, 20(9): 98-103.
[73]沈伟,冯瑞,邵惠鹤.基于Kalman算法及神经网络预测的网络流量控制[J].计算机研究与发展,2003,40(8):1162-1166.
[74]沈伟,冯瑞,邵惠鹤.网络流量控制系统的设计—Kalman算法[J].通信学报.2005,24(4):48-55.
[75]T. Jo-Anne. A Kalman Filter for Robust Outlier Detection[A]. In: IEEE/RSJ International Conference on Intelligent Robots and Systems[C], Nice, France, April 8, 2007: 1423-1429.
[76]K. Florian and L. Douglas. Adaptive Kalman Filtering for Anomaly Detection in Software Appliances[A]. In: IEEE Workshop on Automated Network Management[C], Phoenix, USA, 18 April 2008: 1175-1182.
[77]乔芃喆，任慧玉，陈志国.基于小波分析和卡尔曼滤波的网络流量分析算法研究[J].电子与信息学报,2007,37(3):300-306.
[78] Sundar Iyer, Supratik Bhattacharyya etc,An approach to alleviate link overload as observed on an IP backbone [C].INFOCOM 2003,April 2003.
[79] Anindya Basu, Alvin Lin, Subramanian Ramanathan; Routing Using Potentials: A Dynamic Traffic-Aware Routing Algorithm[C]. Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications,Karlsruhe, GermanySIGCOMM’03, August 25–29, 2003.
[80] Gouda, M.G.; Schneider. M. Maximizable routing metrics[J]. IEEE/ACM Transactions on Networking ,Volume 11, Issue 4, Aug. 2003 Page(s): 663– 675.
[81] Chen SG.. Routing support for providing guaranteed end-to-end quality-of-service [D]. Engineering College of Computer Science, University of Illinois at Urbana-Champaign, 1999.
[82]E.W.Dijkstra and C.S.Scholten. Termination Detection for Diffusing Computations[C]. Information Processing Letters, 11:1–4, August 1980.
[83]J. M. Jaffe and F. H. Moss. A Responsive Distributed Routing Algorithm for Computer Networks[J]. IEEE Trans. Commun., 30:1758–1762, July 1982.
[84]P.M.Merlin and A. Segall. A Failsafe Distributed Routing Protocol[J]. IEEE Trans. Commun., 27:1280–1287, SAEPtember 1979.
[85] W. T. Zaumen and J.J. Garcia-Luna-Aceves. Loop-Free Multipath Routing Using Generalized Diffusing Computations[C]. Proc. IEEE INFOCOM, March 1998
[86]R. Albrightson, J.J. Garcia-Luna-Aceves, J. Boyle. EIGRP-A Fast Routing Protcol Based on Distance Vectors[A]. Networld/Interop. 1994[C], Berlin Germany, 1994.
[87]J.J. Garcia-Luna-Aceves. Loop-Free Routing Using Diffusing Computations[J]. IEEE/ACM Trans. Networking, 1993,1(1):130–141.
[88]汪小帆,李翔,陈观荣.复杂网络理论及其应用[M].清华大学出版社, P150,
[89] Adamic L A, Lukose R M, Puniyani A R, Huberman B A. Search in power-law networks[J]. Phys.Rev. E, 2001,64:046135
[90] Adamic L A, Lukose R M, Huberman B A. Local search in unstructured network[M]. In S.Bornholdt and H.G..Schuster(eds.), Handbook of Graphs and Network, Wiley-VCH, Berlin, 2003
[91] Gerard Tel,荷兰.分布式算法导论[M].机械工业出版社,P255-264.
[92]SSFNet 1.5[EB/OL]. http:// www .ssfnet .org/
[93]BRITE Topology Generator[EB/OL]. http://www.cs.bu.edu/brite/.
[94]Andy T.Ogielski and James H.Cowie.SSFNet:Scalable Simulation Framework NetworkModels[EB/OL].http://www.ssfnet.org/.
[95] IRTF Routing Research Group (RRG)[EB/OL],http://www.irtf.org/charter?gtype= rg&group=rrg,
[96] Lakshminarayanan S., Matthew C., Cheng Tien E., Mark H., Morley M., Scott S.,Ion S. HLP: a next generation inter-domain routing protocol[A]. In: ACM SIGCOMM[C], Philadelphia, Pennsylvania, USA, 2005: 13-24.
[97] Xu X.,Guo D. Hierarchical Routing Architecture (HRA) [EB/OL],draft-xu-rrg-hra-00.txt February 2008 .
[98] Oliveira R., Lad M., Zhang B.,Zhang L. Geographically Informed Inter-domain Routing[A]. In: IEEE International Conference on Network Protocols 2007 (ICNP2007)[C], Beijing, China, 2007: 103-112.
[99] Atoms-atomised routing[EB/OL],http://www.caida.org/projects/routing/atoms/.
[100]Krioukov D., Fall K.,Yang X. Compact Routing on Internet-like graphs[A]. In: IEEE INFOCOM[C], 2004: 219-229.
[101]IETF. IP Flow Information Export (IPFIX) Working Group [EB/OL]. http://www. ietf.org/html.charters/ipfix-charter.html.
[102]Cisco System. NetFlow Services Solutions Guide [EB/OL]. http://www.cisco.com/ en/US/docs/ios/solutions_docs/netflow/nfwhite.html.