The Road Ahead for Networking: A Survey on ICN-IP Coexistence Solutions

In recent years, the current Internet has experienced an unexpected paradigm shift in the usage model, which has pushed researchers towards the design of the Information-Centric Networking (ICN) paradigm as a possible replacement of the existing architecture. Even though both Academia and Industry have investigated the feasibility and effectiveness of ICN, achieving the complete replacement of the Internet Protocol (IP) is a challenging task. Some research groups have already addressed the coexistence by designing their own architectures, but none of those is the final solution to move towards the future Internet considering the unaltered state of the networking. To design such architecture, the research community needs now a comprehensive overview of the existing solutions that have so far addressed the coexistence. The purpose of this paper is to reach this goal by providing the first comprehensive survey and classification of the coexistence architectures according to their features (i.e., deployment approach, deployment scenarios, addressed coexistence requirements and architecture or technology used) and evaluation parameters (i.e., challenges emerging during the deployment and the runtime behaviour of an architecture). We believe that this paper will finally fill the gap required for moving towards the design of the final coexistence architecture.Comment: 23 pages, 16 figures, 3 table

Dynamic Selection of Network Protocols for Group Communications in Mobile Ad-hoc Networks

This thesis addresses the topic of dynamically selecting protocols at various levels of network stacks in challenged environments, speci cally those with message loss, long-term fragmentation, and high mobility, in an e ort to meet the demands of group-based messaging applications. Currently, developers select protocols based on a static set of assumptions about the underlying network and application requirements. This thesis introduces a method of sensing the network state, merging this with similar information from peers, and dynamically changing the underlying protocols. This alleviates the need for developers to select protocols and instead assert message requirements. Further, since application instances are involved in group communications, they likely act as such from a mobility perspective, causing di erent portions of the network to have drastically di erent properties. For example, there may be clusters of nodes in certain locations, but minimal connectivity between them. The proposed solution allows systems to adapt to these situations as protocols may be interchanged at any time, allowing the best to be used in any given scenario. The thesis rst establishes a formal de nition of the problem space, and then proposes a solution utilizing Markov Random Fields to classify the network. This classi cation is then used to dynamically select the protocols utilized by the network stack. The Dynamic Protocol Selection Middleware (DPSM) is introduced as the implementation of this approach. Using this middelware, the e ectiveness of the approach is tested in both random group environments and real-world scenarios. In general, DPSM delivered at least as many messages as any statically selected protocol, while delivering substantially more messages in many scenarios with only modest increases in overhead or latency.M.S., Computer Science -- Drexel University, 201

Architectures for the Future Networks and the Next Generation Internet: A Survey

Networking research funding agencies in the USA, Europe, Japan, and other countries are encouraging research on revolutionary networking architectures that may or may not be bound by the restrictions of the current TCP/IP based Internet. We present a comprehensive survey of such research projects and activities. The topics covered include various testbeds for experimentations for new architectures, new security mechanisms, content delivery mechanisms, management and control frameworks, service architectures, and routing mechanisms. Delay/Disruption tolerant networks, which allow communications even when complete end-to-end path is not available, are also discussed

A data-oriented network architecture

In the 25 years since becoming commercially available, the Internet has grown into a global communication infrastructure connecting a significant part of mankind and has become an important part of modern society. Its impressive growth has been fostered by innovative applications, many of which were completely unforeseen by the Internet's inventors. While fully acknowledging ingenuity and creativity of application designers, it is equally impressive how little the core architecture of the Internet has evolved during this time. However, the ever evolving applications and growing importance of the Internet have resulted in increasing discordance between the Internet's current use and its original design. In this thesis, we focus on four sources of discomfort caused by this divergence. First, the Internet was developed around host-to-host applications, such as telnet and ftp, but the vast majority of its current usage is service access and data retrieval. Second, while the freedom to connect from any host to any other host was a major factor behind the success of the Internet, it provides little protection for connected hosts today. As a result, distributed denial of service attacks against Internet services have become a common nuisance, and are difficult to resolve within the current architecture. Third, Internet connectivity is becoming nearly ubiquitous and reaches increasingly often mobile devices. Moreover, connectivity is expected to extend its reach to even most extreme places. Hence, applications' view to network has changed radically; it's commonplace that they are offered intermittent connectivity at best and required to be smart enough to use heterogeneous network technologies. Finally, modern networks deploy so-called middleboxes both to improve performance and provide protection. However, when doing so, the middleboxes have to impose themselves between the communication end-points, which is against the design principles of the original Internet and a source of complications both for the management of networks and design of application protocols. In this thesis, we design a clean-slate network architecture that is a better fit with the current use of the Internet. We present a name resolution system based on name-based routing. It matches with the service access and data retrieval oriented usage of the Internet, and takes the network imposed middleboxes properly into account. We then propose modest addressing-related changes to the network layer as a remedy for the denial of service attacks. Finally, we take steps towards a data-oriented communications API that provides better decoupling for applications from the network stack than the original Sockets API does. The improved decoupling both simplifies applications and allows them to be unaffected by evolving network technologies: in this architecture, coping with intermittent connectivity and heterogenous network technologies is a burden of the network stack

Content storage and retrieval mechanisms for vehicular delay-tolerant networks

Vehicular delay-tolerant networks (VDTNs) were proposed as a novel disruptive network concept based on the delay tolerant networking (DTN) paradigm. VDTN architecture uses vehicles to relay messages, enabling network connectivity in challenging scenarios. Due to intermittent connectivity, network nodes carry messages in their buffers, relaying them only when a proper contact opportunity occurs. Thus, the storage capacity and message retrieving of intermediate nodes directly affects the network performance. Therefore, efficient and robust caching and forwarding mechanisms are needed. This dissertation proposes a content storage and retrieval (CSR) solution for VDTN networks. This solution consists on storage and retrieval control labels, attached to every data bundle of aggregated network traffic. These labels define cacheable contents, and apply cachecontrol and forwarding restrictions on data bundles. The presented mechanisms gathered several contributions from cache based technologies such as Web cache schemes, ad-hoc and DTN networks. This solution is fully automated, providing a fast, safe, and reliable data transfer and storage management, while improves the applicability and performance of VDTN networks significantly. This work presents the performance evaluation and validation of CSR mechanisms through a VDTN testbed. Furthermore it presents several network performance evaluations and results using the well-known DTN routing protocols, Epidemic and Spray and Wait (including its binary variant). The comparison of the network behavior and performance on both protocols, with and without CSR mechanisms, proves that CSR mechanisms improve significantly the overall network performance

A RELIABILITY-BASED ROUTING PROTOCOL FOR VEHICULAR AD-HOC NETWORKS

Vehicular Ad hoc NETworks (VANETs), an emerging technology, would allow vehicles to form a self-organized network without the aid of a permanent infrastructure. As a prerequisite to communication in VANETs, an efficient route between communicating nodes in the network must be established, and the routing protocol must adapt to the rapidly changing topology of vehicles in motion. This is one of the goals of VANET routing protocols. In this thesis, we present an efficient routing protocol for VANETs, called the Reliable Inter-VEhicular Routing (RIVER) protocol. RIVER utilizes an undirected graph that represents the surrounding street layout where the vertices of the graph are points at which streets curve or intersect, and the graph edges represent the street segments between those vertices. Unlike existing protocols, RIVER performs real-time, active traffic monitoring and uses this data and other data gathered through passive mechanisms to assign a reliability rating to each street edge. The protocol then uses these reliability ratings to select the most reliable route. Control messages are used to identify a node’s neighbors, determine the reliability of street edges, and to share street edge reliability information with other nodes

Adaptive object management for distributed systems

This thesis describes an architecture supporting the management of pluggable software components and evaluates it against the requirement for an enterprise integration platform for the manufacturing and petrochemical industries. In a distributed environment, we need mechanisms to manage objects and their interactions. At the least, we must be able to create objects in different processes on different nodes; we must be able to link them together so that they can pass messages to each other across the network; and we must deliver their messages in a timely and reliable manner. Object based environments which support these services already exist, for example ANSAware(ANSA, 1989), DEC's Objectbroker(ACA,1992), Iona's Orbix(Orbix,1994)Yet such environments provide limited support for composing applications from pluggable components. Pluggability is the ability to install and configure a component into an environment dynamically when the component is used, without specifying static dependencies between components when they are produced. Pluggability is supported to a degree by dynamic binding. Components may be programmed to import references to other components and to explore their interfaces at runtime, without using static type dependencies. Yet thus overloads the component with the responsibility to explore bindings. What is still generally missing is an efficient general-purpose binding model for managing bindings between independently produced components. In addition, existing environments provide no clear strategy for dealing with fine grained objects. The overhead of runtime binding and remote messaging will severely reduce performance where there are a lot of objects with complex patterns of interaction. We need an adaptive approach to managing configurations of pluggable components according to the needs and constraints of the environment. Management is made difficult by embedding bindings in component implementations and by relying on strong typing as the only means of verifying and validating bindings. To solve these problems we have built a set of configuration tools on top of an existing distributed support environment. Specification tools facilitate the construction of independent pluggable components. Visual composition tools facilitate the configuration of components into applications and the verification of composite behaviours. A configuration model is constructed which maintains the environmental state. Adaptive management is made possible by changing the management policy according to this state. Such policy changes affect the location of objects, their bindings, and the choice of messaging system

Modelling and Design of Resilient Networks under Challenges

Communication networks, in particular the Internet, face a variety of challenges that can disrupt our daily lives resulting in the loss of human lives and significant financial costs in the worst cases. We define challenges as external events that trigger faults that eventually result in service failures. Understanding these challenges accordingly is essential for improvement of the current networks and for designing Future Internet architectures. This dissertation presents a taxonomy of challenges that can help evaluate design choices for the current and Future Internet. Graph models to analyse critical infrastructures are examined and a multilevel graph model is developed to study interdependencies between different networks. Furthermore, graph-theoretic heuristic optimisation algorithms are developed. These heuristic algorithms add links to increase the resilience of networks in the least costly manner and they are computationally less expensive than an exhaustive search algorithm. The performance of networks under random failures, targeted attacks, and correlated area-based challenges are evaluated by the challenge simulation module that we developed. The GpENI Future Internet testbed is used to conduct experiments to evaluate the performance of the heuristic algorithms developed

A content dissemination framework for vehicular networking

Vehicular Networks are a peculiar class of wireless mobile networks in which vehicles are equipped with radio interfaces and are, therefore, able to communicate with fixed infrastructure (if available) or other vehicles. Content dissemination has a potential number of applications in vehicular networking, including advertising, traffic warnings, parking notifications and emergency announcements. This thesis addresses two possible dissemination strategies: i) Push-based that is aiming to proactively deliver information to a group of vehicles based on their interests and the level of matching content, and ii) Pull-based that is allowing vehicles to explicitly request custom information. Our dissemination framework is taking into consideration very specific information only available in vehicular networks: the geographical data produced by the navigation system. With its aid, a vehicle's mobility patterns become predictable. This information is exploited to efficiently deliver the content where it is needed. Furthermore, we use the navigation system to automatically filter information which might be relevant to the vehicles. Our framework has been designed and implemented in .NET C# and Microsoft MapPoint. It was tested using a small number of vehicles in the area of Cambridge, UK. Moreover, to prove the correctness of our protocols, we further evaluated it in a large-scale network simulation over a number of realistic vehicular trace-based scenarios. Finally, we built a test-case application aiming to prove that vehicles can gain from such a framework. In this application every vehicle collects and disseminates road traffic information. Vehicles that receive this information can individually evaluate the traffic conditions and take an alternative route, if needed. To evaluate this approach, we collaborated with UCLA's Network Research Lab (NRL), to build a simulator that combines network and dynamic mobility emulation simultaneously. When our dissemination framework is used, the drivers can considerably reduce their trip-times

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms