Concepts of exact QoS routing algorithms

QoS routing: Average complexity and hopcount in m dimensions

QoS routing is expected to be an essential building block of a future, efficient and scalable QoS-aware network architecture. We present SAMCRA, an exact QoS routing algorithm that guarantees to find a feasible path if such a path exists. The complexity of SAMCRA is analyzed. Because SAMCRA is an exact algorithm, most findings can be applied to...

On-line Survivable Routing in WDM Networks

In WDM networks, survivable routing and wavelength assignment (SRWA) involves assigning link-disjoint primary and backup lightpaths. In the on-line SRWA problem, a sequence of requests arrive and each request is either accepted or rejected based only on the input sequence seen so far. For special networks, we establish on-line algorithms with...

Analytical Model for Mesh-based P2PVoD

Recently, there has been a growing interest in academic and commercial environments for Video-on-Demand (VoD) using Peer-to-Peer (P2P) technology. Unlike centralized solutions for VoD services, P2P technology lets the clients distribute video content among themselves. In this paper, we propose an analytical model for P2PVoD and we compare that...

On the Quality of Experience of SopCast

Peer-to-Peer (P2P) file sharing has become immensely popular in the Internet. Recently, there has been a growing interest in academic and commercial enviornments for live streaming using P2P technology. A number of new P2P digital television (P2PTV) applications have emerged. Such P2PTV applications are developed with proprietary technologies...