The current Internet architecture was founded upon a host-centric communication model, which was appropriate for coping with the needs of the early Internet users. Internet usage has evolved however, with most users mainly interested in accessing (vast amounts of) information, irrespective of its physical location. This paradigm shift in the usage model of the Internet, along with the pressing needs for, among others, better security and mobility support, has led researchers into considering a radical change to the Internet architecture. In this direction, we have witnessed many research efforts investigating Information-Centric Networking (ICN) as a foundation upon which the Future Internet can be built. Our main aims in this survey are: (a) to identify the core functionalities of ICN architectures, (b) to describe the key ICN proposals in a tutorial manner, highlighting the similarities and differences among them with respect to those core functionalities, and (c) to identify the key weaknesses of ICN proposals and to outline the main unresolved research challenges in this area of networking research.

A Survey of Information-Centric Networking Research

Simulation and emulation are techniques frequently used for performance evaluation of wireless multi-hop networks. If the wireless devices are mobile, the movement patterns of these objects are found to have significant impact on the simulation and emulation results. This is quite obvious as the movements influence the topology of the network.In this paper we describe and present BonnMotion. BonnMotion is an open-source Java software which creates and analyzes mobility scenarios. It has been developed at the University of Bonn, Germany, where it serves as a tool for the investigation of mobile multi-hop network scenario characteristics. The scenarios can also be exported for the network simulators ns-2, GloMoSim/QualNet, COOJA, and MiXiM.

BonnMotion: a mobility scenario generation and analysis tool

GENI: A federated testbed for innovative network experiments

Modern chip multiprocessor (CMP) systems employ multiple memory controllers to control access to main memory. The scheduling algorithm employed by these memory controllers has a significant effect on system throughput, so choosing an efficient scheduling algorithm is important. The scheduling algorithm also needs to be scalable — as the number of cores increases, the number of memory controllers shared by the cores should also increase to provide sufficient bandwidth to feed the cores. Unfortunately, previous memory scheduling algorithms are inefficient with respect to system throughput and/or are designed for a single memory controller and do not scale well to multiple memory controllers, requiring significant finegrained coordination among controllers. This paper proposes ATLAS (Adaptive per-Thread Least-Attained-Service memory scheduling), a fundamentally new memory scheduling technique that improves system throughput without requiring significant coordination among memory controllers. The key idea is to periodically order threads based on the service they have attained from the memory controllers so far, and prioritize those threads that have attained the least service over others in each period. The idea of favoring threads with least-attained-service is borrowed from the queueing theory literature, where, in the context of a single-server queue it is known that least-attained-service optimally schedules jobs, assuming a Pareto (or any decreasing hazard rate) workload distribution. After verifying that our workloads have this characteristic, we show that our implementation of least-attained-service thread prioritization reduces the time the cores spend stalling and significantly improves system throughput. Furthermore, since the periods over which we accumulate the attained service are long, the controllers coordinate very infrequently to form the ordering of threads, thereby making ATLAS scalable to many controllers. We evaluate ATLAS on a wide variety of multiprogrammed SPEC 2006 workloads and systems with 4–32 cores and 1–16 memory controllers, and compare its performance to five previously proposed scheduling algorithms. Averaged over 32 workloads on a 24-core system with 4 controllers, ATLAS improves instruction throughput by 10.8%, and system throughput by 8.4%, compared to PAR-BS, the best previous CMP memory scheduling algorithm. ATLAS's performance benefit increases as the number of cores increases.

/pdf/atlas-a-scalable-and-high-performance-scheduling-algorithm-586cczzqud.pdf

ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers

The current Internet, which was designed over 40 years ago, is facing unprecedented challenges in many aspects, especially in the commercial context. The emerging demands for security, mobility, content distribution, etc. are hard to be met by incremental changes through ad-hoc patches. New clean-slate architecture designs based on new design principles are expected to address these challenges. In this survey article, we investigate the key research topics in the area of future Internet architecture. Many ongoing research projects from United States, the European Union, Japan, China, and other places are introduced and discussed. We aim to draw an overall picture of the current research progress on the future Internet architecture.

A survey of the research on future internet architectures

Current work in routing protocols for delay and disruption tolerant networks leverage epidemic-style algorithms that trade off injecting many copies of messages into the network for increased probability of message delivery. However, such techniques can cause a large amount of contention in the network, increase overall delays, and drain each mobile node’s limited battery supply. We present a new DTN routing algorithm, called Encounter-Based Routing (EBR), which maximizes delivery ratios while minimizing overhead and delay. Furthermore, we present a means of securing EBR against black hole denialof-service attacks. EBR achieves up to a 40% improvement in message delivery over the current state-of-the-art, as well as achieving up to a 145% increase in goodput. Also, we further show how EBR outperforms other protocols by introduce three new composite metrics that better characterize DTN routing performance.

/pdf/encounter-based-routing-in-dtns-1ucjz9mupo.pdf

Encounter: based routing in DTNs

Current work in routing protocols for delay and disruption tolerant networks leverage epidemic-style algorithms that trade off injecting many copies of messages into the network for increased probability of message delivery. However, such techniques can cause a large amount of contention in the network, increase overall delays, and drain each mobile node's limited battery supply. We present a new DTN routing algorithm, called Encounter-Based Routing (EBR), which maximizes delivery ratios while minimizing overhead and delay. Furthermore, we present a means of securing EBR against black hole denial- of-service attacks. EBR achieves up to a 40% improvement in message delivery over the current state-of-the-art, as well as achieving up to a 145% increase in goodput. Also, we further show how EBR outperforms other protocols by introduce three new composite metrics that better characterize DTN routing performance.

/pdf/encounter-based-routing-in-dtns-2jfpvxt9rp.pdf

Encounter-Based Routing in DTNs

This short paper presents an overview of the MobilityFirst network architecture, which is a clean-slate project being conducted as part of the NSF Future Internet Architecture (FIA) program. The proposed architecture is intended to directly address the challenges of wireless access and mobility at scale, while also providing new multicast, anycast, multi-path and context-aware services needed for emerging mobile Internet application scenarios. Key protocol components of the proposed architecture are: (a) separation of naming from addressing; (b) public key based self-certifying names (called globally unique identifiers or GUIDs) for network-attached objects; (c) global name resolution service (GNRS) for dynamic name-to-address binding; (d) delay-tolerant and storage-aware routing (GSTAR) capable of dealing with wireless link quality fluctuations and disconnections; (e) hop-by-hop transport of large protocol data units; and (f) location or context-aware services. The basic operations of a MobilityFirst router are outlined. This is followed by a discussion of ongoing proof-of-concept prototyping and experimental evaluation efforts for the MobilityFirst protocol stack. In conclusion, a brief description of an ongoing multi-site experimental deployment of the MobilityFirst protocol stack on the GENI testbed is provided.

http://mobilityfirst.winlab.rutgers.edu/documents/ACM_AINTEC2011_Seskar_paper_000.pdf

MobilityFirst future internet architecture project

One of the most important tools in understanding the complex characteristics of disaster recovery networks is simulation. While many mobility models exist for simulating ad hoc networks, they do not realistically capture the behavior of objects in disaster scenarios. We propose a high level event- & role-based mobility paradigm in which objects' movement patterns are caused by environmental events. The introduction of roles allows different objects to uniquely and realistically react to events. For instance some roles, such as civilian, may flee from events, whereas other roles, such as police, may be attracted to events. Furthermore, to incorporate reaction from multiple events in a realistic fashion, we propose a low-level gravity-based mobility model in which events apply forces to objects. Simulation results show that our disaster mobility paradigm coupled with our gravitational mobility model creates a network topology that differs from the popular Random Walk mobility model. This new disaster mobility model opens up the door for more realistic simulation of communication and routing protocols for disaster recovery networks.

/pdf/event-driven-role-based-mobility-in-disaster-recovery-2j6zjevb43.pdf

Event-driven, role-based mobility in disaster recovery networks

The Internet is at a historic inflection point where mobile, wireless devices are becoming so dominant that core architectural changes are necessary to efficiently support them. This paper presents the high-level concepts and design decisions used to realize the key routing component of the MobilityFirst architecture, which is a clean-slate project being conducted as part of the NSF Future Internet Architecture program. In particular, we describe GSTAR, a mobilitycentric generalized storage-aware routing approach based on the following key design principles: separation of names from addresses, late binding of routable addresses, in-network storage, and conditional routing decision space. The GSTAR protocol described is based on hop-by-hop forwarding of large protocol data units (PDUs) between routers with storage. The packet header incorporates both name and address information enabling routers to execute a hybrid forwarding algorithm that uses topological addresses when available and refers back to names (i.e. global identifiers) to deal with dynamically changing points of attachment and disconnection. At a local level, GSTAR utilizes both fine-grain path quality information and DTN-style connectivity information to deal with the many challenges found in mobile environments.

http://mobilityfirst.winlab.rutgers.edu/documents/GSTAR-MobiArch11.pdf

Samuel C. Nelson

Papers

Encounter: based routing in DTNs

Encounter-Based Routing in DTNs

MobilityFirst future internet architecture project

Event-driven, role-based mobility in disaster recovery networks

GSTAR: generalized storage-aware routing for mobilityfirst in the future mobile internet