Scheduling algorithms for concurrently streaming multimedia objects in P2P overlay networks

摘要

In peer-to-peer (P2P) overlay networks, source peers holding multimedia objects can transmit multimedia objects to receiver peers. A multimedia object is realized in a sequence of object units (OUs) which are units of transmission at the P2P overlay layer. In this paper, we discuss parallel types of multi-source streaming (PMSS) models where a receiver peer can concurrently receive object units of a multimedia object from multiple source peers which can support enough quality of service (QoS). The receiver peer is required to receive object units of the multimedia object with enough QoS, e.g. no object unit loss. Multiple source peers in parallel send object units to a receiver peer. In this paper, each object unit is delivered to the receiver peer so that there is no gap and time to buffer the object unit is reduced. In addition, object units are duplicated by sending parity units of the object units. Here, the receiver peer can deliver every object unit even if some object unit is lost. Since the lost object unit can be recovered from the parity unit and the other object units. We evaluate the PMSS model in terms of loss ratio of object units, buffering time, and gap time between consecutive object units in presence of network fault.