Inter-datacenter transport network is very bandwidth and delay demanding. The data transferred over such a network is also highly QoS-exigent mostly because a huge volume of data should be transported transparently wi...
详细信息
ISBN:
(纸本)9781538635810
Inter-datacenter transport network is very bandwidth and delay demanding. The data transferred over such a network is also highly QoS-exigent mostly because a huge volume of data should be transported transparently with regard to the application user. To avoid the data transfer failure, a backup path should be reserved. No re-routing delay should be observed. A dedicated 1 + 1 protection is however not applicable in inter-datacenter transport network because of the huge spare capacity. In this context, we propose a survivable virtual network with minimal backup based on network coding (1 circle plus 1) and solve it using a modified Dijkstra-based heuristic. 1 circle plus 1 network coding is the minimal spare capacity design method for backup links.
It is known that there exists a multiple-unicast network which has a rate 1 linear network coding solution if and only if the characteristic of the finite field belongs to a given finite or co-finite set of primes. In...
详细信息
ISBN:
(纸本)9781509053568
It is known that there exists a multiple-unicast network which has a rate 1 linear network coding solution if and only if the characteristic of the finite field belongs to a given finite or co-finite set of primes. In this paper, we present a generalization of this result for a linear network coding solution of any rate. Specifically, we show that for any non-zero positive rational number k/n, there exists a multiple-unicast network which has a rate k/n fractional linear network coding solution if and only if the characteristic of the finite field belongs to a given finite or co-finite set of primes.
We study the broadcast transmission of a single file to an arbitrary number of receivers in a wireless one-hop setting, using random linear network coding (RLNC). In contrast to similar studies, we apply RLNC within s...
详细信息
ISBN:
(纸本)9781467389990
We study the broadcast transmission of a single file to an arbitrary number of receivers in a wireless one-hop setting, using random linear network coding (RLNC). In contrast to similar studies, we apply RLNC within segments of the file. In a previous study, we showed that this method can achieve near optimal file transfer completion time while tackling the main drawbacks of RLNC;increased decoding delay and increased storage and complexity requirements at the receivers. Towards that end we developed and evaluated a packet scheduling policy, namely the Least Received (LR) batches policy. In our previous work, we proved the optimality of the LR policy, with regards to the completion time, in systems with two receivers. In this work we will show that the LR policy is optimal, in the same sense, regardless of the number of the receivers.
In this paper are presented the main idea and architecture of Universal Multimedia Access (UMA) and the fundamentals of network coding. A simulation study was conducted for advantages of network coding, compared to co...
详细信息
ISBN:
(纸本)9781538630730
In this paper are presented the main idea and architecture of Universal Multimedia Access (UMA) and the fundamentals of network coding. A simulation study was conducted for advantages of network coding, compared to conventional transmission.
The instantiation of a maximally recoverable (MR) code is shown to be a special case of generic network coding. The defining condition of MR codes, called potential independence, is shown to be equivalent to maximal m...
详细信息
ISBN:
(纸本)9781509030972
The instantiation of a maximally recoverable (MR) code is shown to be a special case of generic network coding. The defining condition of MR codes, called potential independence, is shown to be equivalent to maximal matching in bipartite graphs. Algorithms for MR instantiation are proposed and upper bounds on the required field size are derived.
network coding is a fundamental tool that enables higher network capacity and lower complexity in routing algorithms, by encouraging the mixing of information flows in the middle of a network. Implementing network cod...
详细信息
ISBN:
(纸本)9781538617915
network coding is a fundamental tool that enables higher network capacity and lower complexity in routing algorithms, by encouraging the mixing of information flows in the middle of a network. Implementing network coding in the core Internet is subject to practical concerns, since Internet routers are often overwhelmed by packet forwarding tasks, leaving little processing capacity for coding operations. Inspired by the recent paradigm of network function virtualization, we propose implementing network coding as a new network function, and deploying such coding functions in geo-distributed cloud data centers, to practically enable network coding on the Internet. We target multicast sessions (including unicast flows as special cases), strategically deploy relay nodes (network coding functions) in selected data centers between senders and receivers, and embrace high bandwidth efficiency brought by network coding with dynamic coding function deployment. We design and implement the network coding function on typical virtual machines, featuring efficient packet processing. We propose an efficient algorithm for coding function deployment, scaling in and out, in the presence of system dynamics. Real-world implementation on Amazon EC2 and Linode demonstrates significant throughput improvement and higher robustness of multicast via coding functions as well as efficiency of the dynamic deployment and scaling algorithm.
Even if packet networks have significantly evolved in the last decades, packets are still transmitted from one hop to the next as unalterable pieces of data. Yet this fundamental paradigm has recently been challenged ...
详细信息
Even if packet networks have significantly evolved in the last decades, packets are still transmitted from one hop to the next as unalterable pieces of data. Yet this fundamental paradigm has recently been challenged by new techniques like network coding, which promises network performance and reliability enhancements provided nodes can mix packets together. Wireless networks rely on various network technologies such as WiFi and LTE. They can however be unreliable due to obstacles, interferences, and these issues are worsened in wireless mesh network topologies with potential network relays. In this work, we focus on the application of intra-flow network coding to unicast flows in wireless networks. The main objective is to enhance reliability of data transfers over wireless links, and discuss deployment opportunities and performance. First, we propose a redundancy lower bound and a distributed opportunistic algorithm, to adapt coding to network conditions and allow reliable data delivery in a wireless mesh. We believe that application requirements have also to be taken into account. Since network coding operations introduce a non negligible cost in terms of processing and memory resources, we extend the algorithm to consider the physical constraints of each node. Then, we study the interactions of intra-flow coding with TCP and its extension MPTCP. network coding can indeed enhance the performances of TCP, which tends to perform poorly over lossy wireless links. We investigate the pratical impact of fairness issues created when running coded TCP flows besides legacy non-coded TCP flows. Finally, we explore two different ways to enhance the performance of MPCTP in wireless environments: running it over network coding, and implementing the coding process directly in MPTCP while keeping it fully TCP-compatible.
Satellite networks are expected to support multimedia traffic flows, offering high capacity with quality of service guarantees. In this paper, we consider future satellite networks able to exploit multiple paths to re...
详细信息
A wireless ad-hoc network can be made to perform better via a range of approaches. One such approach is network coding, which involves broadcasting of encoded packets and therefore can substantially enhance network ca...
详细信息
A typical intelligent factory, a smart home or a smart city consists of several nodes or machines. In a typical Machine to Machine Communication mode (M2M), each machine senses some information (pressure, temperature,...
详细信息
暂无评论