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

Efficient access of mobile flows to heterogeneous networks under flash crowds

Future wireless networks need to offer orders of magnitude more capacity to address the predicted growth in mobile traffic demand. Operators to enhance the capacity of cellular networks are increasingly using WiFi to offload traffic from their core networks. This paper deals with the efficient and flexible management of a heterogeneous networking environment offering wireless access to multimode terminals. This wireless access is evaluated under disruptive usage scenarios, such as flash crowds, which can mean unwanted severe congestion on a specific operator network whilst the remaining available capacity from other access technologies is not being used. To address these issues, we propose a scalable network assisted distributed solution that is administered by centralized policies, and an embedded reputation system, by which initially selfish operators are encouraged to cooperate under the threat of churn. Our solution after detecting a congested technology, including within its wired backhaul, automatically offloads and balances the flows amongst the access resources from all the existing technologies, following some quality metrics. Our results show that the smart integration of access networks can yield an additional wireless quality for mobile flows up to thirty eight percent beyond that feasible from the best effort standalone operation of each wireless access technology. It is also evidenced that backhaul constraints are conveniently reflected on the way the flow access to wireless media is granted. Finally, we have analyzed the sensitivity of the handover decision algorithm running in each terminal agent to consecutive flash crowds, as well as its centralized feature that controls the connection quality offered by a heterogeneous access infrastructure owned by distinct operators

Efficient resource allocation and call admission control in high capacity wireless networks

Resource Allocation (RA) and Call Admission Control (CAC) in wireless networks are processes that control the allocation of the limited radio resources to mobile stations (MS) in order to maximize the utilization efficiency of radio resources and guarantee the Quality of Service (QoS) requirements of mobile users. In this dissertation, several distributed, adaptive and efficient RA/CAC schemes are proposed and analyzed, in order to improve the system utilization while maintaining the required QoS. Since the most salient feature of the mobile wireless network is that users are moving, a Mobility Based Channel Reservation (MBCR) scheme is proposed which takes the user mobility into consideration. The MBCR scheme is further developed into PMBBR scheme by using the user location information in the reservation making process. Through traffic composition analysis, the commonly used assumption is challenged in this dissertation, and a New Call Bounding (NCB) scheme, which uses the number of channels that are currently occupied by new calls as a decision variable for the CAC, is proposed. This dissertation also investigates the pricing as another dimension for RA/CAC. It is proven that for a given wireless network there exists a new call arrival rate which can maximize the total utility of users, while maintaining the required QoS. Based on this conclusion, an integrated pricing and CAC scheme is proposed to alleviate the system congestion

A Framework for Dynamic Traffic Monitoring Using Vehicular Ad-Hoc Networks

Traffic management centers (TMCs) need high-quality data regarding the status of roadways for monitoring and delivering up-to-date traffic conditions to the traveling public. Currently this data is measured at static points on the roadway using technologies that have significant maintenance requirements. To obtain an accurate picture of traffic on any road section at any time requires a real-time probe of vehicles traveling in that section. We envision a near-term future where network communication devices are commonly included in new vehicles. These devices will allow vehicles to form vehicular networks allowing communication among themselves, other vehicles, and roadside units (RSUs) to improve driver safety, provide enhanced monitoring to TMCs, and deliver real-time traffic conditions to drivers. In this dissertation, we contribute and develop a framework for dynamic trafficmonitoring (DTMon) using vehicular networks. We introduce RSUs called task organizers (TOs) that can communicate with equipped vehicles and with a TMC. These TOs can be programmed by the TMC to task vehicles with performing traffic measurements over various sections of the roadway. Measurement points for TOs, or virtual strips, can be changed dynamically, placed anywhere within several kilometers of the TO, and used to measure wide areas of the roadway network. This is a vast improvement over current technology. We analyze the ability of a TO, or multiple TOs, to monitor high-quality traffic datain various traffic conditions (e.g., free flow traffic, transient flow traffic, traffic with congestion, etc.). We show that DTMon can accurately monitor speed and travel times in both free-flow and traffic with transient congestion. For some types of data, the percentage of equipped vehicles, or the market penetration rate, affects the quality of data gathered. Thus, we investigate methods for mitigating the effects of low penetration rate as well as low traffic density on data quality using DTMon. This includes studying the deployment of multiple TOs in a region and the use of oncoming traffic to help bridge gaps in connectivity. We show that DTMon can have a large impact on traffic monitoring. Traffic engineers can take advantage of the programmability of TOs, giving them the ability to measure traffic at any point within several km of a TO. Most real-time traffic maps measure traffic at midpoint of roads between interchanges and the use of this framework would allow for virtual strips to be placed at various locations in between interchanges, providing fine-grained measurements to TMCs. In addition, the measurement points can be adjusted as traffic conditions change. An important application of this is end-of-queue management. Traffic engineers are very interested in deliver timely information to drivers approaching congestion endpoints to improve safety. We show the ability of DTMon in detecting the end of the queue during congestion

Mean-Field-Type Games in Engineering

A mean-field-type game is a game in which the instantaneous payoffs and/or the state dynamics functions involve not only the state and the action profile but also the joint distributions of state-action pairs. This article presents some engineering applications of mean-field-type games including road traffic networks, multi-level building evacuation, millimeter wave wireless communications, distributed power networks, virus spread over networks, virtual machine resource management in cloud networks, synchronization of oscillators, energy-efficient buildings, online meeting and mobile crowdsensing.Comment: 84 pages, 24 figures, 183 references. to appear in AIMS 201

Protocol Layering and Internet Policy

An architectural principle known as protocol layering is widely recognized as one of the foundations of the Internet’s success. In addition, some scholars and industry participants have urged using the layers model as a central organizing principle for regulatory policy. Despite its importance as a concept, a comprehensive analysis of protocol layering and its implications for Internet policy has yet to appear in the literature. This Article attempts to correct this omission. It begins with a detailed description of the way the five-layer model developed, introducing protocol layering’s central features, such as the division of functions across layers, information hiding, peer communication, and encapsulation. It then discusses the model’s implications for whether particular functions are performed at the edge or in the core of the network, contrasts the model with the way that layering has been depicted in the legal commentary, and analyzes attempts to use layering as a basis for competition policy. Next the Article identifies certain emerging features of the Internet that are placing pressure on the layered model, including WiFi routers, network-based security, modern routing protocols, and wireless broadband. These developments illustrate how every architecture inevitably limits functionality as well as the architecture’s ability to evolve over time in response to changes in the technological and economic environment. Together these considerations support adopting a more dynamic perspective on layering and caution against using layers as a basis for a regulatory mandate for fear of cementing the existing technology into place in a way that prevents the network from innovating and evolving in response to shifts in the underlying technology and consumer demand