Simulation Analysis for Multicast Context Delivery Network Mobility Management

The objective of this paper is to presents analyses for multicast network mobility management using NS3. It is mainly to verify the proposed network architecture and its activities.  NS3 is a network simulator that implements virtually network prototype that is close to real implementation. Network mobility management has become a popular topic in networking research due to its ability to mitigate mobile IPv6 problems. However the standard network mobility management only introduced to support unicast traffic. Hence this paper integrates context transfer and multicast fast reroute, and implements this integration to the standard network mobility management. This implementation enables multicast to network mobility management with high network performance support. The analyses focus on the throughput performance. The analyses of this simulator are hereby presented

Mathematical evaluation of context transfer and multicast fast reroute in multicast enabled network mobility management

Internet applications such as web based monitoring; live internet video, online video, video conference, webcam viewing and internet video to TV are highly used in today’s IP communication. The trends of these applications are, that they are played on mobile devices and distributed to many end users. Multicast communication over IP contributes to the end users applications distribution. It has been discovered by a CISCO research that mobile multicast traffic will soon reach zetabyte in 2019. The aim of this paper is to introduce new method that enable multicast in network mobility management. The new method is using context transfer and multicast fast reroute technique. The proposed method is quantitatively evaluated in terms of packet loss and service recovery tim

Recursive SDN for Carrier Networks

Control planes for global carrier networks should be programmable (so that new functionality can be easily introduced) and scalable (so they can handle the numerical scale and geographic scope of these networks). Neither traditional control planes nor new SDN-based control planes meet both of these goals. In this paper, we propose a framework for recursive routing computations that combines the best of SDN (programmability) and traditional networks (scalability through hierarchy) to achieve these two desired properties. Through simulation on graphs of up to 10,000 nodes, we evaluate our design's ability to support a variety of routing and traffic engineering solutions, while incorporating a fast failure recovery mechanism

Smart Sensor Technologies for IoT

The recent development in wireless networks and devices has led to novel services that will utilize wireless communication on a new level. Much effort and resources have been dedicated to establishing new communication networks that will support machine-to-machine communication and the Internet of Things (IoT). In these systems, various smart and sensory devices are deployed and connected, enabling large amounts of data to be streamed. Smart services represent new trends in mobile services, i.e., a completely new spectrum of context-aware, personalized, and intelligent services and applications. A variety of existing services utilize information about the position of the user or mobile device. The position of mobile devices is often achieved using the Global Navigation Satellite System (GNSS) chips that are integrated into all modern mobile devices (smartphones). However, GNSS is not always a reliable source of position estimates due to multipath propagation and signal blockage. Moreover, integrating GNSS chips into all devices might have a negative impact on the battery life of future IoT applications. Therefore, alternative solutions to position estimation should be investigated and implemented in IoT applications. This Special Issue, “Smart Sensor Technologies for IoT” aims to report on some of the recent research efforts on this increasingly important topic. The twelve accepted papers in this issue cover various aspects of Smart Sensor Technologies for IoT

Online Multicast Traffic Engineering for Software-Defined Networks

Previous research on SDN traffic engineering mostly focuses on static traffic, whereas dynamic traffic, though more practical, has drawn much less attention. Especially, online SDN multicast that supports IETF dynamic group membership (i.e., any user can join or leave at any time) has not been explored. Different from traditional shortest-path trees (SPT) and graph theoretical Steiner trees (ST), which concentrate on routing one tree at any instant, online SDN multicast traffic engineering is more challenging because it needs to support dynamic group membership and optimize a sequence of correlated trees without the knowledge of future join and leave, whereas the scalability of SDN due to limited TCAM is also crucial. In this paper, therefore, we formulate a new optimization problem, named Online Branch-aware Steiner Tree (OBST), to jointly consider the bandwidth consumption, SDN multicast scalability, and rerouting overhead. We prove that OBST is NP-hard and does not have a $|D_{max}|^{1-\epsilon}$-competitive algorithm for any $\epsilon >0$, where $|D_{max}|$ is the largest group size at any time. We design a $|D_{max}|$-competitive algorithm equipped with the notion of the budget, the deposit, and Reference Tree to achieve the tightest bound. The simulations and implementation on real SDNs with YouTube traffic manifest that the total cost can be reduced by at least 25% compared with SPT and ST, and the computation time is small for massive SDN.Comment: Full version (accepted by INFOCOM 2018

Segment Routing: a Comprehensive Survey of Research Activities, Standardization Efforts and Implementation Results

Fixed and mobile telecom operators, enterprise network operators and cloud providers strive to face the challenging demands coming from the evolution of IP networks (e.g. huge bandwidth requirements, integration of billions of devices and millions of services in the cloud). Proposed in the early 2010s, Segment Routing (SR) architecture helps face these challenging demands, and it is currently being adopted and deployed. SR architecture is based on the concept of source routing and has interesting scalability properties, as it dramatically reduces the amount of state information to be configured in the core nodes to support complex services. SR architecture was first implemented with the MPLS dataplane and then, quite recently, with the IPv6 dataplane (SRv6). IPv6 SR architecture (SRv6) has been extended from the simple steering of packets across nodes to a general network programming approach, making it very suitable for use cases such as Service Function Chaining and Network Function Virtualization. In this paper we present a tutorial and a comprehensive survey on SR technology, analyzing standardization efforts, patents, research activities and implementation results. We start with an introduction on the motivations for Segment Routing and an overview of its evolution and standardization. Then, we provide a tutorial on Segment Routing technology, with a focus on the novel SRv6 solution. We discuss the standardization efforts and the patents providing details on the most important documents and mentioning other ongoing activities. We then thoroughly analyze research activities according to a taxonomy. We have identified 8 main categories during our analysis of the current state of play: Monitoring, Traffic Engineering, Failure Recovery, Centrally Controlled Architectures, Path Encoding, Network Programming, Performance Evaluation and Miscellaneous...Comment: SUBMITTED TO IEEE COMMUNICATIONS SURVEYS & TUTORIAL

QoS-aware flow monitoring and event creation in heterogeneous MPLS-based Wireless Mesh Networks supporting unidirectional links

Proceedings of: IEEE 9th Malaysia International Conference on Communications (MICC 2009), 15-17 December 2009, Kuala Lumpur, MalaysiaMonitoring is a crucial task in QoS-aware networks since it provides statistics to verify that the network performs within the committed QoS parameters. It is especially important in a resource-constrained Carriergrade Wireless Mesh Access Network (CG-WMAN) in order to monitor a node’s neighborhood, established links as well as MPLS QoS-traffic flows, so-called Label-Switched Paths (LSPs). In this paper, we present a monitoring architecture for LSPs in a heterogeneous CG-WMAN, where configurable Rating Agents perform adaptive per-LSP event creation based on monitoring statistics, QoS-requirements and overall network state. Keeping the footprint of the monitoring mechanism at a minimum, our approach is based on quasipassive monitoring minimizing the transmission of extra frames. To support unidirectional links as well as 1-to-N multicast trees, a receiving side feedback-free mechanism is proposed which can be extended with transmitting side functionality. Initial results obtained in our testbed show that we can reliably detect under-performing links according to the QoS requirements of the payload.European Community's Seventh Framework ProgramPublicad