IoT remote control is faced with scalability, secure communication and privacy preservation issues and conventional solutions (HTTPS) have disclosed poor scaling problem and privacy concerns. In this paper, we propose a novel lightweight and secure IoT remote monitoring mechanism using DNS with privacy preservation. Basically, the communication between IoT devices and gateways uses the conventional protocols as usual such as CoAP and MQTT while only the remote monitoring uses DNS protocol. That is, encrypted IoT data, after being encoded with base64, is stored as a DNS TXT record of the domain name of the IoT device and only the designated users are allowed to query and decrypt the data based on TSIG authentication of DNS protocol and asymmetric cryptography. We implemented a prototype system over name-bound virtual networks (NBVNs) in which all virtual nodes are registered in DNS automatically and the network traffic is restricted within each NBVN. Through the preliminary evaluations we confirmed the effectiveness of secure communication and privacy preservation in IoT remote monitoring in the proposed mechanism.

In this paper, we propose a mechanism for autoconfiguration of name-bound virtual networks (NBVNs) for Internet of Things (IoT). Some IoT standardization groups have defined APIs for IoT device communications, in which they indicate the correspondent nodes and resources by names. However, current technologies for the construction of Virtual Networks (VNs) rely on VLANs, IP routing, and OpenFlow control, thus they do not provide a name-based solution. Our proposal fills this gap. We first define business players that construct and use the NBVNs. They are Application Service Provider (ASP), Virtual Network Operator (VNO), and Infrastructure Provider (InP). We then specify the roles of ASP/VNO/InP, including the tasks that must be performed by their managers, and the required interactions for the purpose of autoconfiguration. Subsequently, we describe the system we developed to implement the operations of ASP/VNO/InP and thus construct NBVNs automatically. For each NBVN, the required IPv6 addresses are automatically allocated and assigned to the network nodes, including the IoT devices. Moreover, data forwarding and name resolution mechanisms are also configured automatically. Thus, the proposed system constructs area-and/or time-bound VNs for offering network services to event-centric IoT applications, such as outdoor concerts and sporting events. Finally, we demonstrate that the constructed NBVNs are capable to configure thousands of addresses and name entries within a minute, thus IoT devices can communicate among them by using their correspondent node names instead of their addresses. Moreover, both ASP and VNO can operate the servers, switches, and routers pertaining to the NBVNs by also using their names.

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.

We propose a method of constructing a layer 3 (L3) network that consists of a large number of virtual machines (VMs) for a large-scale IoT emulation testbeds by utilizing Hierarchical/Automatic Number Allocation Protocol (HANA). The L3 network consists of several subnets, and suppresses the number of MAC addresses that must be distinguished from each other. HANA releases a burden of an L2 switch, compared to a flat L2 network. In addition, a network failure is restricted to a subnet. HANA also simplifies configuration of VMs in each physical machine (PM) by making MAC addresses and names of the VMs common among the PMs. The method of constructing the L3 network by HANA provides researchers with a large-scale IoT emulation testbed, which is easy to construct and extensible, and supports multihoming and renumbering. Researchers can define VMs as IoT devices and cloud/edge/fog computing servers, and perform various experiments on the testbed.

A low-latency and reliable message switching network is critical for constructing high-speed datacenter networks. In this paper, we present the design, implementation, and evaluation of a novel Location basEd Source Switching (LESS) for datacenter networks. LESS enables lightweight source switching through a location-based addressing scheme. Each switch and host can independently derive a source route to reach a destination without requiring the full knowledge of the network topology. We demonstrate that using location-based source routes as forwarding labels allows LESS to eliminate the need for routing tables and integrate with minimum required functionality for packet forwarding. Moreover, we propose a fast rerouting solution to address the issue of fault tolerance in source routing. Each switch can locally derive an alternative source route during a failure. The paper evaluates the performance of LESS. Our evaluation results suggest that LESS improves the performance of datacenter networks in terms of latency, throughput, and reliability.

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.

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%.

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.

Hierarchical address allocation and hierarchical routing design has long been suggested to reduce the forwarding information base (FIB) size in the Internet core. However, the hierarchical design is not put into practice. We implemented the hierarchical and automatic number allocation (HANA) protocol for allocation of IPv4 and IPv6 address spaces to autonomous systems (ASes) and the FIB size reduction. The HANA protocol allocates multiple address spaces to an AS from the upper ASes. Multihoming using multiple addresses provides an AS with multiple paths. That is, detour paths are inevitably prepared in advance, even when a network failure does not occur. In this paper, we provide the highest flexibility to HANA-based networking, namely, supporting variable-length addressing scheme. The variable-length addressing schemes suppress renumbering caused by the address space extension that occurs in the fixed-bit-length addressing schemes. In addition, we propose a new function of exchanging allocated numbers, and implement it in the current HANA system. The flexible HANA system provides locator allocation with low renumbering costs and realizes scalable addressing in future internetworking.

Domain Name System (DNS) is the most widely used name resolution system for computers and services in the Internet. The number of domain name registrations is reaching 276 million across all top level domains (TLDs) today and the DNS query count is increasing year over year. The main reason of the high DNS query count is the increase of out-of-bailiwick domain name delegation since it (NS without glue A record) makes the client send extra DNS queries for the glue A record. On the other hand, the master/slave model is not compatible with address renumbering in DNS since the master is indicated by its IP address in the slave. Thus it is necessary to redesign the current DNS protocol considering lower name resolution latency as well as the enhancement of automatic convergence after the address renumbering for the effective and sustained name resolution service. In this paper, we propose two mechanisms: one is the secure glue A cache and update to reduce the name resolution latency by cutting the DNS query count with low security risk, the other is the automatic zone transfer which automatically recovers the DNS based on FQDN (Fully Qualified Domain Name) after address renumbering. We successfully implemented the prototype in Linux as an extended form of BIND (Berkeley Internet Name Domain). The evaluation results confirmed approximately 25% down of the DNS query count and the successful automatic DNS recovery after address renumbering.

We newly developed a layer 3 switch prototype that has one 100 Gbps optical packet interface and twelve 10 GbE interfaces. This is a gateway node to the optical packet switched network. While similar nodes made by the authors just have conversion capability from/to Ethernet frames to/from optical packets, this switch provides full layer 3 switching capability among the 13 ports, namely, packets incoming from any input port can be sent to any output port via destination IP address lookup. We show 12,000 prefixes are looked-up and 4,000 destination addresses of optical packets are added as a result of the lookup. We also show that the layer 3 switch is connected to the access line to the Internet.

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.

We have proposed an optical packet and circuit integrated (OPCI) network which provides over Tbps capacity with low power consumption by optical technologies and deals with diversity of services from best-effort service to quality of service guaranteed service by packet and circuit switching schemes. Recently, we developed an integrated optical packet and circuit switch (OPS/OCS) node and constructed an OPCI ring network testbed. The integrated OPS/OCS node has a function to encapsulate Internet Protocol (IP) packets coming from client networks into optical packets. In this paper, we discuss about how to incorporate OPCI networks into current IP-based wide area networks. For the first time, we experimentally demonstrate an OPCI network testbed incorporated into a multihomed network where IP addresses are hierarchically allocated. The multihomed network provides multiple links with different characteristics such as a 100 Gbps optical packet link for high capacity and shared bandwidth services, a 10 Gbps optical path link for high quality and dedicated bandwidth services, and a 10Gbit Ethernet link for low cost services. Therefore, users can choose adequate link technologies according to application or traffic conditions. We successfully verify that high definition video data is efficiently transported by switching link technologies in the multihomed network.

BGP table size and update rate have increased dramatically in the last decade. The rate of the growth poses great demand on memory size and CPU speed of the router control processor. Hierarchical Automatic Addressing (HAA) reduces BGP table size and update rate by enabling prefix aggregation for multihomed ASes. However, the aggregation blocks routing information of individual ASes, and causes the routing system fails to react to failures. In this paper, we propose a resilient routing protocol referred to as Routing with Detour (RD) to address the problem. RD provides resilient routing under HAA, and it reacts to failures in a timely manner without modifying BGP. Our experiments with realistic AS topology show that RD has slight impact on HAA's performance. More precisely, HAA with RD can reduce BGP table size and update rate by more than 90%.

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.