Implementation of a Network Provisioning System with User-driven and Trusty Protection Management

Proper management on user-driven virtual circuits (VCs) is essential for seamless operation of virtual networks. The Network Provisioning System (NPS) is useful software for creating user-driven VCs automatically and must take fault management into account for physical layer impairments on user-driven VCs. This paper addresses a user-driven and trusty protection management in an NPS with an open standard Network Service Interface (NSI), as a contribution to show how to implement the user-driven and trusty protection management required for user-driven VCs. In particular, it provides a RESTful web service Interface for Configuration and Event management (RICE) that enable management of a distinguished data and control plane VC status between Network Service Agents (NSAs) in the event of a node or link fault and repair in a domain. This capability represents a contribution to show how network and protection events in a domain can be monitored between NSAs (NPSs with the NSI) in multiple domains. The implemented NPS controls and manages both the primary and backup VC with disjoint path in a user-driven manner. A demonstration to verify RICE API's capability is addressed for the trusty protection in the dynamic VC network

Number of tunable wavelength converters and internal wavelengths needed for cost-effective design of asynchronous optical packet switching system with shared or output fibre delay line buffer

Optical packet switching (OPS) is being considered as one of the switching technologies for a future optical internet. For contention resolution in an optical packet switching (OPS) system, the wavelength dimension is generally used in combination with a fibre delay line (FDL) buffer. In this study, the authors propose to reduce the number of tunable wavelength converters (TWCs) by sharing TWCs for cost-effective design of an asynchronous OPS system with a shared or an output FDL buffer. Asynchronous and variable-length packets are considered in the OPS system design. To investigate the number of TWCs needed for the OPS system, an algorithm is proposed, which searches for an available TWC and an unused internal wavelength, as well as an outgoing channel. This algorithm is applied to an OPS system with a shared or an output FDL buffer. Also, the number of internal wavelengths (i.e. the conversion range of the TWC) needed for an asynchronous OPS system is presented for cost reduction of the OPS system

하이브리드형 버퍼를 위해 제한된 수의 튜닝가능한 파장변한기와 내부 파장을 갖는 광 패킷 스위치

A hybrid buffer structured optical packet switch and its scheduling algorithm are presented for a limited number of tunable wave length convertors (TWCs) and internal wave lengths. The hybrid buffer consists of the fiber delay line(FDL) buffer and the electronic buffer. With the proposed algorithm, it could lead realizable packet loss reduction that the LAUC-VF alg orithm with only the FDL buffer does not reach. Also, we optimized the number of TWCs and internal wave lengths of the hybrid buffer structured OPS. For the fully shared TWC structure, the optimum number of TWCs and internal wave lengths to guarantee minimum packet loss is evaluated to prevent resource waste under the hybrid buffer

Virtual-node-based multicast routing and wavelength assignment in sparse-splitting optical networks

This paper investigates several problems associated with optical multiicast routing and wavelegnth assignment n sparse-splitting optical networks for interactive real time media distribution. Unfortunatedly, the constrained multicast routing with optimized wavelength assignment leads to NP complete condition. Thus, in this paper, a virtual node based multicast routing algorithm is first proposed to satisfy thr requirements of interactive real time multicastin

Anchor-Less Producer Mobility Management in Named Data Networking for Real-Time Multimedia

Information-centric networking (ICN) is one of the promising solutions that cater to the challenges of IP-based networking. ICN shifts the IP-based access model to a data-centric model. Named Data Networking (NDN) is a flexible ICN architecture, which is based on content distribution considering data as the core entity rather than IP-based hosts. User-generated mobile contents for real-time multimedia communication such as Internet telephony are very common these days and are increasing both in quality and quantity. In NDN, producer mobility is one of the challenging problems to support uninterrupted real-time multimedia communication and needs to be resolved for the adoption of NDN as future Internet architecture. We assert that mobile node’s future location prediction can aid in designing efficient anchor-less mobility management techniques. In this article, we show how location prediction techniques can be used to provide an anchor-less mobility management solution in order to ensure seamless handover of the producer during real-time multimedia communication. The results indicate that with a low level of location prediction accuracy, our proposed methodology still profoundly reduces the total handover latency and round trip time without creating network overhead

Cache Performance Investigation in NDN for Large Scale Scientific Data

Named-Data Networking (NDN) is the most active instance of Information-centric Networking (ICN) having a very active research community. NDN is racing for the future Internet architecture by removing dependence on IP addresses, location, and host-to-host communication model. The communication paradigm in NDN revolves around the content/data by naming the content, securing it instead of the channel, and retrieving the content by its names and not the IP address of the machine that hosts the data. NDN has lots of benefits for large scale scientific data as it has very expressive naming support, access control, and enhanced delivery performance compare to traditional IP based networking. NDN supports in-network caching that highly enhances the performance of NDN by reducing latency and network congestion through retrieving popular contents from nearby caches. Considering its importance, we in this work investigate the performance of in-network caching for large scale scientific data. We infer from our simulation results that the optimal cache size and the percentage of the cache hit depend on multiple parameters i.e. traffic pattern, traffic load, and cache replacement policies as proved with simulation results