No description available.

viii, 102 leaves : ill., 3 pams in back pocket / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.) from the Dept. of Mathematics, University of Adelaide, 1968

Internet connectivity takes a strategic importance for a growing number of companies. Therefore, for reliability and performance reasons, many Internet service providers and corporate networks connect to at least two providers, a practice called multihoming. However, the current multihoming mechanism contributes to the explosive growth of the Internet routing tables. This growth has major implications for routers on storage requirements, protocol overhead and stability, and forwarding performance. As a consequence, the traditional way to be multihomed in IPv4 is prevented in the next generation IPv6 Internet. Many approaches for IPv6 multihoming were proposed, with little consideration for traffic engineering aspects. The aim of the thesis is to bridge this gap. The thesis investigates the way to best provide traffic engineering for IPv6 multihomed sites. It first demonstrates that Host-Centric multihoming, the foreseen approach for IPv6 multihoming, is the most promising in terms of fault-tolerance and traffic engineering capabilities. Compared to traditional multihoming approaches, our simulation results show that Host-Centric IPv6 multihomed sites are able to obtain lower delays by leveraging the path diversity that underlies the Internet. Unfortunately, no traffic engineering mechanism is available for this multihoming approach. Therefore, this thesis next presents a technique to effectively use the multiple interdomain paths that exist between multihomed sites. The proposed mechanism allows the multihomed sites to control how their flows are distributed over the links with their providers. The mechanism is able to take into account complex and very dynamic routing policies. Finally, the thesis proposes the use of synthetic coordinates as a scalable and efficient way to help hosts in selecting the interdomain paths with the lowest delays. Experimental results with real measurements show that this mechanism allows sites to avoid all paths with really bad delays, and to most often select the lowest delay path.

In a few years, the Internet has quickly evolved from a research network connecting a handful of users to the largest distributed system ever built. The Internet connects more than 20,000 Autonomous Systems (ASs) which are administratively independent networks. While the initial Internet was designed to provide a best-effort connectivity among these ASs, there is nowadays a growing trend to deploy new services such as Voice/Video over IP or VPNs. To support these emergent services, ASs need to better engineer their Internet traffic. Traffic Engineering encompasses several goals such as better spreading the traffic load inside a network and obtaining better end-to-end performance (lower latency or higher bandwidth).<br><br> Engineering the traffic inside a single AS is feasible and pretty well understood. To the opposite, interdomain traffic engineering is still a difficult problem. The main issue comes from the current Internet routing architecture, articulated around the Border Gateway Protocol (BGP). BGP propagates a subset of the Internet topology for scalability and stability reasons and does not optimize a single global objective. This limits the control each AS has on its routing and has dramatic implications for interdomain traffic engineering.<br><br> In this thesis, we evaluate the primitive BGP-based routing control mechanisms. For this purpose, we designed and implemented a new approach for modeling BGP on large Internet-scale network topologies. Finally, to overcome the limitations of BGP in terms of routing control, we propose Virtual Peerings, a new mechanism based on a combination of BGP and IP tunneling. We apply Virtual Peerings to solve various interdomain traffic engineering problems such as balancing the load of Internet traffic received by an AS or decreasing the end-to-end latency of Internet paths.

Thesis (M.U.D.)--University of Hong Kong, 1994. / Includes bibliographical references (leaves 158-159).

published_or_final_version / abstract / toc / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

No description available.

No description available.

No description available.

No description available.