Linux XIA: an interoperable meta network architecture to crowdsource the future Internet

With the growing number of proposed clean-slate redesigns of the Internet, the need for a medium that enables all stakeholders to participate in the realization, evaluation, and selection of these designs is increasing. We believe that the missing catalyst is a meta network architecture that welcomes most, if not all, clean-state designs on a level playing field, lowers deployment barriers, and leaves the final evaluation to the broader community. This paper presents Linux XIA, a native implementation of XIA [12] in the Linux kernel, as a candidate. We first describe Linux XIA in terms of its architectural realizations and algorithmic contributions. We then demonstrate how to port several distinct and unrelated network architectures onto Linux XIA. Finally, we provide a hybrid evaluation of Linux XIA at three levels of abstraction in terms of its ability to: evolve and foster interoperation of new architectures, embed disparate architectures inside the implementation’s framework, and maintain a comparable forwarding performance to that of the legacy TCP/IP implementation. Given this evaluation, we substantiate a previously unsupported claim of XIA: that it readily supports and enables network evolution, collaboration, and interoperability—traits we view as central to the success of any future Internet architecture.This research was supported by the National Science Foundation under awards CNS-1040800, CNS-1345307 and CNS-1347525

A Model-based Scalable Reliable Multicast Transport Protocol for Satellite Networks

In this paper, we design a new scalable reliable multicast transport protocol for satellite networks (RMT). This paper is the extensions of paper in [18]. The proposed protocol does not require inspection and/or interception of packets at intermediate nodes. The protocol would not require any modification of satellites, which could be bent pipe satellites or onboard processing satellites. The proposed protocol is divided in 2 parts: error control part and congestion control part. In error control part, we intend to solve feedback implosion and improve scalability by using a new hybrid of ARQ (Auto Repeat Request) and adaptive forward error correction (AFEC). The AFEC algorithm adapts proactive redundancy levels following the number of receivers and average packet loss rate. This leads to a number of transmissions and the number of feedback signals are virtually independent of the number of receivers. Therefore, wireless link utilization used by the proposed protocol is virtually independent of the number of multicast receivers. In congestion control part, the proposed protocol employs a new window-based congestion control scheme, which is optimized for satellite networks. To be fair to the other traffics, the congestion control mimics congestion control in the wellknown Transmission Control Protocol (TCP) which relies on “packet conservation” principle. To reduce feedback implosion, only a few receivers, ACKers, are selected to report the receiving status. In addition, in order to avoid “drop-to-zero” problem, we use a new simple wireless loss filter algorithm. This loss filter algorithm significantly reduces the probability of the congestion window size to be unnecessarily reduced because of common wireless losses. Furthermore, to improve achievable throughput, we employ slow start threshold adaptation based on estimated bandwidth. The congestion control also deals with variations in network conditions by dynamically electing ACKers

A cluster based communication architecture for distributed applications in mobile ad hoc networks

Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2006Includes bibliographical references (leaves: 63-69)Text in English; Abstract: Turkish and Englishx, 85 leavesIn this thesis, we aim to design and implement three protocols on a hierarchical architecture to solve the balanced clustering, backbone formation and distributed mutual exclusion problems for mobile ad hoc network(MANET)s. Our ¯rst goal is to cluster the MANET into balanced partitions. Clustering is a widely used approach to ease implemen-tation of various problems such as routing and resource management in MANETs. We propose the Merging Clustering Algorithm(MCA) for clustering in MANETs that merges clusters to form higher level of clusters by increasing their levels. Secondly, we aim to con-struct a directed ring topology across clusterheads which were selected by MCA. Lastly, we implement the distributed mutual exclusion algorithm based on Ricart-Agrawala algo-rithm for MANETs(Mobile RA). Each cluster is represented by a coordinator node on the ring which implements distributed mutual exclusion algorithm on behalf of any member in the cluster it represents. We show the operations of the algorithms, analyze their time and message complexities and provide results in the simulation environment of ns2

Multicast networks : capacity, algorithms, and implementation

textIn this dissertation, we investigate the capacity and performance of wireless networks with an emphasis on multicast traffic. The defining characteristic of a multicast network is a network where a number of different destinations all require the information generated by a single source. The models that we explore differ in the nature of the nodes from all-mobile case where all nodes are mobile to hybrid case where some nodes are mobile and some are static. We investigate different performance measure for these wireless multicast networks: upper bounds, capacity scaling laws, and achievable rates. The understanding of these measures for such networks helps in the development of efficient algorithms for operating these networks. In addition, we study the practical realization of algorithms for real-time streaming of rich multimedia content in the context of mobile wireless networks for embedded and cyberphysical systems. Our initial work is in the context of unicast and multiple unicast systems over an autonomous aerial vehicle (AAV) network. Bandwidth requirements and stringent delay constraints of real-time video streaming, paired with limitations on computational complexity and power consumptions imposed by the underlying implementation platform, make cross-layer and cross-domain co-design approaches a necessity. In this dissertation, we propose a novel, low-complexity rate-distortion optimized (RDO) protocol specifically targeted at video streaming over mobile embedded networks. First, we test the performance of our RDO algorithm on simulation models developed for aerial mobility of multiple wirelessly communicating AAVs. Second, we test the performance of our RDO algorithm and other proposed adaptive algorithms on a real network of AAVs and present a comparative study between these different algorithms. Note that generalizing these algorithms to multicast settings is relatively straightforward and thus is not highlighted to a great degree in this thesis.Electrical and Computer Engineerin