One-to-many file transfer using multipath multicast with gossiping

With the recent progress of cloud and distributed computing technologies, data migration and replication among distributed data centers grows rapidly. To manage a simplified scenario that a single sender sends a large-sized file to multiple recipients, i.e., one-to-many file transfer, on a network with full-duplex links, we are developing the Multipath-Multicast (MPMC) file transfer. A file is appropriately divided into equally-sized blocks; different blocks are concurrently transmitted to the same recipient on multiple paths; while the same block is concurrently transmitted to multiple recipients by multicast, aiming at shorter reception completion times of all recipients. However, on large-scale complex network topologies, it is not easy to find a good block transfer schedule, i.e., that realizes the reception completion times of most recipients close to their lower-bounds in MPMC. In this report, therefore, a gossiping approach to allow block transfer among recipients is introduced into MPMC and evaluated through simulation on two real backbone topologies. Since unused capacities of links in the original basic MPMC can be utilized in the MPMC with gossiping, a good schedule can be found more easily compared with the basic MPMC even with the same simple greedy block allocation.The 4th IEEE International Conference on Network Softwarization (NetSoft 2018) , June 25-29, 2018, Montreal, Canada

Coded-MPMC: One-to-Many Transfer Using Multipath Multicast With Sender Coding

One-to-many transfers in a fast and efficient manner are essential to meet the growing need for duplicating, migrating, or sharing bulk data among servers in a datacenter and across geographically distributed datacenters. Some existing works utilize multiple multicast trees for a one-to-many transfer request to increase network link utilization and its transfer throughput. However, since those schemes do not fully utilize the max-flow value of transmission from a single sender to each recipient, there is room for each recipient to retrieve data more quickly. Therefore, assuming fully-controlled networks with full-duplex links, we pose a problem to find a set of multicast flows with an allocation of block-wise transmissions by which each of multiple recipients with diverse max-flow values from the sender can utilize its own max-flow value. Based on that, assuming a sender-side coding capability on file blocks, we design a schedule of block transmissions over multiple phases by which each recipient can achieve a lower-bound of its file retrieval completion time, i.e., the file size divided by its own max-flow value. This paper presents the coded Multipath Multicast (Coded-MPMC) for one-to-many transfers with heuristic procedures to find a desired set of multicast flows on which block transmissions are scheduled. Through extensive simulations on large-scale real-world network topologies and different types of randomly-generated synthetic topologies, the proposed method is shown to design a desired schedule efficiently. A preliminary implementation on OpenFlow is also reported to show the fundamental feasibility of Coded-MPMC

Routing Protocols for Wireless Sensor Networks (WSNs)

Wireless sensor networks (WSNs) are achieving importance with the passage of time. Out of massive usage of wireless sensor networks, few applications demand quick data transfer including minimum possible interruption. Several applications give importance to throughput and they have not much to do with delay. It all rest on the applications desires that which parameter is more favourite. The knowledge of network structure and routing protocol is very important and it should be appropriate for the requirement of the usage. In the end a performance analysis of different routing protocols is made using a WLAN and a ZigBee based Wireless Sensor Network

Scalable and Secure Multicast Routing for Mobile Ad-hoc Networks

Mobile Ad-Hoc Networks (MANETs) are decentralized and autonomous communication systems: They can be used to provide connectivity when a natural disaster has brought down the infrastructure, or they can support freedom of speech in countries with governmental Internet restrictions. MANET design requires careful attention to scalability and security due to low-capacity and error-prone wireless links as well as the openness of these systems. In this thesis, we address the issue of multicast as a means to efficiently support the MANET application of group communication on the network layer. To this aim, we first survey the research literature on the current state of the art in MANET routing, and we identify a gap between scalability and security in multicast routing protocols–two aspects that were only considered in isolation until now. We then develop an explicit multicast protocol based on the design of a secure unicast protocol, aiming to maintain its security properties while introducing minimal overhead. Our simulation results reveal that our protocol reduces bandwidth utilization in group communication scenarios by up to 45 % compared to the original unicast protocol, while providing significantly better resilience under blackhole attacks. A comparison with pure flooding allows us to identify a practical group size limit, and we present ideas for better large-group support

Bluetooth low energy mesh networks: a survey

luetooth Low Energy (BLE) has gained significant momentum. However, the original design of BLE focused on star topology networking, which limits network coverage range and precludes end-to-end path diversity. In contrast, other competing technologies overcome such constraints by supporting the mesh network topology. For these reasons, academia, industry, and standards development organizations have been designing solutions to enable BLE mesh networks. Nevertheless, the literature lacks a consolidated view on this emerging area. This paper comprehensively surveys state of the art BLE mesh networking. We first provide a taxonomy of BLE mesh network solutions. We then review the solutions, describing the variety of approaches that leverage existing BLE functionality to enable BLE mesh networks. We identify crucial aspects of BLE mesh network solutions and discuss their advantages and drawbacks. Finally, we highlight currently open issuesPeer ReviewedPostprint (published version

On-demand Multipath Routing Protocols for Mobile Ad-Hoc Networks: A Comparative Survey

A Mobile Ad Hoc Network (MANET) is an infrastructure-less, self-organized and multi-hop network with a rapidly changing topology causing the wireless links to be broken at any time. Routing in such a network is challenging due to the mobility of its nodes and the challenge becomes more difficult when the network size increases. Due to the limited capacity of a multi-hop path and the high dynamics of wireless links, the single-path routing approach is unable to provide efficient high data rate transmission in MANETs. The multipath routing is the routing technique of using multiple alternative paths through a network. Furthermore, whenever a link failure is detected on a primary route, the source node can select the optimal route among multiple available routes. Therefore, the multipath routing approach is broadly utilized as one of the possible solutions to overcome the single-path limitation. Most of the multipath routing protocols are based on Ad Hoc On-Demand Distance Vector (AODV). The objective of this paper is to provide a survey and compare sets of multipath routing protocols for mobile ad-hoc networks. This survey will motivate the design of new multipath routing protocols, which overcome the weaknesses identified in this paper

Collaborative communications among multiple points.

Zhang Xinyan.Thesis (M.Phil.)--Chinese University of Hong Kong, 2004.Includes bibliographical references (leaves [78]-[85]).Abstracts in English and Chinese.Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Multiple Point Communication --- p.1Chapter 1.2 --- Major Contributions --- p.2Chapter 1.3 --- Thesis Organization --- p.4Chapter 2 --- Related Work --- p.5Chapter 2.1 --- Peer-to-Peer Networks --- p.5Chapter 2.2 --- Application Layer Multicast --- p.11Chapter 2.3 --- Internet Traffic Engineering --- p.19Chapter 3 --- MultiServ: Application Layer Multiple Path Routing --- p.23Chapter 3.1 --- Motivation --- p.24Chapter 3.2 --- MultiServ Overlay Construction --- p.28Chapter 3.3 --- MultiServ Routing --- p.33Chapter 3.3.1 --- The importance of routing strategy --- p.33Chapter 3.3.2 --- Solutions for IP network --- p.35Chapter 3.3.3 --- MultiServ routing --- p.37Chapter 3.3.4 --- MultiServ routing with bounded complexity --- p.39Chapter 3.3.5 --- Routing implementation --- p.41Chapter 3.4 --- Performance Evaluation --- p.45Chapter 3.4.1 --- End-to-end streaming --- p.45Chapter 3.4.2 --- Application-layer multicast --- p.50Chapter 3.4.3 --- Experiments in real network --- p.54Chapter 3.5 --- Summary and Future Work --- p.57Chapter 4 --- DDS: Distributed Dynamic Streaming --- p.59Chapter 4.1 --- Motivation --- p.59Chapter 4.2 --- Distributed Dynamic Streaming --- p.61Chapter 4.2.1 --- DDS overlay construction --- p.62Chapter 4.2.2 --- DDS streaming --- p.64Chapter 4.3 --- Performance Analysis in Dynamic User Environment --- p.66Chapter 4.3.1 --- Basic definition and user model --- p.67Chapter 4.3.2 --- Data outage in tree topology --- p.68Chapter 4.3.3 --- Data outage in DDS --- p.70Chapter 4.4 --- Performance Evaluation --- p.73Chapter 4.4.1 --- Simulation setup --- p.73Chapter 4.4.2 --- Simulation results --- p.74Chapter 4.5 --- Summary and Future Work --- p.75Chapter 5 --- Concluding Remarks --- p.76Bibliography --- p.7

Security and Privacy Issues in Wireless Mesh Networks: A Survey

This book chapter identifies various security threats in wireless mesh network (WMN). Keeping in mind the critical requirement of security and user privacy in WMNs, this chapter provides a comprehensive overview of various possible attacks on different layers of the communication protocol stack for WMNs and their corresponding defense mechanisms. First, it identifies the security vulnerabilities in the physical, link, network, transport, application layers. Furthermore, various possible attacks on the key management protocols, user authentication and access control protocols, and user privacy preservation protocols are presented. After enumerating various possible attacks, the chapter provides a detailed discussion on various existing security mechanisms and protocols to defend against and wherever possible prevent the possible attacks. Comparative analyses are also presented on the security schemes with regards to the cryptographic schemes used, key management strategies deployed, use of any trusted third party, computation and communication overhead involved etc. The chapter then presents a brief discussion on various trust management approaches for WMNs since trust and reputation-based schemes are increasingly becoming popular for enforcing security in wireless networks. A number of open problems in security and privacy issues for WMNs are subsequently discussed before the chapter is finally concluded.Comment: 62 pages, 12 figures, 6 tables. This chapter is an extension of the author's previous submission in arXiv submission: arXiv:1102.1226. There are some text overlaps with the previous submissio

Minimize end-to-end delay through cross-layer optimization in multi-hop wireless sensor networks

End-to-end delay plays a very important role in wireless sensor networks. It refers to the total time taken for a single packet to be transmitted across a network from source to destination. There are many factors could affect the end-to-end delay, among them the routing path and the interference level along the path are the two basic elements that could have significant influence on the result of the end-to-end delay. This thesis presents a transmission scheduling scheme that minimizes the end-to-end delay when the node topology is given. The transmission scheduling scheme is designed based on integer linear programming and the interference modeling is involved. By using this scheme, we can guarantee that no conflicting transmission will appear at any time during the transmission. A method of assigning the time slot based on the given routing is presented. The simulation results show that the link scheduling scheme can significantly reduce the end-to-end delay. Further, this article also shows two methods which could directly addresses routing and slot assignment, one is MI+MinDelay algorithm and the other is called One-Phase algorithm. A comparison was made between the two and the simulation result shows the latter one leads to smaller latency while it takes much more time to be solved. Besides, due to the different routing policy, we also demonstrate that the shortest path routing does not necessarily result in minimum end-to-end delay --Abstract, page ii