域间路由系统自组织特性及关键问题研究
|
摘要
基于BGP(Border Gateway Protocol)的域间路由系统作为Internet的核心设施,不但是传递网络可达信息的基本机制、自治系统AS(Autonomous System)互连的纽带和ISP(Internet Service Provider)实现策略控制的主要手段,而且对Internet的演化起着关键作用。目前域间路由系统在扩展性、收敛性、稳定性、健壮性和安全性等方面存在诸多问题,对Internet的性能和安全造成不良影响,并会制约新一代互联网的健康发展。
已有的研究工作大都基于传统路由系统的严格层次模型,采用静态的基于图论的方法,没有很好地把握域间路由系统的拓扑规律和动态行为模型,域间路由系统的许多问题没有得到有效地解决。随着Internet规模的扩展和商业化进程的加速,域间路由系统规模膨胀、结构密集、互联关系复杂、路由策略多样,表现出显著的开放复杂巨系统特征。
本文基于域间路由系统自组织特性,利用复杂系统理论和ISP之间交互的自组织规律,提出改善域间路由系统性能以及实现域间组播部署的新方法和新机制,为构造安全、可信、可控、可管的新一代互联网,促进新一代网络的持续健康发展做出贡献。
本文主要从以下五个方面进行了深入研究:
●域间路由系统自组织特性分析
域间路由系统和Internet一样是一个复杂巨系统,自组织理论是当前对于复杂系统研究的重要成果,是研究复杂系统的有效工具。本文从自组织特性的角度分析了域间路由系统的内在规律和外在表现,并且评价了改善域间路由系统的扩展性、收敛性、稳定性和安全性的各种方法。在对域间路由系统发展趋势进行剖析的基础上,给出了利用自组织特性解决域间路由系统问题的指导原则和几种可行的方法。
●域间路由系统动态演化过程研究
域间路由系统是以AS为节点构成的自组织系统。本文研究了Internet域间路由系统中各个AS在其成长消亡过程中需要考虑的各种影响因素,系统地阐述了AS之间商业关系的产生和变化,基于复杂系统理论建立了Internet域间路由系统的动态演化模型—CMV-HOT。通过对模型的研究,分析了多宿主、商业关系等因素对域间路由系统拓扑及特性的影响。
●Internet域间路由协议BGP收敛趋势的预测和分析
路由表的快速增长增加了路由器处理路由信息的时延和路由信息的扩散时间,网络规模的膨胀加大了路由信息的扩散范围,从而影响BGP协议的收敛延迟。深入研究域间路由系统的基本理论,以确定域间路由系统扩展性和收敛性的基本性能约束关系成为当务之急。本文考虑了对收敛时间产生影响的各种因素,给出了更精确的BGP收敛时间上界,进而根据域间路由系统的幂律特性和BGP协议标准分析了各个因素的变化趋势,在此基础上,对BGP的收敛时间的变化趋势进行了预测。理论分析和模拟试验显示BGP的收敛时间最终会受到CPU处理效率、AS度数以及MRAI(Minimum Route Advertisement Interval)的影响,而传输路径长度以及链路延迟反而会使收敛时间越来越小。因此网络规模的扩大和应用负载的增加带给域间路由系统最重要的影响就是对路由器处理能力的挑战。
●BGP收敛性及其对网络性能影响的定量分析
从Internet的结构特征入手,分析了BGP的收敛特性与域间路由系统的幂律特性及层次性之间的关系。根据幂律特性以及AS间商业关系的层次性特点建立了域间路由系统幂律-层次模型,将整个域间路由系统分为核心层、转发层和边缘层,在此基础上分析了不同层次上的各类收敛事件的收敛参数与网络结构的联系。理论分析和模拟试验显示核心层的收敛时间小于转发层,而影响的AS数目和转发路径的范围却大于转发层,并且网络的幂律特性对BGP收敛性有很大的影响。利用这个规律,对BGP的收敛过程进行了改进,提出“Best Up”收敛模式,有效地缩短了网络的收敛过程。
●域间组播的计费问题研究
IP组播广泛部署的困难在于合理的跨域部署和有效的计费机制,这种困难在很大程度上源于ISP之间利益的差异和行为协调的复杂性。本文基于自组织理论,从ISP之间的关系和AS结构着手,探求域间组播的合理的结构模型和RP(汇聚点)部署的经济学方法。实用的收费机制是域间组播部署的关键。本文将Internet看作一个生态系统,采用博弈论的方法,提出了有效的收费机制。从不同参与者的动机出发,系统地讨论了现有的IP组播服务模型及其收费机制。针对不同的实际应用场景,提出ICP-USER、ICP-ISP和ICP-ISP-USER三种模型。对每个模型的适用环境、解析方法以及算法的复杂性进行了全面讨论。
综上所述,本文的工作针对域间路由系统中亟待解决的关键问题提出了有效的解决方案,对于推进自组织系统的理论研究和实用化具有一定的理论意义和应用价值。
The inter-domain routing system based on the BGP (Border Gateway Protocol) protocol is a kernel establishment in the Internet. It is not only the basic mechanism of exchanging the reachable information, but also the key way to inter-connect the ASs (autonomous systems) and establish the policy control in ISPs (Internet Service Providers). It is very important in the Internet evolution process. Nowadays, there are a lot of problems in the expansibility, convergency, stability, robustness and security of the inter-domain routing system, and which blight the capability and security of the whole Internet greatly and restrain the development of the next generation Internet.
The existing research, based on the strict hierarchical structure in the traditional networks and using the static graph theory, could not grasp the topology disciplines and the dynamic behavior of the inter-domain system comprehensively. Therefore, many problems couldn't be solved perfectly by these methods. With the rapid development of the size and commercial process in the Internet, the inter-domain routing system is becoming more expanded in the scale, more complex in the interrelation, and much denser in the structure. All of these mean that the inter-domain routing system is an open complex giant system; the interactions between ISPs expose a greatly self-organized property. And this trend is the basic rule of the inter-domain routing system, which would become more and more obvious in the next generation network. Studying and designing a new routing system based on the self-organization system theory is an efficient way to solve all kinds of the performance and security problems in the routing system.
In this dissertation, we provide some new techniques and mechanisms to improve the performance of the inter-domain routing system and implement the inter-domain multicasting using the complex system theory and the self-organized rules in ISPs based on the self-organization property of the inter-domain routing system itself. Our goal is to do some contribution to the continuance and healthy development of the new generation network and the process of constructing a more reliable, more faithful, more controllable and more manageable internet.
Our work expands the research in five aspects as follows:
Analysis on the self-organization property of the inter-domain routing system
The inter-domain routing system is a complex huge system just as the Internet. The self-organization theory is an efficient tool to deal with the complex system. We abstract the internal rules and external behavior of the inter-domain routing system from the view of the self-organization property and evaluate the promotion methods for the expansibility, convergency, stability, robustness and security for BGP. Based on the prediction of the trend of the inter-domain routing system, several solutions and guidance are presented by using its self-organization property.
Research on the dynamic evolution process of the inter-domain routing system
The inter-domain routing system is a self-organized system consisted of autonomous systems. Our research study all kinds of factors that the AS should consider during its process from its growth to death, integrally explore the commercial relations between ASs, and factually build a dynamic evolution model of the inter-domain routing system based on the complex system theory, named CMV-HOT. Through the analysis of the evolution model, the influence of the multi-homing and commercial relations to the inter-domain routing system is studied.
Quantitative prediction of the BGP convergence time
The rapid increment of the routing table size causes the routing information processing time and propagating time on the network much longer. And the inflating of the Internet makes the expanding range and paths of the routing information larger. So it is emergent to confirm the basic restriction between the expansibility of the inter-domain routing system and the performance of the BGP convergence.We present a new BGP convergence model and analyze the convergence delay bounds of BGP. The development trends of all factors influencing the convergence time are forecasted based on the Power-Law of AS-level Internet topology and the BGP protocol standards. Furthermore, we predict what the BGP convergence delay will be. The results show that BGP convergence time will be influenced by processing efficiency of CPU, degree of ASs and value of MRAI greatly, but the influence of path length and link delay will be reduced.
The quantitative analysis of the influence of BGP convergence to the network performance
The physical Internet is one of the most common examples of complex networks in the real society. Its growing structure is the result of competitive and cooperative processes without any centralized control in determining the self-organized evolution of the system. We analyze the relationship between BGP convergence and the characteristics of the Internet. The Internet is classified into three hierarchies based on the Power-Law and commercial relations of autonomous systems. The relation of the network topology and the BGP convergence performance is presented for all sorts of convergence events in different layers. The result shows that the Power-Law nature of network influences the BGP convergence greatly. So we present a new approach to improve BGP convergence based on power- law, called "Best Up", which behaves better than normal convergence mode in the experiments.
The research on the pricing problem of the inter-domain multicast
A practical pricing mechanism is the foundation for the deploying of IP multicast in the inter-domain Internet. However, the different kind of profit and the behavior of each AS make this problem complex.
The IP multicast service model and its pricing mechanism are discussed in this dissertation by considering the motivations of different partners in the process. Three models are proposed for all applications in the real environments. They are ICP-USER model, ICP-ISP model and ICP-ISP-USER model respectively. In each model, the applied scenarios, resolving method and the complexity of algorithm are illustrated. Here, the Internet is considered as an ecosystem. So we give a general discussion on the practical pricing mechanism based on the game theory of the complex system for the stability of the economic development in the Internet.
In summary, our work presents solutions to several key problems of the inter-domain routing system, and has academic value and practical value for advancing the self-organized system theory and its practicability.
已有的研究工作大都基于传统路由系统的严格层次模型,采用静态的基于图论的方法,没有很好地把握域间路由系统的拓扑规律和动态行为模型,域间路由系统的许多问题没有得到有效地解决。随着Internet规模的扩展和商业化进程的加速,域间路由系统规模膨胀、结构密集、互联关系复杂、路由策略多样,表现出显著的开放复杂巨系统特征。
本文基于域间路由系统自组织特性,利用复杂系统理论和ISP之间交互的自组织规律,提出改善域间路由系统性能以及实现域间组播部署的新方法和新机制,为构造安全、可信、可控、可管的新一代互联网,促进新一代网络的持续健康发展做出贡献。
本文主要从以下五个方面进行了深入研究:
●域间路由系统自组织特性分析
域间路由系统和Internet一样是一个复杂巨系统,自组织理论是当前对于复杂系统研究的重要成果,是研究复杂系统的有效工具。本文从自组织特性的角度分析了域间路由系统的内在规律和外在表现,并且评价了改善域间路由系统的扩展性、收敛性、稳定性和安全性的各种方法。在对域间路由系统发展趋势进行剖析的基础上,给出了利用自组织特性解决域间路由系统问题的指导原则和几种可行的方法。
●域间路由系统动态演化过程研究
域间路由系统是以AS为节点构成的自组织系统。本文研究了Internet域间路由系统中各个AS在其成长消亡过程中需要考虑的各种影响因素,系统地阐述了AS之间商业关系的产生和变化,基于复杂系统理论建立了Internet域间路由系统的动态演化模型—CMV-HOT。通过对模型的研究,分析了多宿主、商业关系等因素对域间路由系统拓扑及特性的影响。
●Internet域间路由协议BGP收敛趋势的预测和分析
路由表的快速增长增加了路由器处理路由信息的时延和路由信息的扩散时间,网络规模的膨胀加大了路由信息的扩散范围,从而影响BGP协议的收敛延迟。深入研究域间路由系统的基本理论,以确定域间路由系统扩展性和收敛性的基本性能约束关系成为当务之急。本文考虑了对收敛时间产生影响的各种因素,给出了更精确的BGP收敛时间上界,进而根据域间路由系统的幂律特性和BGP协议标准分析了各个因素的变化趋势,在此基础上,对BGP的收敛时间的变化趋势进行了预测。理论分析和模拟试验显示BGP的收敛时间最终会受到CPU处理效率、AS度数以及MRAI(Minimum Route Advertisement Interval)的影响,而传输路径长度以及链路延迟反而会使收敛时间越来越小。因此网络规模的扩大和应用负载的增加带给域间路由系统最重要的影响就是对路由器处理能力的挑战。
●BGP收敛性及其对网络性能影响的定量分析
从Internet的结构特征入手,分析了BGP的收敛特性与域间路由系统的幂律特性及层次性之间的关系。根据幂律特性以及AS间商业关系的层次性特点建立了域间路由系统幂律-层次模型,将整个域间路由系统分为核心层、转发层和边缘层,在此基础上分析了不同层次上的各类收敛事件的收敛参数与网络结构的联系。理论分析和模拟试验显示核心层的收敛时间小于转发层,而影响的AS数目和转发路径的范围却大于转发层,并且网络的幂律特性对BGP收敛性有很大的影响。利用这个规律,对BGP的收敛过程进行了改进,提出“Best Up”收敛模式,有效地缩短了网络的收敛过程。
●域间组播的计费问题研究
IP组播广泛部署的困难在于合理的跨域部署和有效的计费机制,这种困难在很大程度上源于ISP之间利益的差异和行为协调的复杂性。本文基于自组织理论,从ISP之间的关系和AS结构着手,探求域间组播的合理的结构模型和RP(汇聚点)部署的经济学方法。实用的收费机制是域间组播部署的关键。本文将Internet看作一个生态系统,采用博弈论的方法,提出了有效的收费机制。从不同参与者的动机出发,系统地讨论了现有的IP组播服务模型及其收费机制。针对不同的实际应用场景,提出ICP-USER、ICP-ISP和ICP-ISP-USER三种模型。对每个模型的适用环境、解析方法以及算法的复杂性进行了全面讨论。
综上所述,本文的工作针对域间路由系统中亟待解决的关键问题提出了有效的解决方案,对于推进自组织系统的理论研究和实用化具有一定的理论意义和应用价值。
The inter-domain routing system based on the BGP (Border Gateway Protocol) protocol is a kernel establishment in the Internet. It is not only the basic mechanism of exchanging the reachable information, but also the key way to inter-connect the ASs (autonomous systems) and establish the policy control in ISPs (Internet Service Providers). It is very important in the Internet evolution process. Nowadays, there are a lot of problems in the expansibility, convergency, stability, robustness and security of the inter-domain routing system, and which blight the capability and security of the whole Internet greatly and restrain the development of the next generation Internet.
The existing research, based on the strict hierarchical structure in the traditional networks and using the static graph theory, could not grasp the topology disciplines and the dynamic behavior of the inter-domain system comprehensively. Therefore, many problems couldn't be solved perfectly by these methods. With the rapid development of the size and commercial process in the Internet, the inter-domain routing system is becoming more expanded in the scale, more complex in the interrelation, and much denser in the structure. All of these mean that the inter-domain routing system is an open complex giant system; the interactions between ISPs expose a greatly self-organized property. And this trend is the basic rule of the inter-domain routing system, which would become more and more obvious in the next generation network. Studying and designing a new routing system based on the self-organization system theory is an efficient way to solve all kinds of the performance and security problems in the routing system.
In this dissertation, we provide some new techniques and mechanisms to improve the performance of the inter-domain routing system and implement the inter-domain multicasting using the complex system theory and the self-organized rules in ISPs based on the self-organization property of the inter-domain routing system itself. Our goal is to do some contribution to the continuance and healthy development of the new generation network and the process of constructing a more reliable, more faithful, more controllable and more manageable internet.
Our work expands the research in five aspects as follows:
Analysis on the self-organization property of the inter-domain routing system
The inter-domain routing system is a complex huge system just as the Internet. The self-organization theory is an efficient tool to deal with the complex system. We abstract the internal rules and external behavior of the inter-domain routing system from the view of the self-organization property and evaluate the promotion methods for the expansibility, convergency, stability, robustness and security for BGP. Based on the prediction of the trend of the inter-domain routing system, several solutions and guidance are presented by using its self-organization property.
Research on the dynamic evolution process of the inter-domain routing system
The inter-domain routing system is a self-organized system consisted of autonomous systems. Our research study all kinds of factors that the AS should consider during its process from its growth to death, integrally explore the commercial relations between ASs, and factually build a dynamic evolution model of the inter-domain routing system based on the complex system theory, named CMV-HOT. Through the analysis of the evolution model, the influence of the multi-homing and commercial relations to the inter-domain routing system is studied.
Quantitative prediction of the BGP convergence time
The rapid increment of the routing table size causes the routing information processing time and propagating time on the network much longer. And the inflating of the Internet makes the expanding range and paths of the routing information larger. So it is emergent to confirm the basic restriction between the expansibility of the inter-domain routing system and the performance of the BGP convergence.We present a new BGP convergence model and analyze the convergence delay bounds of BGP. The development trends of all factors influencing the convergence time are forecasted based on the Power-Law of AS-level Internet topology and the BGP protocol standards. Furthermore, we predict what the BGP convergence delay will be. The results show that BGP convergence time will be influenced by processing efficiency of CPU, degree of ASs and value of MRAI greatly, but the influence of path length and link delay will be reduced.
The quantitative analysis of the influence of BGP convergence to the network performance
The physical Internet is one of the most common examples of complex networks in the real society. Its growing structure is the result of competitive and cooperative processes without any centralized control in determining the self-organized evolution of the system. We analyze the relationship between BGP convergence and the characteristics of the Internet. The Internet is classified into three hierarchies based on the Power-Law and commercial relations of autonomous systems. The relation of the network topology and the BGP convergence performance is presented for all sorts of convergence events in different layers. The result shows that the Power-Law nature of network influences the BGP convergence greatly. So we present a new approach to improve BGP convergence based on power- law, called "Best Up", which behaves better than normal convergence mode in the experiments.
The research on the pricing problem of the inter-domain multicast
A practical pricing mechanism is the foundation for the deploying of IP multicast in the inter-domain Internet. However, the different kind of profit and the behavior of each AS make this problem complex.
The IP multicast service model and its pricing mechanism are discussed in this dissertation by considering the motivations of different partners in the process. Three models are proposed for all applications in the real environments. They are ICP-USER model, ICP-ISP model and ICP-ISP-USER model respectively. In each model, the applied scenarios, resolving method and the complexity of algorithm are illustrated. Here, the Internet is considered as an ecosystem. So we give a general discussion on the practical pricing mechanism based on the game theory of the complex system for the stability of the economic development in the Internet.
In summary, our work presents solutions to several key problems of the inter-domain routing system, and has academic value and practical value for advancing the self-organized system theory and its practicability.
引文
[1]Rekhter Y,Li T,Hares S,et al.A Border Gateway Protocol 4(BGP-4).RFC 4271,January 2006
[2]L.M D.Exterior Gateway Protocol Formal Specification.RFC 904,1984
[3]Lougheed K,Rekhter Y.A Border Gateway Protocol(BGP).RFC 1105,1989
[4]Lougheed K,Rekhter Y.Border Gateway Protocol-4.in RFC 1771,1995.
[5]Use of BGP-4 Multiprotocol Extensions for IPv6 Inter-Domain Routing.RFC 2545,1999.
[6]Bu T,Gao L,Towsley D.On Routing Table Growth.in Globle Internet,2002.
[7]Traina E Autonomous System Confederation for BGR RFC 1965,1996
[8]Bates T,Chandra R,Chen E.BGP Route Reflection.RFC 2796,2000
[9]贾凤根,张建辉,郭云飞,et al.bgp路由协议实际应用中的问题及解决方案.电信科学2004,vol.2004年03期
[10]Traina P.BGP-4 Protocol Analysis.RFC 1774,1995
[11]Paxson V.End-to-End Routing Behavior in the Internet[J].IEEE/ACM Transactions on Networking,October 1997,vol.5(5):601-615
[12]Labovitz C,Ahuja A,Wattenhofer R,et al.The Impact of Internet Policy and Topology on Delayed Routing Convergence.INFOCOMM IEEE,2001.
[13]Caesar M,Rexford J.BGP Routing Policies in ISP Networks[J].IEEE Network Magazine,special issue on Interdomain Routing,Nov/Dec 2005
[14]Griffin T,Wilfong G.An Analysis of BGP Convergence Properties[C].in SIGCOMM.Los Alamitos,CA,USA:ACM,1999:277-288.
[15]Gao L,Griffin T,Rexford J.Inherently Safe Backup Routing with BGP[C].in INFOCOM.Anchorage,AK:IEEE,2001:547-556.
[16]McPherson D,Gill V,Walton D,et al.BGP Persistent Route Oscillation Condition [J].IETF Internet Draft:Draft-ietf-idr-route- oscillation-00.txt,2001.http://citeseer.ist.psu.edu/mcpherson02border.html.
[17]Labovitz C,Ahuja A,Bose A,et al.Delayed Internet Routing Convergence[C].in SIGCOMM:ACM,2000.
[18]Mao Z M,Bushy R,Griffinz T G,et al.BGP Beacons[C].IMC.Miami Beach,Florida,USA,2003.
[19]Feldmann A,Maennel.Z O,Morley M.Locating Internet Routing Instabilities.SIGCOMM:ACM,2004.
[20]Griffin T,Premore B.An Experimental Analysis of BGP Convergence Time.ICNP:IEEE,November 2001.
[21]Bremler-Barr A,Afek Y,Schwarz S.Improved BGP Convergence via Ghost Flushing.INFOCOM:IEEE,2003.
[22]Pei D,Zhao X,Wang L,et al.Improving BGP Convergence Through Assertions Approach.INFOCOM:IEEE,2002.
[23]Pei D,Azuma M,Nguyen N,et al.BGP-RCN:Improving BGP Convergence through Root Cause Notification[R],October 2003.http://www.cs.ucla.edu/peidan/bgp-rcn-tr.pdf
[24]Chandrashekar J,Duan Z,Zhang Z-L,et al.Limiting Path Exploration in BGP[C].in INFOCOM Miami,Florida:IEEE,March 13 - 17,2005.
[25]Wang L,Zhao X,Pei D,et al.Observation and Analysis of BGP Behavior under Stress[C].the 2nd ACM SIGCOMM Workshop on Internet measurment.Marseille,France:183 - 195
[26]Govindan R,Reddy A.An Analysis of Internet Inter-Domain Topology and Route Stability[C].Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies Driving the Information Revolution,April,1997:850.
[27]Estrin D,Rekhter Y,Hotz S.Scalable Inter-domain Routing Architecture[C].Conference proceedings on Communications architectures & protocols.Baltimore,Maryland,United States,August 17-20,1992:40-52.
[28]Chinoy B.Dynamics of Internet Routing Information[C].Conference proceedings on Communications architectures,protocols and applications.San Francisco,California,United States,September 13-17,1993:45-52.
[29]Rexford J,Wang J,Xiao Z,et al.BGP Routing Stability of Popular Destinations.Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment Marseille,France,November 06-08,2002.
[30]http://bgp.potaroo.net/as 1221/bgp-active.html.
[31]Routing Arbiter Project.http://www.merit.edu/networkresearch/projecthistory/routingartiber/.
[32]Gao L,Rexford J.Stable Interent Routing without Global Coordination[J].IEEE/ACM Trans.on Networking,2001,vol.9(6):681-692
[33]Villamizar C,Chandra R,Govindan R.BGP Route Flap Damping.RFC 2439,1998.
[34]Yu H,Alaettinoglu C,Jacobson V.Towards Milli-second IGP convergence[J].IETF Internet Draft:Draft-Alaettinoglu-ISIS- Convergence-00,2000.http://www.rtg.ietf.org/～fenner/ietf/xml/bibxml3/reference.I-D.alaettinoglu-isis-co nvergence.xml
[35]Labovitz C,Malan R,Jahanian F.Internet Routing Instability[C].INFOCOM New York:IEEE,1999:218-226.
[36]Cowie J,Ogielski A,Premore B,et al.Global Routing Instabilities during Code Red Ⅱ and Nimda Worm Propagation,2001.http://www.renesys.com/proiects/bgp instability.
[37]Huang Y-a.Routing Attacks[R]:Computer Science Department,Gatech University
[38]Chakrabarti A,Manimaran G.Internet Infrastructure Security:A Taxonomy[R]: Dependable Computing & Networking Laboratory,Dept.of Electrical and Computer Engineering,Iowa State University
[39]Butler K,Farley T,McDaniel P.A Survey of BGP Security Issues and Solutions.AT&T Labs - Research Florham Park N J:Technical Report TD-5UGJ33,February 2004.
[40]Subramanian L,Roth V,Stoica I,et al.Listen and Whisper:Security Mechanisms for BGP.First Symposium on Networked Systems Design and Implementation (NSDI'04),March,2004
[41]Kent S,Lynn C,Mikkelson J,et al.Secure Border Gateway Protocol(S-BGP)[J].EEE Journal on Selected Areas in Communication,2000,vol.14(4):114-117
[42]Kent S,Lynn C,Mikkelson J,et al.Secure Border Gateway Protocol(S-BGP) -Real World Performance and Deployment Issues[C].the Network and Distributed System Security Symposium.San Diego,California,Febuary 2000
[43]White R.Securing BGP through secure origin BGP(soBGP)[J].The Internet Protocol Journal,2003,vol.6(3):15-22
[44]HU Y,C.PERRIG,IRBU A.SPV:Secure path vector routing for securing BGP.A CM SIGCOMM Portland,OR,September 2004.
[45]GOODELL G,Aiello W,Griffin T,et al.Working around BGP:An Incremental Approach to Improving Security and Accuracy of Interdomain Routing.Network and Distributed Systems Security,February 2003.
[46]谢天舜,朱祥华.Ip多播技术及其应用[J].电信工程技术与标准化vol.2002年03期
[47]Rajvaidya P,Almeroth K C.Multicast Routing Instabilities[J].IEEE Internet Computing,September 2004,vol.8(5):42-49
[48]Byers J W,Luby M,Mitzenmacher M.A Digital Fountain Approach to Asynchronous Reliable Multicast[J].IEEE J.Sel.Areas Commun,Oct.2002,vol.20(8):1528-1540
[49]Gorinsky S,Jain S,Vin H,et al.Robustness to Inflated Subscription in Multicast Congestion Control[C].ACM SIGCOMM,Aug.2003:87-98.
[50]Ballardie A,Crowcroft.J.Multicast-Specific Security Threats and Counter-Measures.NDSS 1995,Feb.1995.
[51]Mittra.S.Iolus:A Framework for Scalable Secure Multicasting[C].ACM SIGCOMM,Sep.1997:277-288.
[52]S.Banerjee,Bhattacharjee B,Kommareddy C.Scalable Application Layer Multicast.ACMSIGCOMM,Aug.2002.
[53]Gorinsky S,Ramakrishnan K K,Vin H.Addressing Heterogeneity and Scalability in Layered Multicast Congestion Control[R]:Dept.Comput.Sci.,Univ.Texas at Austin,Nov.2000
[54]Deering S E.Multicast Routing in a Datagram Internetwork[Ph.D.dissertation].Stanford Univ.,Stanford,CA,Dec.1991.
[55]Distance Vector Multicast Routing Protocol.RFC 1812.
[56]Protocol Independent Multicast - Dense Mode(PIM-DM):Protocol Specification.RFC 3973.
[57]Protocol Independent Multicast-Sparse Mode(PIMoSM):Protocol Specification.RFC 2362.
[58]MOSPF:Multicast Extensions to OSPF.RFC 1584.
[59]Krioukov D,Fall K,Yang X.Compact Routing on Internet-Like Graph[C].in INFOCOM.Hong Kong,China:IEEE,2004:219-220.
[60]Eilam T,Gavoille C,Peleg D.Compact routing schemes with low stretch factor[J].Journal of Algorithms,2003,vol.46(3):97-114
[61]Willinger W,Alderson D,Doyle J C,et al.More "Normal" Than Normal:Scaling Distributions and Complex Systems.in Winter Simulation Conference,2004.
[62]Atkinson R,Floyd S.RFC 3869 - IAB Concerns and Recommendations Regarding Internet Research and Evolution[J].Internet Architecture Board,August 2004
[63]Cilliers P.复杂性与后现代主义[M]:上海科技出版社,2005.ISBN7-5428-3916-0
[64]Alderson,Willinger W.A Contrasting Look at Self-Organization in the Internet and Next-Generation Communication Networks[J].IEEE Communications Magazine,July,2005
[65]Prehofer C,Bettstetter C.Self-Organization in Communication Networks:Principles and Design Paradigms[J].IEEE Communications Magazine,July,2005,vol.43(7)
[66]Ravasz E b,Baraba'si A-L s.Hierarchical Organization in Complex Networks[J].PHYSICAL REVIEW E,2003,vol.67(026112)
[67]Faloutsos M,Faloutsos P,Faloutsos C.On Power-law Relationships of the Internet Topology[J].ACM SIGCOMM Computer Communication Review;1999,vol.29(4):251-262
[68]Almer C,Steffan J.Generating Network Topologies that Obey Power Laws[C].GLOBECOM San Francisco,2001:434 -438.
[69]Tian B,Towsley D.On Distinguishing between Internet Power Law Topology Generators[C].in INFOCOM New York:IEEE 2002:638-647.
[70]Chen Q,Chang H,Govindan R,et al.The Origin of Power Laws in Internet Topologies Revisited[C].in INFOCOM New York:IEEE 2002:608-617.
[71]Siganos G,Faloutsos M,Faloutsos P.et al.Power-laws and the AS-level Internet topology[J].IEEE/ACM Trans.on Networking,2003,vol.11(4):514-524
[72]Albert-László,Barabási.The Physics of the Web.2001. http://www.physicsWeb.org/article/world/14/7/09.
[73]Albert R,Barabási A.Topology of Evolving Networks:Local Events and Universality[J].Physical Review Letters,2000,vol.85(24):5234-5241
[74]Shoham Y,Wellman M.Economic Principles of Multiagent Systems[J].Artificial Intelligence,1997,vol.94:1-6
[75]Claffy K.Internet Measurement and Data Analysis:Topology,Workload,Performance and Routing Statistics.http://www.caida.org/outreach/papers/1999/Nae.
[76]Huston G.Interconnection,Peering,and Settlements[J].Internet protocol journal,1999,vol.45(3):136-152
[77]Kleinrock L,Kamoun F.Hierarchical Routing for Large Networks:Performance Evaluation and Optimization[J].Computer Networks,1977,vol.1:155-174
[78]Waxman B.Routing of Multipoint Connections[J].IEEE Journal on Selected Areas in Communications,1988,vol.6(9):1617-1622
[79]Zegura E,Calvert K,Donahoo M.A Quantitative Comparison of Graph-based Models for Internet Topology[J].IEEE/ACM Trans.on Networking,1997,vol.5(6):770-783
[80]Farrar J.C&W Routing Instability.NANOG mail archives,Apr 2001.
[81]Rcc:Routing Configuration Checker.http://nms.csail.mit.edu/bgp/rcc/.
[82]Griffin T G,Shepherd F B,Wilfong G.The Stable Paths Problem and Interdomain Routing[J].ACM/IEEE Trans.on Networking,2002,vol.10(2):232-243
[83]Osborne M-J,Rubinstein A.A Course in Game Theory.Cambridge MA:MIT Press,1994.
[84]Hsiao M T,Lazar A.A Game Theoretic Approach to Decentralized Flow Control of Markovian Queueing Networks[C].Performance.North-Holland,Amsterdam:IEEE,1988.
[85]张宇,张宏莉,方滨兴.Internet拓扑建模综述[J].软件学报,2004,vol.15(8):1220-1226.http://www.ios.org.cn/1000-9825/15/1220.htm
[86]Doar M.A Better Model for Generating Test Networks[C].GLOBECOM.London:IEEE,1996:86-93.
[87]Watts,D.J.Small World:The Dynamic of Networks between Order and Randomness[J].Nature,1999,vol.393:440
[88]The National Laboratory for Applied Network Research(NLANR) Project.http://www.nlanr.net/.
[89]University of Oregon Route Views Project.http://www.routeviews.org/.
[90]TraceRoute Project.http://www.traceroute.org/.
[91]Magoni D,Pansiot J.Internet Topology Modeler based on Map Sampling[C].ISCC Taormina:IEEE,2002:1021-1027.
[92]Lakhina A,Byers J,Crovella M,et al.Sampling Biases in IP Topology Measurements[C].INFOCOM San Francisco:IEEE,2003:332-341.
[93]Aiello W,Chung F,Lu L.A Random Graph Model for Massive Graphs[C].STOC Portland:ACM Press,2000:171-180.
[94]Barabási A,Albert R.Emergence of Scaling in Random Networks[J].Science,1999,vol.286(5439):509-512
[95]Zhou S,Mondragon R J.Towards Modelling the Internet Topology - the Interactive Growth Model.the 18th International Teletraffic Congress,2003.
[96]J.M.Carlson,Doyle J.Highly Optimized Tolerance:A Mechanism for Power Laws in Designed Systems[J].PHYSICAL REVIEW E,AUGUST 1999,vol.60(2)
[97]Doyle J,J.M.Carlson.Power Law,High Optimized Tolerance,and Generalized Source Coding[J].Physical Review Letters,June 2000,vol.84(24)
[98]Friedman E,Shenker.S.Learning and Implementation in the Internet.Preprint.
[99]GE Z,FIGUEIREDO,D J S,et al.On the Hierarchical Structure of the Logical Internet Graph.SPIE ITCOMUSA,August 2001.
[100]L.Li,Alderson D,Doyle J,et al.A First-Principles Approach to Understanding the Internet's Router level Topology.SIGCOMM ACM,2004.
[101]Alderson D,Doyle J,Willinger W.Internet Connectivity at the AS level:An Optimization Driven Modeling Approach[C].in SIGCOMM.Karlsruhe,Germany:ACM,2003.
[102]Lun L,Alderson D,Tanaka R,et al.Towards a Theory of Scale-Free Graphs:Definition,Properties,and Implication[R],October 2005
[103]Fabrikant A,Koutsoupias E,Papadimitriou.C.Heuristically Optimized Trade-offs:A new paradigm for Power- laws in the Internet[C].ICALP:IEEE,2002:110-122.
[104]Obradovic D.Real-time Model and Convergence Time of BG.INFOCOM:IEEE June,2002.
[105]Pei D,Zhang B,Massey D,et al.An Analysis of Path-Vector Routing Protocol[R],March 22nd,2004
[106]Rafit Izhak-Ratzin,Zhang B,Pei D,et al.Quantifying BGP Path Exploration in the Internet[R]:Tech.Rep.on 63th IETF,July 2005
[107]Gob K-I,Kahng B,Kim D.Cost-sharing Machanism[J].Phys.Rev.Lett,2001,vol.87
[108]Adamic L A,Lukose R M,Puniyani A R,et al.Marginal Cost Mechanism[J].Phys.Rev.E,2001,vol.64
[109]Sanders B.An Incentive Compatible on Control Algorithm for Rate Allocation in Computer Networks[J].IEEE Transactions on Computers,1988,vol.37:1067-1072
[110]Govindan R,Reddy A.An Analysis of Internet Inter-Dornain Topology and Route Stability.INFOCOM IEEE,1997.
[111]朱培栋,刘欣.推断Internet层次的有效算法[J].高技术通讯,2004,vol.14(增刊):358-361
[112]The S SFNet Project.http://www.ssfnet.org.
[113]SSFNet.http://www.ssfnet.org/Exchange/gallery/asgraph/src.tar.gz.
[114]Kurose J F,Simha R.A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems[J].IEEE Transactions on Computers,1989,vol.38:705-717
[115]Groves T,Ledyard J.Incentive Compatibility since 1972,in Information,Incentives,and Economics Mechanisms[R]:University of Minnesota Press,Minneapolis,1987
[116]Ferguson D,Nikolaou C,Yemini Y.An Economy for Flow Control in Computer Networks[C].1NFOCOM.Los Alamitos:IEEE Computer Society Press,1989:100-118.
[117]Carlson J M,Doyle J.Complexity and Robustness,[C].in Nat'l.Acad.Sci.USA,2002:2539-2545.
[118]Rosenschein,Zlotkin J G.Rules of Encounter:Designing Conventions for Automated Negotiation among Computers[C].in MIT Press.Cambridge MA,1994.
[119]Walsh W,Wellman M.A Market Protocol for Decentralized Task Allocation[C].in the Third International Conference on Multi-Agent Systems.Los Alamitos:IEEE Computer Society Press,1998:325-332.
[120]Dasgupta P,Hammond P,Maskin E.The Implementation of Social Choice Rules [J].Review of Economic Studies 1979,vol.46:185-216.
[121]Maskin E.The Theory of Implementation in Nash Equilibrium,in Social Goals and Organization:Essays in Memory of Elisha Pazner.Cambridge UK:Cambridge University Press,1985,pp.173-204.
[122]Feigenbaum J,Papadimitriou C,Shenker S.Sharing the Cost of Multicast Transmissions[J].Journal of Computer and System Sciences,2003,vol.63:21-41
[123]Moulin H,Shenker S.Strategyproof Sharing of Submodular Costs:Budget Balance versus Efficiency[J].Economic Theory,2001,vol.18:511-533
[2]L.M D.Exterior Gateway Protocol Formal Specification.RFC 904,1984
[3]Lougheed K,Rekhter Y.A Border Gateway Protocol(BGP).RFC 1105,1989
[4]Lougheed K,Rekhter Y.Border Gateway Protocol-4.in RFC 1771,1995.
[5]Use of BGP-4 Multiprotocol Extensions for IPv6 Inter-Domain Routing.RFC 2545,1999.
[6]Bu T,Gao L,Towsley D.On Routing Table Growth.in Globle Internet,2002.
[7]Traina E Autonomous System Confederation for BGR RFC 1965,1996
[8]Bates T,Chandra R,Chen E.BGP Route Reflection.RFC 2796,2000
[9]贾凤根,张建辉,郭云飞,et al.bgp路由协议实际应用中的问题及解决方案.电信科学2004,vol.2004年03期
[10]Traina P.BGP-4 Protocol Analysis.RFC 1774,1995
[11]Paxson V.End-to-End Routing Behavior in the Internet[J].IEEE/ACM Transactions on Networking,October 1997,vol.5(5):601-615
[12]Labovitz C,Ahuja A,Wattenhofer R,et al.The Impact of Internet Policy and Topology on Delayed Routing Convergence.INFOCOMM IEEE,2001.
[13]Caesar M,Rexford J.BGP Routing Policies in ISP Networks[J].IEEE Network Magazine,special issue on Interdomain Routing,Nov/Dec 2005
[14]Griffin T,Wilfong G.An Analysis of BGP Convergence Properties[C].in SIGCOMM.Los Alamitos,CA,USA:ACM,1999:277-288.
[15]Gao L,Griffin T,Rexford J.Inherently Safe Backup Routing with BGP[C].in INFOCOM.Anchorage,AK:IEEE,2001:547-556.
[16]McPherson D,Gill V,Walton D,et al.BGP Persistent Route Oscillation Condition [J].IETF Internet Draft:Draft-ietf-idr-route- oscillation-00.txt,2001.http://citeseer.ist.psu.edu/mcpherson02border.html.
[17]Labovitz C,Ahuja A,Bose A,et al.Delayed Internet Routing Convergence[C].in SIGCOMM:ACM,2000.
[18]Mao Z M,Bushy R,Griffinz T G,et al.BGP Beacons[C].IMC.Miami Beach,Florida,USA,2003.
[19]Feldmann A,Maennel.Z O,Morley M.Locating Internet Routing Instabilities.SIGCOMM:ACM,2004.
[20]Griffin T,Premore B.An Experimental Analysis of BGP Convergence Time.ICNP:IEEE,November 2001.
[21]Bremler-Barr A,Afek Y,Schwarz S.Improved BGP Convergence via Ghost Flushing.INFOCOM:IEEE,2003.
[22]Pei D,Zhao X,Wang L,et al.Improving BGP Convergence Through Assertions Approach.INFOCOM:IEEE,2002.
[23]Pei D,Azuma M,Nguyen N,et al.BGP-RCN:Improving BGP Convergence through Root Cause Notification[R],October 2003.http://www.cs.ucla.edu/peidan/bgp-rcn-tr.pdf
[24]Chandrashekar J,Duan Z,Zhang Z-L,et al.Limiting Path Exploration in BGP[C].in INFOCOM Miami,Florida:IEEE,March 13 - 17,2005.
[25]Wang L,Zhao X,Pei D,et al.Observation and Analysis of BGP Behavior under Stress[C].the 2nd ACM SIGCOMM Workshop on Internet measurment.Marseille,France:183 - 195
[26]Govindan R,Reddy A.An Analysis of Internet Inter-Domain Topology and Route Stability[C].Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies Driving the Information Revolution,April,1997:850.
[27]Estrin D,Rekhter Y,Hotz S.Scalable Inter-domain Routing Architecture[C].Conference proceedings on Communications architectures & protocols.Baltimore,Maryland,United States,August 17-20,1992:40-52.
[28]Chinoy B.Dynamics of Internet Routing Information[C].Conference proceedings on Communications architectures,protocols and applications.San Francisco,California,United States,September 13-17,1993:45-52.
[29]Rexford J,Wang J,Xiao Z,et al.BGP Routing Stability of Popular Destinations.Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment Marseille,France,November 06-08,2002.
[30]http://bgp.potaroo.net/as 1221/bgp-active.html.
[31]Routing Arbiter Project.http://www.merit.edu/networkresearch/projecthistory/routingartiber/.
[32]Gao L,Rexford J.Stable Interent Routing without Global Coordination[J].IEEE/ACM Trans.on Networking,2001,vol.9(6):681-692
[33]Villamizar C,Chandra R,Govindan R.BGP Route Flap Damping.RFC 2439,1998.
[34]Yu H,Alaettinoglu C,Jacobson V.Towards Milli-second IGP convergence[J].IETF Internet Draft:Draft-Alaettinoglu-ISIS- Convergence-00,2000.http://www.rtg.ietf.org/～fenner/ietf/xml/bibxml3/reference.I-D.alaettinoglu-isis-co nvergence.xml
[35]Labovitz C,Malan R,Jahanian F.Internet Routing Instability[C].INFOCOM New York:IEEE,1999:218-226.
[36]Cowie J,Ogielski A,Premore B,et al.Global Routing Instabilities during Code Red Ⅱ and Nimda Worm Propagation,2001.http://www.renesys.com/proiects/bgp instability.
[37]Huang Y-a.Routing Attacks[R]:Computer Science Department,Gatech University
[38]Chakrabarti A,Manimaran G.Internet Infrastructure Security:A Taxonomy[R]: Dependable Computing & Networking Laboratory,Dept.of Electrical and Computer Engineering,Iowa State University
[39]Butler K,Farley T,McDaniel P.A Survey of BGP Security Issues and Solutions.AT&T Labs - Research Florham Park N J:Technical Report TD-5UGJ33,February 2004.
[40]Subramanian L,Roth V,Stoica I,et al.Listen and Whisper:Security Mechanisms for BGP.First Symposium on Networked Systems Design and Implementation (NSDI'04),March,2004
[41]Kent S,Lynn C,Mikkelson J,et al.Secure Border Gateway Protocol(S-BGP)[J].EEE Journal on Selected Areas in Communication,2000,vol.14(4):114-117
[42]Kent S,Lynn C,Mikkelson J,et al.Secure Border Gateway Protocol(S-BGP) -Real World Performance and Deployment Issues[C].the Network and Distributed System Security Symposium.San Diego,California,Febuary 2000
[43]White R.Securing BGP through secure origin BGP(soBGP)[J].The Internet Protocol Journal,2003,vol.6(3):15-22
[44]HU Y,C.PERRIG,IRBU A.SPV:Secure path vector routing for securing BGP.A CM SIGCOMM Portland,OR,September 2004.
[45]GOODELL G,Aiello W,Griffin T,et al.Working around BGP:An Incremental Approach to Improving Security and Accuracy of Interdomain Routing.Network and Distributed Systems Security,February 2003.
[46]谢天舜,朱祥华.Ip多播技术及其应用[J].电信工程技术与标准化vol.2002年03期
[47]Rajvaidya P,Almeroth K C.Multicast Routing Instabilities[J].IEEE Internet Computing,September 2004,vol.8(5):42-49
[48]Byers J W,Luby M,Mitzenmacher M.A Digital Fountain Approach to Asynchronous Reliable Multicast[J].IEEE J.Sel.Areas Commun,Oct.2002,vol.20(8):1528-1540
[49]Gorinsky S,Jain S,Vin H,et al.Robustness to Inflated Subscription in Multicast Congestion Control[C].ACM SIGCOMM,Aug.2003:87-98.
[50]Ballardie A,Crowcroft.J.Multicast-Specific Security Threats and Counter-Measures.NDSS 1995,Feb.1995.
[51]Mittra.S.Iolus:A Framework for Scalable Secure Multicasting[C].ACM SIGCOMM,Sep.1997:277-288.
[52]S.Banerjee,Bhattacharjee B,Kommareddy C.Scalable Application Layer Multicast.ACMSIGCOMM,Aug.2002.
[53]Gorinsky S,Ramakrishnan K K,Vin H.Addressing Heterogeneity and Scalability in Layered Multicast Congestion Control[R]:Dept.Comput.Sci.,Univ.Texas at Austin,Nov.2000
[54]Deering S E.Multicast Routing in a Datagram Internetwork[Ph.D.dissertation].Stanford Univ.,Stanford,CA,Dec.1991.
[55]Distance Vector Multicast Routing Protocol.RFC 1812.
[56]Protocol Independent Multicast - Dense Mode(PIM-DM):Protocol Specification.RFC 3973.
[57]Protocol Independent Multicast-Sparse Mode(PIMoSM):Protocol Specification.RFC 2362.
[58]MOSPF:Multicast Extensions to OSPF.RFC 1584.
[59]Krioukov D,Fall K,Yang X.Compact Routing on Internet-Like Graph[C].in INFOCOM.Hong Kong,China:IEEE,2004:219-220.
[60]Eilam T,Gavoille C,Peleg D.Compact routing schemes with low stretch factor[J].Journal of Algorithms,2003,vol.46(3):97-114
[61]Willinger W,Alderson D,Doyle J C,et al.More "Normal" Than Normal:Scaling Distributions and Complex Systems.in Winter Simulation Conference,2004.
[62]Atkinson R,Floyd S.RFC 3869 - IAB Concerns and Recommendations Regarding Internet Research and Evolution[J].Internet Architecture Board,August 2004
[63]Cilliers P.复杂性与后现代主义[M]:上海科技出版社,2005.ISBN7-5428-3916-0
[64]Alderson,Willinger W.A Contrasting Look at Self-Organization in the Internet and Next-Generation Communication Networks[J].IEEE Communications Magazine,July,2005
[65]Prehofer C,Bettstetter C.Self-Organization in Communication Networks:Principles and Design Paradigms[J].IEEE Communications Magazine,July,2005,vol.43(7)
[66]Ravasz E b,Baraba'si A-L s.Hierarchical Organization in Complex Networks[J].PHYSICAL REVIEW E,2003,vol.67(026112)
[67]Faloutsos M,Faloutsos P,Faloutsos C.On Power-law Relationships of the Internet Topology[J].ACM SIGCOMM Computer Communication Review;1999,vol.29(4):251-262
[68]Almer C,Steffan J.Generating Network Topologies that Obey Power Laws[C].GLOBECOM San Francisco,2001:434 -438.
[69]Tian B,Towsley D.On Distinguishing between Internet Power Law Topology Generators[C].in INFOCOM New York:IEEE 2002:638-647.
[70]Chen Q,Chang H,Govindan R,et al.The Origin of Power Laws in Internet Topologies Revisited[C].in INFOCOM New York:IEEE 2002:608-617.
[71]Siganos G,Faloutsos M,Faloutsos P.et al.Power-laws and the AS-level Internet topology[J].IEEE/ACM Trans.on Networking,2003,vol.11(4):514-524
[72]Albert-László,Barabási.The Physics of the Web.2001. http://www.physicsWeb.org/article/world/14/7/09.
[73]Albert R,Barabási A.Topology of Evolving Networks:Local Events and Universality[J].Physical Review Letters,2000,vol.85(24):5234-5241
[74]Shoham Y,Wellman M.Economic Principles of Multiagent Systems[J].Artificial Intelligence,1997,vol.94:1-6
[75]Claffy K.Internet Measurement and Data Analysis:Topology,Workload,Performance and Routing Statistics.http://www.caida.org/outreach/papers/1999/Nae.
[76]Huston G.Interconnection,Peering,and Settlements[J].Internet protocol journal,1999,vol.45(3):136-152
[77]Kleinrock L,Kamoun F.Hierarchical Routing for Large Networks:Performance Evaluation and Optimization[J].Computer Networks,1977,vol.1:155-174
[78]Waxman B.Routing of Multipoint Connections[J].IEEE Journal on Selected Areas in Communications,1988,vol.6(9):1617-1622
[79]Zegura E,Calvert K,Donahoo M.A Quantitative Comparison of Graph-based Models for Internet Topology[J].IEEE/ACM Trans.on Networking,1997,vol.5(6):770-783
[80]Farrar J.C&W Routing Instability.NANOG mail archives,Apr 2001.
[81]Rcc:Routing Configuration Checker.http://nms.csail.mit.edu/bgp/rcc/.
[82]Griffin T G,Shepherd F B,Wilfong G.The Stable Paths Problem and Interdomain Routing[J].ACM/IEEE Trans.on Networking,2002,vol.10(2):232-243
[83]Osborne M-J,Rubinstein A.A Course in Game Theory.Cambridge MA:MIT Press,1994.
[84]Hsiao M T,Lazar A.A Game Theoretic Approach to Decentralized Flow Control of Markovian Queueing Networks[C].Performance.North-Holland,Amsterdam:IEEE,1988.
[85]张宇,张宏莉,方滨兴.Internet拓扑建模综述[J].软件学报,2004,vol.15(8):1220-1226.http://www.ios.org.cn/1000-9825/15/1220.htm
[86]Doar M.A Better Model for Generating Test Networks[C].GLOBECOM.London:IEEE,1996:86-93.
[87]Watts,D.J.Small World:The Dynamic of Networks between Order and Randomness[J].Nature,1999,vol.393:440
[88]The National Laboratory for Applied Network Research(NLANR) Project.http://www.nlanr.net/.
[89]University of Oregon Route Views Project.http://www.routeviews.org/.
[90]TraceRoute Project.http://www.traceroute.org/.
[91]Magoni D,Pansiot J.Internet Topology Modeler based on Map Sampling[C].ISCC Taormina:IEEE,2002:1021-1027.
[92]Lakhina A,Byers J,Crovella M,et al.Sampling Biases in IP Topology Measurements[C].INFOCOM San Francisco:IEEE,2003:332-341.
[93]Aiello W,Chung F,Lu L.A Random Graph Model for Massive Graphs[C].STOC Portland:ACM Press,2000:171-180.
[94]Barabási A,Albert R.Emergence of Scaling in Random Networks[J].Science,1999,vol.286(5439):509-512
[95]Zhou S,Mondragon R J.Towards Modelling the Internet Topology - the Interactive Growth Model.the 18th International Teletraffic Congress,2003.
[96]J.M.Carlson,Doyle J.Highly Optimized Tolerance:A Mechanism for Power Laws in Designed Systems[J].PHYSICAL REVIEW E,AUGUST 1999,vol.60(2)
[97]Doyle J,J.M.Carlson.Power Law,High Optimized Tolerance,and Generalized Source Coding[J].Physical Review Letters,June 2000,vol.84(24)
[98]Friedman E,Shenker.S.Learning and Implementation in the Internet.Preprint.
[99]GE Z,FIGUEIREDO,D J S,et al.On the Hierarchical Structure of the Logical Internet Graph.SPIE ITCOMUSA,August 2001.
[100]L.Li,Alderson D,Doyle J,et al.A First-Principles Approach to Understanding the Internet's Router level Topology.SIGCOMM ACM,2004.
[101]Alderson D,Doyle J,Willinger W.Internet Connectivity at the AS level:An Optimization Driven Modeling Approach[C].in SIGCOMM.Karlsruhe,Germany:ACM,2003.
[102]Lun L,Alderson D,Tanaka R,et al.Towards a Theory of Scale-Free Graphs:Definition,Properties,and Implication[R],October 2005
[103]Fabrikant A,Koutsoupias E,Papadimitriou.C.Heuristically Optimized Trade-offs:A new paradigm for Power- laws in the Internet[C].ICALP:IEEE,2002:110-122.
[104]Obradovic D.Real-time Model and Convergence Time of BG.INFOCOM:IEEE June,2002.
[105]Pei D,Zhang B,Massey D,et al.An Analysis of Path-Vector Routing Protocol[R],March 22nd,2004
[106]Rafit Izhak-Ratzin,Zhang B,Pei D,et al.Quantifying BGP Path Exploration in the Internet[R]:Tech.Rep.on 63th IETF,July 2005
[107]Gob K-I,Kahng B,Kim D.Cost-sharing Machanism[J].Phys.Rev.Lett,2001,vol.87
[108]Adamic L A,Lukose R M,Puniyani A R,et al.Marginal Cost Mechanism[J].Phys.Rev.E,2001,vol.64
[109]Sanders B.An Incentive Compatible on Control Algorithm for Rate Allocation in Computer Networks[J].IEEE Transactions on Computers,1988,vol.37:1067-1072
[110]Govindan R,Reddy A.An Analysis of Internet Inter-Dornain Topology and Route Stability.INFOCOM IEEE,1997.
[111]朱培栋,刘欣.推断Internet层次的有效算法[J].高技术通讯,2004,vol.14(增刊):358-361
[112]The S SFNet Project.http://www.ssfnet.org.
[113]SSFNet.http://www.ssfnet.org/Exchange/gallery/asgraph/src.tar.gz.
[114]Kurose J F,Simha R.A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems[J].IEEE Transactions on Computers,1989,vol.38:705-717
[115]Groves T,Ledyard J.Incentive Compatibility since 1972,in Information,Incentives,and Economics Mechanisms[R]:University of Minnesota Press,Minneapolis,1987
[116]Ferguson D,Nikolaou C,Yemini Y.An Economy for Flow Control in Computer Networks[C].1NFOCOM.Los Alamitos:IEEE Computer Society Press,1989:100-118.
[117]Carlson J M,Doyle J.Complexity and Robustness,[C].in Nat'l.Acad.Sci.USA,2002:2539-2545.
[118]Rosenschein,Zlotkin J G.Rules of Encounter:Designing Conventions for Automated Negotiation among Computers[C].in MIT Press.Cambridge MA,1994.
[119]Walsh W,Wellman M.A Market Protocol for Decentralized Task Allocation[C].in the Third International Conference on Multi-Agent Systems.Los Alamitos:IEEE Computer Society Press,1998:325-332.
[120]Dasgupta P,Hammond P,Maskin E.The Implementation of Social Choice Rules [J].Review of Economic Studies 1979,vol.46:185-216.
[121]Maskin E.The Theory of Implementation in Nash Equilibrium,in Social Goals and Organization:Essays in Memory of Elisha Pazner.Cambridge UK:Cambridge University Press,1985,pp.173-204.
[122]Feigenbaum J,Papadimitriou C,Shenker S.Sharing the Cost of Multicast Transmissions[J].Journal of Computer and System Sciences,2003,vol.63:21-41
[123]Moulin H,Shenker S.Strategyproof Sharing of Submodular Costs:Budget Balance versus Efficiency[J].Economic Theory,2001,vol.18:511-533