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.
As the infrastructure-centric model of peer-to-peer streaming, recent overlay construction schemes compose a hierarchical topology of peers by grouping them into clusters. There is a server in each cluster that receives data from the source and relays it to its cluster members. In this paper, we propose an alternative infrastructure-centric peer-to-peer framework called BAHMO that constructs a hierarchical...
Peer-to-peer (P2P) content distribution effectively solves the problem of large-scale streaming media delivery. But the performance of a P2P system is primarily bottlenecked, because the upload bandwidth of the participating peers is limited. Using helpers in the P2P system utilizes upload bandwidth of those idle peers uninterested in the delivered content, which further improves the performance of...
To deliver media streaming applications efficiently, researchers have developed three practical mechanisms, each of which has its virtues and limitations: Infrastructure-based CDN, Proxy-based approaches and P2P Systems. To address some of the above system limitations we present an enhanced media streaming design. Our design organizes its network entities in a structured P2P manner to provide a large...
The current peer-to-peer (P2P) live streaming networks can be generally classified into two categories: tree-based and data-driven. The tree-based approach suffers from three limitations: interruptive delivery due to failures of high level nodes, unfair uploading (out-going) bandwidth utilization in leaf nodes and bandwidth bottleneck in nodes near the root. The data driven approach has been widely...
Aiming at improving the performance of relay transmission in multi-flow streaming overlay networks, a performance evaluation model to optimize the global weighted average latency was proposed. This model supports multiple senders and multiple receivers. A distributed heuristic allocation algorithm was proposed to optimize the transmission performance. In this algorithm, the bottleneck bandwidth shared...
In this paper, we propose a dynamic approach for transmission holdoff time in IEEE 802.16 mesh mode with Coordinated Distributed Scheduling scheme (C-DSCH). This scheme allows different nodes to use different holdoff time values according to current node need of the control-plane bandwidth. Nodes that need to establish data scheduling use small XmtHoldoffExp, while others use large XmtHoldoffExp....
Load-balancing in existing P2P technologies is still not ideally solved, such as low load-balancing degree and excess assumption conditions and so on. Here an improved load-balancing algorithm is presented. The algorithm assigns rational ID address space that can be dynamically regulated to every peer based on its load capacity. In addition, the improved algorithm also adopts flow control mechanism,...
In theory, peer-to-peer (P2P) based streaming designs and simulations provide a promising alternative to server based streaming systems both in cost and scalability. In practice however, implementations of P2P based IPTV and VOD failed to provide a satisfying QoS as the characteristic fluctuational throughput of a peer's uplink leads to frequent annoying hiccups, substantial delays and latency for...
Due to their widespread popularity, peer-to-peer (P2P) live streaming systems have become a great challenge for Internet service providers (ISPs) as they consume huge amount of Internet bandwidth. By observing that different users may watch a channel with different window sizes, we propose a cooperative scheme called partial participation scheme (PPS) in which different peers request a video stream...
An emerging approach for improving the performance of TCP in ad hoc multihop networks is to limit the maximum congestion window (CWNDmax) that a TCP connection is allowed to reach, in order to eliminate the number of outstanding segments and increase the TCP stability. In the present work, we propose an adaptive scheme to bound the CWNDmax value in an IEEE 802.11 ad hoc network. Our contributions...
Multiple non-interfering channels are available in 802.11 and 802.15.4 based wireless networks. Capacity of such channels can be combined to achieve a better performance thus providing a higher quality of service (QoS) than for a single channel network. However, existing routing protocols often are not suited to fully take advantage of these channels. The proposed multi-interface multi-channel routing...
IEEE 802.16 standard suite defines two main polling modes, unicast polling and contention-based polling, to support different bandwidth allocation requirement. Although the specification introduces four service classes to adaptively implement the polling mechanisms for different type of traffics, it does not specify exactly how these polling modes could be used for efficient bandwidth allocation....
In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth limited networks. Assume that each link in the network has a bandwidth and a delay. For a given source-destination pair and a bandwidth requirement, we want to find a set of source to destination paths such that the delay of the longest path...
In current multi-channel live P2P video systems, there are several fundamental performance problems including exceedingly-large channel switching delays, long playback lags, and poor performance for less popular channels. These performance problems primarily stem from two intrinsic characteristics of multi-channel P2P video systems: channel churn and channel- resource imbalance. In this paper, we...
In this paper, we introduce a new mesh-based approach for data delivery which is organized over multiple tree-shaped core routes. Given that both tree and mesh approaches for multicast overlay construction have their own strong points, we simply combine them. During session, the mesh connections are formed dynamically to facilitate the data delivery on tree-shaped core routes which may experience...
This paper proposes a solution to the colossal needs of VoD by using a modified version of the popular file-sharing protocol BitTorrent. Our technique uses self-adjusting peer groups, called alliances, to cluster peers together that need similar parts of a video. In doing so, it ensures that peers receive the necessary video segments in a timely manner, and that bandwidth utilization is optimized.
Optical burst switching (OBS) networks depend on contention resolution strategies to reach reasonable bandwidth utilization efficiency. However, these strategies increase both the complexity and cost of OBS core nodes. Research efforts have suggested that contention minimization strategies based on flexible and optimized burst scheduling at the ingress nodes, exploiting their inexpensive electronic...
In this paper, we present the access and control design of a high-performance optical packet-switched WDM metro ring network (HOPSMAN). HOPSMAN has been designed for networks and nodes to be unconstrained by the number of wavelengths. It includes a handful of nodes that are equipped with fast optical slot erasers making bandwidth reusable and achieving greater bandwidth efficiency. In essence, HOPSMAN...
P2P streaming services have been gaining much success in recent years. In this paper, we address the design of chunk scheduling algorithm which achieves low delay for chunk distribution. We propose a distributed priority-based chunk scheduling algorithm (DPC algorithm). The proposed scheme can approach the minimum delay bound in homogeneous environment. We also extend our DPC algorithm to a general...
In mesh networks, various types of routing matrix are applicable. This document proposes a routing methodology, which makes use of the ETR (Expected Transmission Rate). The ETR is based on a load balancing metric contingent on the linked bandwidth of each integrated node. This routing methodology can be applied when selecting a relay node based on the present link efficiency between the available...
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.