The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Erasure-coded storages provide data reliability for big data archiving and backup with high storage efficiency. However, erasure code generates a large amount of data transmission traffic in both encoding (write) and decoding (repair) which costs substantial bandwidth in the network. Most of the existing work focus on the decoding cost due to the importance of data repair, but unfortunately overlooks...
Data reliability is a significant issue in large-scale storage systems. Erasure codes provide high data reliability via data recovery, which however generates a large amount of data transmission in the network. The bandwidth cost of transmitting the recovery needed data significantly impacts the performance of the located cluster. Existing work considers the single-failure as the most common failure...
Network coding, with the redundant information it generates, has been shown to achieve optimal multicast throughput. Such redundancy plays a key role in maximizing throughput over multiple content delivery paths between network nodes. In this paper, we study the use of network coding to speed up content distribution in peer-to-peer networks where only a constraint number of selected peers can encode,...
In this paper, we investigate the performance of the so-called Cross Network operating under diverse Network Coding (NC) techniques. We study the impact of Medium Access Control (MAC) layer fairness on the throughput performance of the network for the cases of pure relaying, digital NC with and without overhearing and physical layer NC with and without overhearing. We provide a comparison among these...
The evolving broadband access systems using copper networks are currently deployed in a frequency band that goes up to 30 MHz, as specified in VDSL2. As hybrid fiber-copper architectures become more important in the industry and academia, using shorter loop lengths (i.e. up to 250 meters) from the last distribution point to users enables adopting even higher frequencies to achieve very high data rates...
Network Coding is a recent technique that has many advantages such as reducing the bandwidth consumption and increasing the throughput. IROCX [1] is a routing algorithm that applies Network Coding while considering the interference impact. However, it assumes a constant transmission power. We extend IROCX by allowing the nodes to transmit with several power levels. Our approach, TC-IROCX (Topology...
Previous works on network coding have mainly focused on the throughput and the cost of bandwidth, but few cares about saving resources used to code. In this paper we present a decentralized algorithm to construct network coding solutions, which reduces the number of coding nodes. We showed the dynamic topology greatly affected the network coding solutions, which may improve coding solution or reduce...
Peer-to-peer video streaming systems are overlay networks used to distribute, among other types of content, live video content to large sets of users by relying on network and computing resources directly provided by users that are receiving the video stream. In this paper, we analyze the impact of two optimization techniques that can be adopted in peer-to-peer video streaming systems, with tree or...
Peer-to-peer video streaming systems are overlay networks used to distribute, among other types of content, live video content to large sets of users by relying on computing and network resources directly provided by users that are receiving video streaming services. Peer-to-peer video streaming systems with tree or forest topology are typically push-based, since the video content is provided by parent...
This paper proposes a new ring structure of network coding (RSNC) based on existing network coding topology, enlarging the field of application and reducing the complexity of coding. On the basis of real-time monitoring and dynamic allocation for network bandwidth, RSNC is applied to the CERNET backbone network. The route of the packet is decided by the source node when it sends data packet and it...
The theory of network coding is hardly ever used and cannot be mapped to general wireless sensor network (WSN) topologies without careful consideration of technology constraints. Severe energy constraints and low bandwidth are faced by platforms of low computational power. We show how network coding methods can be implemented with low computational power. We discuss extensive experimentation in simulation...
Peer-to-peer networks are an increasingly popular solution for the distribution of media content to a large number of users, with limited investments for network infrastructures. The distribution of a real time video stream imposes strict performance requirements such as small playback delays and few frame losses. However, performances are greatly affected by the upload bandwidth of the access networks...
In this paper, we propose a scheme to apply network coding to heterogeneous peer-to-peer media streaming systems. As most peers in a peer-to-peer media streaming system are individual computers connected to the Internet through access links with heterogeneous link capacities, it is desirable to design an adaptive scheme to make efficient use of the bandwidth of the access links. We propose an adaptive...
It is well known that network coding can enhance the performance of peer-to-peer (P2P) content distribution systems since it benefits block scheduling. In this paper, we introduce our P2P content distribution system "SmartCode" with sparse network coding on PlanetLab. SmartCode uses pre-checking to avoid linearly dependent blocks being transmitted. Under the same system architecture, we...
In a content distribution network based on overlay networks, the peer's upload bandwidth is always constrained. To optimize the system performance, one problem is how to assign the upload capacity to the right neighbors for transferring data blocks. In a system using network coding technology, a strategy which is to select the right neighbors based upon the degrees of them is proposed. The selection...
This paper presents a novel approach for the construction of Multiple Shortest Path Trees (MSPT) using multiple description (MD) video coding to satisfy the destination requirements (i.e., each destination has a preference number, which depends on its capacity, of video layers). Specifically, the independent-descriptions property of multiple description (MD) video coding along with multiple trees...
The network coding paradigm has become an effective method for achieving efficient multicast in communication networks. The optical community has just started to venture into the application of network coding in optical networks. However, a number of challenges need to be overcome before network coding can be used in optical networks. These include limited buffering and processing capabilities as...
In this paper, we address the issue of multilayered multicast routing in wireless ad hoc networks (WAHNs). Existing multilayered multicast protocols assume homogeneous ad hoc wireless networks; in which all nodes are of the same type (they have the same processing, data rate and communication capabilities and characteristics). A more realistic assumption is a heterogeneous network; in which nodes...
We consider multi-source multicast communication scenarios in which each node has an aggregate outbound traffic capacity and can directly communicate with any other node. This is motivated by peer-to-peer (P2P) information dissemination applications on the Internet in which the uplink capacity of nodes is usually the bottleneck, being several times smaller than the downlink capacity. We also allow...
This correspondence demonstrates the significant gains that multiple-access users can achieve from sharing a single amplify-forward relay in slow-fading environments. The proposed protocol, namely, multiple-access amplify-forward (MAF), allows for a low-complexity relay and achieves the optimal diversity-multiplexing tradeoff (DMT) at high multiplexing gains. Analysis of the protocol further reveals...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.