S. Viswanathan, and T. Imielinski, "Metropolitan area video-on-demand service using Pyramid Broadcasting", IEEE Multimedia Systems. 4:197208, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....called proxy assisted catching. Section 4 introduces proxy assisted selective catching and evaluates the scheme via empirical studies. The paper is concluded in Section 5. 1. 1 Related Work In recent years a variety of multicast techniques for video delivery have been proposed (see, e.g. [6, 1, 3, 4, 7, 18]) These techniques can be broadly classified into either client pull or server push The simplest client pull technique is to deliver a separate video stream upon each client request. This technique, while providing minimal service latency to a client, is obviously not efficient in terms of ....

....resource requirements for cold video objects without introducing service latency. A similar technique the split and merge (SAM) protocol is proposed in [14] for interactive VOD systems, where a unicast stream is scheduled on demand upon a client s request. Server push techniques [7, 3, 4, 17, 18, 19] are typically designed for hot video objects. They employ a fixed number of multicast channels to periodically broadcast video objects to a group of subscribers. The difference between various server push techniques lies in the broadcast schemes used. These broadcast schemes determine the ....

S. Viswanathan and T. Imielinski. "Metropolitan Area Video-On-Demand Service Using Pyramid Broadcasting". IEEE Multimedia Systems. 4:197-208, 1996.

....like those described in this paper that can use it to dramatically reduce individual server and network load. Stream merging [12, 13] is a new model for media on demand delivery. It is one of the techniques that models the pyramid broadcasting paradigm, pioneered by Viswanathan and Imielinski [23] and is built on top of multicast techniques. The goal of stream merging is to reduce the server bandwidth required to satisfy the clients requesting a particular media object. This is accomplished by having the clients simultaneously receive two or more streams. The most commonly used model is ....

....proposed technique to reduce server bandwidth is to utilize multicast. The simplest solution is to batch client requests and serve them with the same multicast stream. The tradeo involved with this solution is the start up delay and the bandwidth saved. The revolutionary pyramid broadcast scheme [23] introduced additional trade o s with two other resources: client receive bandwidth and client bu er size. Using these resources, the pyramid broadcast scheme demonstrated a huge improvement over the simple batching solution. Following the pyramid broadcast scheme, many solutions emerged to ....

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems Journal, 4:197-208, 1996. 23

....extensions to the Tabbycat architecture while Section 5 reviews some relevant work. Finally, Section 6 contains our conclusions. II. BROADCASTING PROTOCOLS FOR VIDEO ON DEMAND All recent VOD broadcasting protocols derive in some way from Viswanathan and Imielinski s pyramid broadcasting protocol [16]. Like it, they require special customer set top boxes (STBs) a) capable of receiving data at data rates exceeding the video consumption rate and (b) having enough buffer space to store up between, say, ten to sixty minutes of video data. This allows the server to distribute the different ....

S. Viswanathan and T. Imielinski. "Metropolitan area video-on-demand service using pyramid broadcasting." Multimedia Systems, 4(4):197-- 208, 1996.

....the guaranteed start up delay. See e.g. the papers [3, 13, 17] The main advantage of the batching solutions lies in their simplicity whereas the main disadvantage is that the guaranteed start up delay may be too large. The pyramid broadcasting paradigm, pioneered by Viswanathan and Imielinski [46], was the rst solution that dramatically reduced the bandwidth requirements for servers by using larger receiving bandwidth for clients and by adding bu ers to clients. The basic idea is that clients may simultaneously receive data from more than one channel, and store parts of the transmission ....

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems Journal, Vol. 4, No. 3, 197-208, 1996.

....the channels. Two patching schemes [11, 13] that are similar to stream tapping are proposed on top of the batching approach to allow late coming clients to join the service under some bu er and channel constraints. If the video is very popular hot, the broadcasting approach will be more ecient [2, 6, 7, 8, 10, 14, 15, 16, 17, 18, 22, 24, 27]. In such schemes, the server uses multiple dedicated channels cooperatively to broadcast a video. Each channel is responsible of broadcasting some portion of the video periodically. Each client follows some reception rule to retrieve data from appropriate channels so as to play the whole video ....

....some time [6] The EB scheme [7] proposes to divide the video into equal length segments; a user has to wait no longer than the length of one segment. Many schemes have been proposed by imposing a larger client receiving bandwidth and an extra bu ering space at the client side. The pyramid scheme [27] can reduce the maximum waiting time experienced by viewers exponentially with respect to the number of channels used. The pyramid scheme is further improved by the permutation based pyramid scheme [2] skyscraper scheme [14] and greedy disk conserving scheme [10] to address the disk bu ering ....

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. IEEE Multimedia Systems, 4:197-208, 1996.

....the overall server bandwidth and the guaranteed startup delay. The main advantage of the batching solutions lies in their simplicity. The main disadvantage is that the guaranteed startup delay may be still too large. The pyramid broadcasting paradigm, pioneered by Viswanathan and Imielinski [17], was the rst solution that reduced dramatically the bandwidth requirements for servers by using larger receiving bandwidth for clients and by adding bu ers to clients. The novelty of the pyramid broadcasting paradigm is that clients with more complicated equipment are able to receive more ....

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems Journal, Vol. 4(3), 197-208, 1996.

....because they distribute each video according to a fixed schedule that is not affected by the presence or the absence of requests for that video. They are also known as broadcasting protocols. Some of the bestknown broadcasting protocols are staggered broadcasting [Alm96] pyramid broadcasting [20], skyscraper broadcasting [10] harmonic broadcasting [12] and its variants [14] Other solutions are purely reactive: they only transmit data in response to a specific customer request. Unlike proactive protocols, reactive protocols do not consume bandwidth in the absence of customer requests. ....

Viswanathan, S. and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems Journal, 4(4):197--208, 1996.

....recent approaches for reliable live or scheduled broadcast delivery of streaming media [36, 13, 7, 23, 4, 20, 33, 9] do not address the problem of providing scalable on demand delivery. Recently proposed protocols for scalable on demand me dia streaming, such as periodic broadcast protocols [35, 1, 17, 19, 14, 25, 16], patching [8, 18, 6, 15, 31] and bandwidth skimming [12] do not address the issue of providing reli able delivery over lossy channels. When applying scalable streaming methods in environments where packet loss is relatively rare, local error concealment (e.g. interpolating lost video frames ....

....that are developed in Section 3. Finally, Section 2.4 summarizes the goals of the new protocols developed in Sections 4 and 5 of the paper. 2. 1 Periodic Broadcast Protocols Periodic broadcast protocols were first proposed by Viswanathan and Imielinski in the form called Pyramid Broadcasting [35]. These protocols divide a media object into K segments with relative lengths ll,12, lK, each of which is broadcast periodically according to a fixed schedule. In most protocols, each segment is transmitted at a rate equal to or greater than the media play rate, so that the client can play ....

S. Viswanathan and T. Imielinski, "Metropolitan Area Video- on-Demand Service using Pyramid Broadcasting", Multimedia Systems, Vol. 4, No. 4, Aug. 1996.

....bounds the service latency, bypasses the need to process individual user requests, and eliminate the need for an upstream channel. Thus, periodic broadcast is more scalable than TVOD or other NVOD techniques. Due to these benefits, a number of periodic broadcast schemes have been recently presented[3, 9, 12 14, 17 19, 22]. In staggered broadcasting[9] several channels broadcast a video periodically with staggered start times. In this case the maximum service latency is the length of video divided by the number of the channels allocated for the video. Most proposed schemes aim at minimizing the system required ....

....client I O bandwidth, client disk space, etc. Recently, videos have been fragmented into separate segments and each segment then transmitted repeatedly over a di#erent channel. Periodic broadcast schemes can be divided into pyramid based schemes and harmonicbased schemes. The pyramid based schemes[3, 12, 13, 22] divide each video into segments of increasing size and transmit the segments over equal bandwidth channels. On the other hand, the harmonic based schemes[14, 17, 18] divide each video into segments of equal size and transmit the segments over decreasing bandwidth channels. Digital ....

S. Viswanathan and T. Imielinski. Metropolitan Area Video-on-Demand Service Using Pyramid Broadcasting. Multimedia Systems, 4(4):197--208, August 1996.

....where request rates may be highly variable, therefore VoD service has to be highly adaptive, optimizing its server bandwidth usage to the level of request traffic. Existing VoD schemes fall in two categories: closed loop schemes [11] 10] 6] 15] 2] 7] 8] 16] and openloop schemes [3] [26], 1] 18] 4] In most closed loop schemes, the server allocates channels and schedules transmission of video streams based on client requests using batching, or patching techniques. In batching, requests for the same video clip are delayed for a certain amount of time to serve as many requests ....

....should make the server bandwidth usage independent of the request arrival rate when the rate is high while making the bandwidth usage low when the rate is low. Open loop schemes require constant bandwidth regardless of request rates. Recent years have seen a number of innovative open loop schemes [26], 1] 18] 19] 13] 4] that differ on multicast schedules and server bandwidth requirements. These schemes require only O(log L) server channels, the theoretical lower bound for required server channels for VoD. However, open loop schemes are not adaptive because the server broadcasts a ....

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems, pages 197-- 208, 1996.

....where request rates may be highly variable. In this environment, VoD service has to be highly adaptive, optimizing its server bandwidth usage to the level of request trac. Existing VoD schemes fall in two categories: closed loop schemes [12, 11, 7, 19, 2, 8, 9, 20] and open loop schemes [3, 31, 1, 22, 4]. In most closed loop schemes, the server allocates channels and schedules transmission of video streams based on client requests using batching, or patching techniques. In batching, requests for the same video clip are delayed for a certain amount of time to serve as many requests as possible ....

....should make the server bandwidth usage independent of the request arrival rate when the rate is high while making the bandwidth usage low when the rate is low. Open loop schemes require constant bandwidth regardless of request rates. Recent years have seen a number of innovative open loop schemes [31, 1, 22, 23, 17, 4] that di er on multicast schedules and server bandwidth requirements. These schemes require only O(log L) server channels, the theoretical lower bound for required server channels for VoD. However, open loop schemes are not adaptive because the server broadcasts a constant amount of video streams ....

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems, pages 197-208, 1996. Appendix A: Proof of Theorem 1 The arrival of requests for a particular clip is Poisson with rate . Therefore, the joint probability distribution of (z 1 ; z 2 ; :::; z n ) is given by:

....ideas from batching, static multicasting, dynamic multicasting, and client side caching to form a simple yet efficient architecture. Static multicast channels in SS VoD are scheduled using a simple staggered schedule similar to a near VoD (NVoD) system. While more sophisticated multicast schedules [10], 11] 13] 15] 17] 21] can achieve better resource savings, they often require more client side bandwidth and client side buffer. More importantly, these multicast schedules require the client to switch between multiple multicast channels during a video session to achieve the resource ....

....For the simplest example, NVoD repeatedly transmits a video over multiple channels at fixed time intervals so that an arriving user can simply join the next upcoming multicast cycle without incurring additional server resource. More sophisticated broadcasting schedules such as pyramid broadcasting [10], 11] skyscraper broadcasting [13] and Greedy Disk Conserving Broadcasting (GDB) 17] have been proposed to further reduce the resource requirement by trading off client side access bandwidth, buffer requirement, and multicast channel switching overhead as discussed in Section I. The fourth ....

[Article contains additional citation context not shown here]

S. Viswanathan and T. Imielinski, "Metropolitan area video-on-demand service using pyramid broadcasting," ACM Multimedia Syst., vol. 4, no. 4, pp. 197--208, 1996.

....by Associate Editor H. Watanabe. The author is with the Department of Information Engineering, the Chinese University of Hong Kong, Shatin, N.T. Hong Kong (e mail: jacklee computer. org) Digital Object Identifier 10.1109 TCSVT.2002.804890 pyramid broadcasting approach by Viswanathan et al. [6] and Aggarwal et al. 7] the piggybacking approach by Golubchik et al. 8] and Aggarwal et al. 9] and so on. It is beyond the scope of this study to compare these difference approaches and the interested readers are referred to [5] 13] for some comparative discussions. This study focuses on ....

S. Viswanathan and T. Imielinski, "Metropolitan area video-on-demand service using pyramid broadcasting," ACM Multimedia Syst., vol. 4, no. 4, pp. 197--208, 1996.

....requested video, the client no longer needs to communicate with the server. 1. 1 Motivation and Contributions Earlier periodic broadcast techniques concentrate on reducing service delays and client requirements by investigating different strategies to segment videos and broadcast these segments [19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30]. Later techniques focus on supporting VCR style operations such as fast forward and fastreverse [31, 32, 33] and handling packet loss using Forward Error Correction Codes [34] The effectiveness of existing periodic broadcast techniques is typically measured analytically. The cost of a ....

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. Mulitmedia Systems, 4(4):197--208, August 1996.

....to merge this customer back to an existing video stream via buffering. If this is not possible, the customer waits. B. Broadcasting Design The broadcasting design adopts the broadcast delivery paradigm [9 10] to serve many concurrent customers. There are three broadcasting designs for VOD [11 13]. The first design is called periodic broadcasting [11] It broadcasts multiple streams of the same video programme at staggered times periodically. To watch a video programme, a customer waits until a new video stream for this programme is broadcast and then he receives this stream. The system ....

....a good interactive effect, the staggering interval should be small but this would require a large number of broadcast channels. For example, if the staggering interval is 1 minute, then a 90 minute video programme requires 90 broadcast channels. The third design is called pyramid broadcasting [13]. It divides each video programme into K segments of increasing sizes, and broadcasts the i segment of all the video programmes periodically in the i broadcast channel. The bit rate of each broadcast channel is significantly larger than the video playback rate, especially when the number of ....

S. Viswanathan and T. Imielinski, "Metropolitan area video-on-demand service using pyramid broadcasting," Multimedia Systems, vol. 4, pp. 197-208, 1996.

....the multicast group at the same time in order to share the same data stream. For most applications, users usually request the same streaming data at di#erent times, i.e. user data requests are usually asynchronous. Extensive research has been conducted to resolve this issue [1, 2] 7] 9] 13][15, 17, 18, 22, 25]. For any streaming media on demand system, there is a time delay between a user s request and the data playout by the user, which is called the initial playout delay in this paper. The goal of streamingmedia on demand systems is to minimize the resource usage for a given initial playout. Two ....

....for a particular user is close to 10 minutes. But if we want to reduce the initial delay to 1 minute, then the resources consumption has to increase another 10 fold. Another class of techniques used to resolve the asynchronous issue is to use the so called skyscraper or pyramid broadcasting method [1, 7, 11, 12, 15, 17, 22, 25]. Using this method, the server multicasts di#erent segments of the requested data to di#erent channels or connections. These channels may have di#erent bandwidths, or equivalently, di#erent data rates are used for di#erent channels on which di#erent segments of the requested data are periodically ....

S. Viswanathan and T. Imielinski, "Metropolitan Area Video-on-Demand Service Using Pyramid Broadcasting", ACM Multimedia Systems Journal, 4(3), 197-208, 1996.

....for data access (10 20 ms) and a sucient amount of video data must be transferred in each disk access in order to improve the utilization of the e ective disk transfer bandwidth. 3. 2 User centered scheduling strategies A conventional VoD system assumes the user centered scheduling scheme [4, 83] in which a user eventually acquires some dedicated bandwidth. It can be achieved by providing (1) a sucient bandwidth equal to an object consumption rate multiplied by the number of users, or (2) less bandwidth, for which the users compete by negotiating with a scheduler. The consumption rate of ....

....they strive to make a better tradeo between the channel cost and the service latency. For example, most periodic broadcasting schemes try to reduce the service latency and improve the throughput at low channel costs. The performance of related periodic broadcasting schemes have been discussed in [4, 34, 42, 83]. 4.6 Other issues Besides the mentioned issues, there also are other important issues in multicast VoD service, such as: Copyright protection: A typical solution to video copyright protection is an encrypted point to point delivery to ensure that only paying customers receive the service, but ....

S. Viswanathan and T. Imielinski, \Metropolitan area video-on-demand service using pyramid broadcasting," Multimedia Systems, 4(4):197-208, August 1996.

....bandwidth efficient ondemand streaming system was Batching [DSS94] where the Server aggregated requests that came close together in time. Subsequently, many periodic broadcast methods have been proposed, while some theoretical lower bounds [EVZ99, SGT99] have been obtained. Pyramid Broadcasting [VI96] divides data into segments of geometrically increasing sizes and broadcasts them on a few high bandwidth streams. A derivative, Skyscraper Broadcasting [HS97] offers much better performance. More currently, a family of protocols related to Harmonic Broadcasting [JT97, PCL98a] seems to be the ....

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. In Multimedia Systems, Vol. 4, pages 197--208, 1996. 17

....Research Council (NSERC) of Canada under grant OGP 0000264. Email address: vernon cs.wisc.edu. Research of this author was partially supported by the National Science Foundation (NSF) under grants CCR 9975044, ANI 0117810 and EIA 0127857. 1. Introduction Scalable streaming protocols (e. g, [4, 5, 8 19, 23, 24]) have been proposed that can efficiently deliver multimedia files with server and network bandwidth that scales much less than linearly in the request rate. Although scalable streaming offers the promise of efficient, low delay service to large numbers of clients, previous work does not fully ....

S. Viswanathan and T. Imielinski, "Metropolitan Area Video-on-Demand Service using Pyramid Broadcasting", Multimedia Systems 4, 4 (Aug. 1996), pp. 197-208.

....bounds the service latency, bypasses the need to process individual user requests, and eliminate the need for an upstream channel. Thus, periodic broadcast is more scalable than TVOD or other NVOD techniques. Due to these bene ts, a number of periodic broadcast schemes have been recently presented[3, 9, 12 14,17 19, 22]. In staggered broadcasting[9] several channels broadcast a video periodically with staggered start times. In this case the maximum service latency is the length of video divided by the number of the channels allocated for the video. Most proposed schemes aim at minimizing the system required ....

....client I O bandwidth, client disk space, etc. Recently, videos have been fragmented into separate segments and each segment then transmitted repeatedly over a di erent channel. Periodic broadcast schemes can be divided into pyramid based schemes and harmonicbased schemes. The pyramid based schemes[3, 12, 13, 22] divide each video into segments of increasing size and transmit the segments over equal bandwidth channels. On the other hand, the harmonic based schemes[14, 17, 18] divide each video into segments of equal size and transmit the segments over decreasing bandwidth channels. Digital ....

S. Viswanathan and T. Imielinski. Metropolitan Area Video-on-Demand Service Using Pyramid Broadcasting. Multimedia Systems, 4(4):197-208, August 1996.

....SkB Broadcast Hybrid Fixed Size High Cost Fig. I A 2 dimensional design space. Fixed Bandwidth Approach: This approach logically partitions a video into segments of varying sizes. Each segment is repeatedly broadcast on a separate channel of equal bandwidth. Pyramid Broadcast (PB) [10,11] employs a geometric function to determine segment sizes and repeatedly broadcasts each segment at a very high data rate. The client prefetches data to ensure that the next segment is always accessible before the current segment is completely played out. To cope with the very high data rate on ....

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. Mulitmedia Systems, 4(4):197-208, August 1996.

....providing scalable Internet services to potentially vast numbers of clients. Particularly challenging are scalable delivery protocols for applications that require on demand streaming of multimedia, such as news services, distance education, or entertainment on demand. Recently proposed protocols [3, 5 7, 9 17, 20, 22, 23] use broadcast or multicast to reduce the required server and To appear in Proc. A CM SIGMETRICS 2002 Int l. Conf. On Measurement and Modeling of Computer Systems, Marina del Rey, CA, June 2002. network bandwidth from linear in the request rate, to sublinear. They achieve this bandwidth ....

.... Three of the recent multicast streaming protocols, namely patching [5, 6, 14, 16, 22] dynamic skyscraper [9, 11] and hierarchical stream merging (HSM) 3, 7, 10 12] provide scalable on demand streaming without requiring clients to wait for some period of time as in a periodic broadcast system [13, 15, 17, 20, 23] or a batching system. These three protocols and a variant of HSM called bandwidth skimming [10] have been compared using a server cost or provisioning measure termed the required sen,er bandwidth [11, 12] This measure is the average concurrent server bandwidth used if the server has infinite ....

S. Viswanathan and T. Imielinski, "Metropolitan Area Video-on-Demand Service using Pyramid Broadcasting", Multimedia Systems 4, 4 (Aug. 1996), pp. 197-208.

....objects, and isochronous delivery requirements from the users. A variety of techniques have been proposed in the literature to efficiently utilize the backbone network bandwidth for streaming. Some of them use multicast as a means to reduce the backbone bandwidth usage: periodic broadcast ing [4, 1, 5, 13], simple hatching, hatching with patching [6, 12, 14] and optimized patching with classes of service [9] While these multicast based schemes afford very low backbone bandwidth usage, they are not in widespread use due to their dependency on network level multicast, which is not widely available ....

S.Viswanathan and T.Imielinski. Metropolitan Area Video-on-Demand Service using Pyramid Broadcasting. Multimedia Systems, 4, August 1996.

....Today s multicast protocols [1] are not optimized for video applications. Particularly, they cannot deliver video on demand (VOD) This restriction has led to a large body of recent work looking for remedies at the application level. They are Periodic Broadcasting (PB) 2] 3] 4] 5] [6], 7] 8] Batching ( 9] 10] Chaining [11] Piggybacking [12] and Patching ( 13] 14] A network level scheme was presented in [15] which caches data at routers in the network to service subsequent requests. In a sense, cached data act as a huge virtual server to all users, therefore ....

S. Viswanathan and T. Imielinski, "Metropolitan area video-on-demand service using pyramid broadcasting," ACM Multimedia systems Journal, vol. 4, no. 4, pp. 179--208, August 1996.

....video streams so that future video transmissions can be reduced. Their simulation results showed that stream tapping can achieve lower latency under the same load when compared to simple batching. There are still other approaches to improving VoD system efficiency, such as pyramid broadcasting [11], 12] piggybacking [13] 14] and asynchronous multicasting [15] 16] These approaches are not directly related to our work so we refer the interested readers to the cited literature. B. Comparisons and Contributions The primary contribution of this work is the unification of TVoD and NVoD ....

S. Viswanathan and T. Imielinski, "Metropolitan area video-on-demand service using pyramid broadcasting," ACM Multimedia Syst., vol. 4, no. 4, pp. 197--208, 1996.

....with # frames. It is usual but not necessary that our frames map to actual video frames. For example, for a pure audio stream, frames are simply conveniently sized blocks of sequential audio data. B. Related work One of the earlier periodic broadcasting schemes was Pyramid Broadcasting (PB) [2], which divides movies into segments of geometrically increasing sizes and broadcasts them on a few high bandwidth streams. A derivative, Skyscraper Broadcasting [3] offers much better performance. Harmonic Broadcasting based protocols [4, 5] split a movie into fixedsize segments and broadcast ....

S. Viswanathan and T. Imielinski, "Metropolitan area video-on-demand service using pyramid broadcasting," in Multimedia Systems, Vol. 4, 1996, pp. 197--208.

No context found.

S. Viswanathan, and T. Imielinski, "Metropolitan area video-on-demand service using Pyramid Broadcasting", IEEE Multimedia Systems. 4:197208, 1996.

No context found.

S. Viswanathan and T. Imielinski. Metropolitan Area Video-on-Demand Service using Pyramid Broadcasting. Multimedia System, 4(4):197--208, 1996.

No context found.

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems J., 4(3):197--208, Aug. 1996.

No context found.

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems J., 4(3):197--208, Aug. 1996.

No context found.

S. Viswanathan and T. Imielinski, \Metropolitan Area Video-on-Demand Service Using Pyramid Broadcasting", ACM Multimedia Systems Journal, 4(3), 197-208, 1996.

No context found.

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broacasting. Multimedia Systems, 4(4):179--208, August 1998.

No context found.

S. Viswanathan and T. Imielinski, "Metropolitan Area Video-on-Demand Service Using Pyramid Broadcasting," IEEE Multimedia Systems, vol. 4, 1996, pp.197-208.

No context found.

S. Viswanathan and T. Imielinski, "Metropolitan Area Video-on-Demand Service using Pyramid Broadcasting," Multimedia Systems, vol. 4, 1996.

No context found.

S. Viswanathan and T. Imielinski. Metropolitan Area Video-on-Demand Service using Pyramid Broadcasting. Multimedia System, 4(4):197--208, 1996.

No context found.

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems J., 4(3):197--208, Aug. 1996.

No context found.

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broacasting. Multimedia Systems, 4(4):179--208, August 1998.

No context found.

S. Viswanathan and T. Imielinski, "Metropolitan Area Video-on-Demand Service using Pyramid Broadcasting, " Multimedia Systems 4, 1996.

No context found.

S. Viswanathan and Tomasz Imielinski. Metropolitan Area Video-on-Demand Service using Pyramid Broadcasting. Multimedia Systems, 4(4):197-208, August 1996.

No context found.

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems Journal, Vol. 4, No. 3, 197-208, 1996. 35

No context found.

Viswanathan, S., and T. Imielinski, "Metropolitan area video-on-demand service using pyramid broadcasting," ACM Multimedia Systems Journal, 4(4):197--208, Aug. 1996.

No context found.

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. Multimedia Systems, 4(4):197--208, 1996.

No context found.

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems Journal, Vol. 4, No. 3, 197-208, 1996.

No context found.

S. Viswanathan and T. Imielinski, "Metropolitan area video-on-demand service using pyramid broadcasting," IEEE Multimedia, pp. 197--208, Aug. 1996.

No context found.

S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Journal of Multimedia Systems, 4(3):197-208, 1996. 19

No context found.

S. Viswanathan and T. Imielinski, "Metropolitan Area Video-on-demand Service Using Pyramid Broadcasting," Multimedia Systems, 4(5):197-208, Aug. 1996.

No context found.

S. Viswanathan and T. Imielinski. "Metropolitan area video-on-demand service using pyramid broadcasting." Multimedia Systems, 4(4):197--208, 1996.

No context found.

Viswanathan, S., and Imielinski, T., "Metropolitan Area Video-on-demand Service using Pyramid Broadcasting" ACM Multimedia Systems, Vol. 4, pp. 197-208, 1996.

No context found.

Viswanathan, S., and Imielinski, T., \Metropolitan Area Video-on-demand Service using Pyramid Broadcasting" ACM Multimedia Systems, Vol. 4, pp. 197-208, 1996.

No context found.

S. Viswanathan and T. Imielinski, "Metropolitan area video-on-demand service using pyramid broadcasting," Multimedia systems 4, pp. 179--208, August 1996.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC