It is expected that heavy congestion occurs at a time of a severe disaster. In such a situation, traffic priority control in network elements for preferentially transferring information for rescue is important. For achieving this, service identification from IP flows in network elements is required. A method based on deep packet inspection (DPI) of multiple TLS sessions has been proposed for identifying services from IP flows. However, its analysis is extremely CPU time-consuming. In this paper, we propose a new service identification method based on the analysis of Server Name Indication (SNI). SNI is a not-encrypted field in the ClientHello message, which is transferred in the TLS session establishment. We then evaluate the proposed method and show that the proposed methods significantly reduce time to identify without a large decline in the accuracy of identification.

Recent programmable switches allow developers to profoundly optimize network elements. In this study, we introduce a concept of an application switch that supports a network application based on programmable switches. A developer can optimize not only server computers but also application switches to improve the application performance by implementing functions of the network application. We then introduce a method to apply an application switch to a database management system using the transmission control protocol (TCP). The method migrates a TCP connection from a server computer to the application switch when the switch replies to a query. The method reversely migrates it to the server computer again when a query is processed by the server. The application switch manages the TCP sequence and the Ack numbers for these migrations. In the existing work, we implemented a prototype key-value store (KVS) system based on the proposed system without TCP Ack management. We then showed the potential of the method. In this paper, we show the problem of the prototype system of Ack management and propose a method for solving the problem. In addition, we evaluate the resolved method and demonstrate its effectiveness.

This paper provides an overview of tourist information distribution system that sends information corresponding to places and times. We completed the system successfully, although it is difficult to clearly extract information of the date, time, place, and event name from non-structured data written in natural language such as the language used on the SNS. We evaluated how many pieces of information are collected.

Many services, such as email, video sharing, and social networking service (SNS), are provided on the Internet. Service identification from given flows is important for various purposes. For example, a severe congestion occurs in disasters and priority control is required for transmitting important information, such as requests for rescues, in that case. Identification of the service of a traffic in network elements achieves this control. The most simple way to identify is that based on IP addresses and port numbers. However, the accuracy of this way is not sufficient. A method for identifying service based on analyzing multiple TSL sessions without using IP addresses and port numbers was proposed. This method clusters TLS sessions according to the 2-gram frequencies of unencrypted parts, which are the fields in handshake messages transmitted at session establishing. However, the existing work did not discuss the effect of each field of the TLS protocol. In this paper, we analyze the ability to cluster of each field. We investigate the ability to cluster sessions of all the unencrypted fields of the handshake messages. We then reveal that some fields do not have the ability. We discuss methods for improving the existing method based on these finding.

Current network switches cannot be programmed and flexibly controlled. Then, developers of a data center application system, which is composed of software and computers connected with a network, are not able to optimize behavior of network switches on which the application is running. On the other hand, Deeply Programmable Network (DPN) switches can completely analyze packet payloads and be profoundly programmed. In our previous work, we introduced an application switch based on DPN. The switch was able to be deeply programed and developers could implement a part of functions of a data center application in the switch. The switch deeply analyzed packets, which is called Deep Packet Inspection (DPI), and provided some functions of the application in the switch. However, the switch did not manage connection and not support communication with TCP. In this paper, we proposed a method for constructing an application switch supporting TCP based communication. The method analyzes IP headers, TCP headers, and payloads of packets. When the switch detects a request which the switch supports, the switch replies according to its TCP session. We then introduce our implementation and evaluate performance of our application switch. Our evaluation has demonstrated that our switch has been able to improve performance of the data center applications.

Large scale applications in data centers are composed of computers connected with a network. Traditional network switches do not perform routing based on packet contents. Thus, packets cannot be transmitted to the optimal computer for the request which is written in the packet payload. On the other hand, Deeply Programmable Network (DPN) switches can completely analyze packet payloads and perform routing based on their contents. In this paper, we focus on packet routing based on Deep Packet Inspection (DPI), i.e. analyzing packet payload, using DPN switches, and discuss performance of applications on a network using application aware DPN switches. We introduce application aware network and propose a method for improving application performance with DPN switch support. We evaluate our method with the several applications and show that our method can increase application performance.

This paper shows the effectiveness of the system that controls the network route based on social information. An automatic route control is performed with the network virtualization node FLARE that uses VLAN coupling between each base of the wide area network test bed called JGN-X as a platform.

To achieve network availability in disaster situations, we propose the traffic control system based on SNS information. In order to utilize the data of packet payload obtained from SNS, Deeply Programmable Network (DPN) is needed. In this paper, we implement and evaluate the proposed method with FLARE switch and achieve more flexible control of the network.

The packet cache router enabling the packet-level redundant data elimination is effective to reduce the P2P swarm traffic traversing ISP inter-domain links. To deploy the packet cache router in the ISP networks, the high performance packet processing is required. In this paper, we implement a packet cache router by a multi-core network processor using fast path/slow path application structure and evaluate its performance.

The continuous growth of P2P traffic imposes a large burden on ISP network operation. To reduce P2P traffic, the redundancy elimination using P2P packet cache scheme is effective since P2P swarm contains the high redundancy. We have developed the P2P shared packet cache architecture. We have validated the basic operations of the proposed architecture on Emulab [1], [2]. In this demo, we present the test platform desirable to perform the in-network P2P cache processing together with the scalable generation of the user clients. The test network can be created on the programmable virtualized slice network by VNode which has been developed for the future network study [3]. To enable the emulation of the scalable user access, VM clustered overlay network is integrated with the slice network. Using the virtualized test network platform, we demonstrate the effectiveness of the P2P cache processing.

The current interdomain routing protocol, BGP, is not resilient to a path failure due to its single-path and slowly-converging route calculation. This paper proposes a novel approach to improve the resilience of the interdomain communication by enabling a set of ASes to form an alliance for themselves. The alliance members cooperatively discover a set of disjoint paths using not only the best routes advertised via BGP but also the ones unadvertised. Since such a set of disjoint paths are unlikely to share a link or an AS failure, a member AS can provide a pair of the other members with a transit to circumvent the failure. We evaluate how many disjoint paths we could discover from both advertised and hidden (unadvertised) routes by analyzing publicly available BGP route data. Our feasibility study indicates that an alliance of ASes can establish a set of disjoint paths between arbitrary pair of its alliance members to improve the resilience of interdomain routing among the members.

The end-to-end QoS of streaming video on a joint metro and access network is investigated. SUCCESS DWA PON is a highly scalable broadband access network, which can bridge current TDM PON and future WDM PON smoothly and cost-effectively. The IEEE 802.17 Resilient Packet Ring is an emerging MAN standard that designs for efficient packet-based traffic transmission over rings. A realistic video service model is constructed on this joint network, where one of the RPR nodes is dedicated to feed VBR video streams to the end-users in the presence of self- similar Internet traffic. Two improvements are proposed to improve the observed shortcomings in the video streaming performance. To improve the QoS of the streaming video, an additional transit queue is added in the RPR mode to reduce end-to-end delay. In addition, the RPR fairness algorithm is modified to improve the class-C traffic throughput. Simulation results show combined video QoS and total throughput enhancement with the proposed modifications.

Novel line codes combined with WDM techniques allow simple and cost-effective overlay of higher bitrate services in existing fiber optical access networks. The solution leaves the existing services and field-deployed fibers untouched. The design of the spectral shaping line codes is presented, along with the analyses for different code rates and processing window sizes. The computation can be simplified by employing vector quantization for the trigonometric functions. DC balance is achieved by forwarding the DC residual to the following window. The spectral shape can be manipulated in various ways to optimize the system performance. Experiments have been conducted to demonstrate and compare several different optimized line codes. For a specific tolerable interference level, the optimal line code can easily be determined which maximizes the data throughput. The service overlay by the line coding technique provides a very flexible and economic way to upgrade existing passive optical networks.

We propose a new architecture called Statistical Lambda Multiplexing Network (SLAMNet) for a future photonic network multiplexing hundreds wavelengths. The major objective of the SLAMNet is efficient use of network resources such as wavelengths and facilities. In the SLAMNet, optical channel (OCh) paths are managed in two logical layered networks in order to adapt to wide-range time-scale variations of offered traffic load. Based on the architecture, we also suggest an adaptive OCh path assignment mechanism that works without signaling processes. In this paper, we describe the proposed architecture and path assignment mechanism and furthermore, numerically evaluate their effectiveness.