Search

Hierarchically structured addresses have been proposed to improve the scalability of the Internet. However, the crucial component and primary challenge of hierarchical addressing is the locator selection because the number of locators could be unmanageably large. In this paper, we propose two methods to select and allocate locators. The first method can reduce the number of locators and Forwarding Information Base (FIB) entries, but it fails to address the path stretch problem. In the second approach, we leverage hierarchical address allocation and flat identifiers to efficiently represent locators. Provider-based locators can be aggregated to reduce the number of FIB entries, while provider-independent locators can help to reduce path stretch. We investigate the performance and efficiency of the two approaches by performing a large-scale measurement based on today's Internet topology. Our evaluation shows that the second approach could reduce the number of locators with small path stretch.

The current Internet has followed a location-based communication paradigm, where IP addresses play a significant role not only in locating hosts or in the routing system, but also in the identification of hosts and services. The location-based, host-centric Internet architecture is not efficient and scalable for newly emerged mobile communications in heterogeneous networks and devices. Therefore, research and development of future networks has been shifting to the identifier (ID)-based communication paradigm where IDs, not only the locators, of communication objects, such as devices, users, contents, or services, play significant roles in networking. These IDs are used for the purpose of identification, authentication, and discovery of the communication objects, as well as delivery of services. In this paper, we first present a generalized ID-based communication framework and then show how the recently proposed ID/locator split-based networking and information-centric networking architectures fit into the framework. We then summarize key capabilities and technical challenges brought about by these new proposals, and also present some approaches to possible solutions.

To enable billions of devices to communicate with each other simultaneously, small end-to-end latency and high scalability and reliability are the essential characteristics for the Internet of Things (IoT). The transition from today's Internet to IoT has demanded a new information and communications infrastructure. In this paper we implement and deploy a scalable and reliable inter-domain infrastructure, LORIF proposed in our previous work, to meet the requirements of IoT. Based on two local network testbeds and an intercontinental network testbed, we evaluate the scalability, resilience, and mobility of LORIF. The results demonstrate that LORIF can provide low end-to-end latency and high scalability and reliability.

Hierarchical addressing and locator/ID separation solutions have been proposed to address the scalability issue of the Internet. However, how to combine the two addressing schemes has not been received much attention. In this paper, we present an address encoding method to integrate hierarchical addressing and locator/ID separation. Our analysis and evaluation results show that the proposed encoding method could guarantee the scalability property, and alleviate the inefficiency of address space.

The Internet is facing the accelerating growth of routing table size. Backbone routers' routing table has already reached 512k entries, which has a negative effect on the scalability of the Internet. Hierarchical addressing and locator/ID separation solutions have been proposed to address the scalability issue. However, there has been little focus on how to efficiently represent hierarchical location addresses for a large scale distributed network, such as today's Internet. In this paper, we present a variable-length address encoding method to represent hierarchical location addresses. Our analysis and evaluation results show that 1) it is difficult to use fixed-length encoding to represent hierarchical location addresses for a large scale network; and 2) the proposed variable-length addresses could guarantee the scalability property of hierarchical addressing, and alleviate the inefficiency of address space due to fixed-length addresses.

As the Internet of Things technologies evolve, billions of smart devices will be connected to the Internet. Therefore, the accelerated growth of users, applications and devices pose a great demand on the scalability of the Internet. In this paper, we develop a new Internet architecture -- Multiple-inherited Locators (MiL) -- to meet the future demand on addressing. MiL is based on Locator/ID addressing and hierarchical address allocation. The benefit of this new addressing scheme is the improved scalability of Internet routing by enhancing the prefix aggregation of locators. The number of locators which are needed grows with the Internet scale. In order to represent each locator as a unique binary representation by as few bits as possible, we develop a distributed encoding method to efficiently encode locators. As the Internet topology evolves, the distributed encoding method renumbering locators' codeword for the optimal encoding performance, and meanwhile endeavors to keep their codewords unchanged as much as possible. Because, we want to represent locators by fewer bits as well as keep addressing stable. We adopt an Encoding Table Adjustment algorithm to find a "sweet spot" that balances these two goals. According to our experiment, within a 2% increase on the expected locator length, our algorithm reduces the cost of renumbering locator by 99.9%.

This paper proposes route advertisement policies (RAP) for the Border Gateway Protocol (BGP) with provider aggregatable (PA) addressing. The proposed RAP takes the advantage of address aggregation opportunity. If multiple address spaces are allocated to each of autonomous systems (ASes) that are multihomed to multiple upper ASes, reduction of the Forwarding Information Base (FIB) and quick convergence are achieved. However, multihoming based on PA addressing poses two limitations. One, more specific address information is hidden due to address aggregation. Two, multiple allocated address spaces per AS cause an address selection problem. To cope with these two limitations, we propose RAP to ensure connectivity among ASes with fewer routes installed in the FIB of each top layer AS. We implement the proposed RAP in an emulation environment with BGP (using the Quagga software suite) and our developed Hierarchical Automatic Number Allocation (HANA) protocols. We use HANA as a tool to automatically allocate hierarchical PA addresses to ASes. We confirm that with our proposed policies the FIB and RIB (Routing Information Base) sizes in top layer ASes do not change with the increase of stub ASes, and number of exchanged BGP update messages are reduced up to 67.3% than that of the case with conventional BGP RAP.

Limitations are found in the recent Internet because a lot of functions and protocols are patched to the original suite of layered protocols without considering global optimization. This reveals that end-to-end argument in the original Internet was neither sufficient for the current societal network and nor for a sustainable network of the future. In this position paper, we present design guidelines for a future network, which we call the New Generation Network, which provides the inclusion of diverse human requirements, reliable connection between the real-world and virtual network space, and promotion of social potentiality for human emergence. The guidelines consist of the crystal synthesis, the reality connection, and the sustainable & evolutional guidelines.

The Internet is facing the double-challenge of accelerating growth of routing table size and ever higher reliability requirements. Considerable progress has been made toward the scalability and reliability of the Internet. However, most of the proposals are only partial solutions that address some of the challenges. In this paper, we present a new addressing encoding scheme and a corresponding forwarding mechanism for Internet routing to solve the aforementioned problems. Underlying our design is a succinct data structure that allows us to compactly embed a set of addresses into packet headers. At the same time, the structure allows the data plane to efficiently extract multiple address information for the same destination without decompression. We provide time and space complexity analysis, and present experimental results evaluating the performance of our encoding method. It shows that the proposed encoding method can achieve a good compression factor without degrading packet-forwarding performance.

Due to the continuously expanding scale of the Internet and increasing demand for highly available networks, there is strong desire for provider-aggregatable (PA) addressing and the accompanying multi-address-based multihoming scheme, which can efficiently reduce the size of the global routing table in core routers and boost the availability of networks. The growing demands on PA addressing (e.g., address space allocation, renumbering) will require that network service providers (NSPs) put more efforts into addressing-related management tasks in the future. To relieve NSPs from the complex tasks and heavy burden of manual operation, in this paper we introduce an inter-autonomous system (inter-AS) address space (re)allocation planning scheme (ASAP) in the context of hierarchical automatic address number allocation (HANA). By introducing multiple functionalities, (i) chained request, (ii) defragmentation with the minimum renumbering overhead, and (iii) parallel Probe/Reservation processes, into HANA, HANA/ASAP offers NSPs an easy-to-use and powerful tool supporting inter-AS automated address space (re)allocation adjustment in a distributed manner. Simulations have been conducted to observe the effect of HANA/ASAP in PA from the aspects of address efficiency, address conservation, and renumbering overhead.

A Hierarchical Automatic Number Allocation (HANA) protocol, which allocates locators to ASes hierarchically, is one solution for the problem of BGP table increase. We describe hierarchical inter-AS locator allocation by HANA and emulate locator allocation on a huge-scale network consisting of 10,000 ASes, which are extracted from the actual Internet topology. We prove that locator allocation was accomplished only within 13 seconds and traffic yielded by the HANA control messages is only 1.4 Kbps for each session in average. This shows that the HANA protocol allocates locators on a 10,000-scale hierarchical network.

In this paper, we clarify problems related to QoS guarantee and multicasting on the Internet, and suggest principles of solving the problems and implementing QoS guarantee and multicasting at the same time by means of integrating multicasting and QoS guarantee for a New-Generation Network (NwGN). These principles also simplify QoS/multicast routing protocols.

IP Multicast has attracted a lot of attention as a cost-effective data delivery technique for music and video broadcasting services. Unfortunately, because most Internet Service Providers don't support IP multicast routing, end-to-end IP multicast is not well supported by the Internet. Therefore we propose a multicast routing method called MAPT (Multicast Address and a port Translation) which uses an address translation technique that converts IP addresses and UDP port numbers. We also propose a signaling method for MAPT which configures routing tables and port translation tables automatically. We discuss how to update the routing information flexibly to handle changes in the destination address and network topology. Furthermore, we implement prototype software of MAPT for the public wireless LAN service called "MIAKO-NET", which is a commercial wireless LAN service provided in Japan. We then describe "MIAKO-CAST" which realizes multicast streaming delivery through MIAKO-NET and the Internet.

A new service model of public wireless Internet access, called autonomous distributed public wireless Internet access, is presented. In the service model any volunteer with broadband Internet access lines can provide his access points for public service without any fear of malicious use. A user of such service is assumed to have his own account on a authentication server at home in the Internet, and all the Internet access through any of those access points can be treated as if it is from the home. In this paper, we present how the autonomous distributed Internet access services can be securely provided with the combinations of two aspects: treatment of authentication transactions at access points and data path of communication transaction.

The purpose of this paper is to implement a mechanism, that a wireless mobile terminal can utilize multiple wireless base stations simultaneously and have access to the IPv6 Internet via them, under the environment where it receives different waves from them. For this purpose, we adopted LIN6 as a mobility-transparent protocol, and implements the following functions by adding extensions to LIN6; 1) a LIN6 node can utilize the multiple prefixes received from multiple wireless base stations, and 2) the delays of sending TCP SYN and SYN+ACK are reduced by means of improving the procedure of getting location information

We extend the mobile network architecture protocol "LIN6", to support multihoming, and design a new application program interface (API) that enables an application to support multihoming. The LIN6's addressing architecture makes it possible to support what we call end-to-end multihoming without any inconsistency. In end-to-end multihoming, a fault-tolerant connection can be achieved relying not on routers but on the pair of end-nodes only. The new APIs make it easy to write an application that supports multihoming and robust connections. The extension to the LIN6 protocol and the new APIs give the capability of multihoming to the LIN6 protocol.

We have designed and implemented an Internet broadcasting system using QoS multicast routers. The routers has been developed as a prototype of our research project and that are equipped with SRSVP as a resource reservation and multicast signaling protocol. The system we have designed here can broadcast input video streams, and can also relay and edit video streams transmitted by other stations. We have defined "ibcast URI," which describes parameters required for receiving broadcast streams as an URI on the Web. A receiver can start to watch any program by only clicking its URI on the time table on his Web browser.