Distributed multimedia systems

Li, V.O.K.; Liao, Wanjiun

doi:10.1109/5.611116

Cited by 46 publications

(28 citation statements)

References 165 publications

(190 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Requests for the movie arrive at the server with rate req/min. Clearly, the average interval between successive network channel allocations is given by ; therefore, the average number of channels used is, by Little's formula (2) Note that the buffer of size minutes is held in the server for the duration of minutes. Since such a buffer is allocated on average once every minutes, by Little's formula, the average number of buffers allocated is ; hence, the average buffer size is…”

Section: A Unicast Deliverymentioning

confidence: 99%

See 1 more Smart Citation

Distributed servers architecture for networked video services

Chan

Tobagi

2001

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-In an on-demand video system, the video repository generally has limited streaming capacities and may be far from the users. In order to achieve higher user capacity and lower network transmission cost, distributed servers architecture can be used, in which multiple local servers are placed close to user pools and, according to their local demands, dynamically cache the contents streamed from the repository. We study in this paper a number of caching schemes as applied in the local servers depending on whether the repository is able to multicast movie contents to the local servers or not, and whether the local servers can exchange their cached contents among themselves or not. Our caching schemes keep a circular buffer of data for the movie requested, and hence movies are partially cached. By adjusting the size of the buffer, such caching is able to achieve better tradeoff between network channels and local storage as compared to the traditional caching in which a movie is treated as an entity. For each caching scheme, we study the tradeoff between the local storage and the network channels, and address how the total cost of the system can be minimized by appropriately sizing the buffer. As compared to a number of traditional operations (request batching and multicasting, true-VOD, etc.), we show that distributed servers architecture is able to achieve much lower system cost to offer on-demand video services.Index Terms-Caching schemes, distributed servers architecture, network channels and local storage tradeoff, unicast and multicast, video-on-demand.

show abstract

Section: A Unicast Deliverymentioning

confidence: 99%

“…(See [2], [25], [26] and references therein for more details.) If users can tolerate a certain maximum delay of minutes, the batching period can be set to be no more than minutes.…”

Section: Cost Comparison With a System Using Request Batching Andmentioning

confidence: 99%

Distributed servers architecture for networked video services

Chan

Tobagi

2001

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…From this interest, distributed multimedia systems (DMSs) have emerged. A DMS is defined as an integrated communication, computing, and information system that enables the processing, management, delivery, and presentation of synchronized multimedia information with quality-of-service guarantees [11]. Typically these DMSs consist of a hierarchical configuration of video servers and network switches.…”

Section: Introductionmentioning

confidence: 99%

Load management in a distributed multimedia streaming environment using a fault-tolerant hierarchical system

Aybay¹,

Shah²

2015

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

Abstract:In contrast to text-only forms of communications, multimedia uses a combination of audiovisual means alongside textual modes of communication. Streaming multimedia is such multimedia that is constantly delivered by a provider of the multimedia to a client. In streaming multimedia the streamed content is continually presented to and received by the end user. Distributed multimedia systems (DMSs) deliver multimedia content to end-users by means of distributed multimedia databases and distributed information servers. These DMSs are designed to deliver multimedia content over a network. A fault-tolerant redundant hierarchy (Red-HI)-based load management policy for a distributed multimedia streaming system is proposed in this paper. The main objectives of this policy are to provide fault tolerance while increasing the flexibility offered in the network by improving network resource utilization. Another advantage of this policy is that it provides popularity-zone centric dynamic multimedia object placement. The load management and fault tolerance are achieved using Red-HI for the multimedia servers coupled with parent-only query flooding policy.We show through simulations that our scheme outperforms the traditional pure hierarchy employed in most distributed multimedia systems.

show abstract

“…If the receiver is selected, then only the path that satisfies the delay constraint can be selected. 8 Therefore, the data-path for every receiver in every layer can satisfy the delay constraint, if it exists. This proves that the super-tree, if it exists, can always satisfy the delay constraint.…”

Section: Propertiesmentioning

confidence: 99%

“…Advances in networking and server technologies have made the provisioning of on-demand video services to homes a reality [2,8,11,19]. Video-ondemand (VoD) systems can be divided into two types--the pure video-on-demand (pure VoD) system and the near video-on-demand (near VoD) system.…”

Section: Introductionmentioning

confidence: 99%

LVMSR-an efficient algorithm to multicast layered video

Wen¹,

Mukherjee

Ghosal

et al.

2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record

View full text Add to dashboard Cite

Layered video is a video-compression technique to encode video data in multiple layers. It typically consists of a base layer and some additional layers that provide enhanced video quality. The multicasting operation of layered video consists of many receivers dynamically joining and leaving different multicast sessions of different layers depending on their network condition. A layered video multicasting system needs to satisfy: (i) bounded end-to-end delay from the video source to each receiver; (ii) minimum total cost; and (iii) minimum delay jitter between the various video streams received by each receiver. The problem of computing such data distribution paths is NP-complete. This paper presents a new heuristic algorithm, called layered video multicast super-tree routing algorithm, with OðRn 2 Þ time complexity and OðR 2 Þ message complexity, where n is the number of nodes in the network and R is the receiver group size. Our investigation shows that the multicast data paths computed by our algorithm can always satisfy the delay constraint with reasonably low total cost.

show abstract

Distributed multimedia systems

Cited by 46 publications

References 165 publications

Distributed servers architecture for networked video services

Distributed servers architecture for networked video services

Load management in a distributed multimedia streaming environment using a fault-tolerant hierarchical system

LVMSR-an efficient algorithm to multicast layered video

Contact Info

Product

Resources

About