{"title":"Randomized token buckets: reducing the buffers required in multiplexors","authors":"J. Fingerhut, G. Varghese","doi":"10.1109/NOSDAV.1997.629388","DOIUrl":"https://doi.org/10.1109/NOSDAV.1997.629388","url":null,"abstract":"We study the buffer requirements for N identical token bucket streams that are fed to a multiplexor. If the token bucket streams are synchronized the buffer size requirement at the multiplexor is N/spl middot/B, where B is the size of the token bucket. We introduce a new variant of token bucket schemes that we call randomized token bucket schemes that insert random delays to prevent the streams from becoming (and remaining) synchronized. We show, using a combination of analysis and simulation that the buffer size is reduced to at most 3/spl radic/NB with fixed small (10/sup -6/) probability of buffer overflow. Because of the randomization, this result does not depend on assumptions about input traffic patterns. While our analysis has been focused on a simple multiplexor, our research is motivated by the possible use of randomized leaky bucket as a traffic shaping mechanism to reduce buffer size and end-to-end delays across multiple hops in a network.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124972710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Resilient multicast support for continuous-media applications","authors":"X.R. Xu, A. Myers, Hui Zhang, R. Yavatkar","doi":"10.1109/NOSDAV.1997.629385","DOIUrl":"https://doi.org/10.1109/NOSDAV.1997.629385","url":null,"abstract":"The IP multicast delivery mechanism provides a popular basis for delivery of continuous media to many participants in a conferencing application. However, the best-effort nature of multicast delivery results in poor playback quality in the presence of network congestion and packet loss. Contrary to widespread belief that the real-time nature of continuous media applications precludes the possibility of recovery of lost packets using retransmissions, we have found that these applications offer an interesting tradeoff between the desired playback quality and the desired degree of interactivity. In particular, we propose a new model of multicast delivery called resilient multicast in which each receiver in a multicast group can decide its own tradeoff between reliability and real-time requirements. To be effective, error recovery mechanisms in such a model need to be both fast (due to the real-time constraint) and have a low overhead (due to high volume of continuous media data). We have designed a resilient multicast protocol called STORM (STructure-Oriented Resilient Multicast) in which senders and receivers collaborate to recover from lost packets using two key ideas. First, group participants self-organize themselves into a distribution structure and use the structure to recover lost packets from adjacent nodes. Second, the distribution structure is dynamic and a lightweight algorithm is used to adapt the structure to changing network traffic conditions and group membership. We have implemented STORM in both VAT and a packet level simulator. Experimental results using both the MBONE and a simulation model demonstrate the effectiveness of our approach.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122726404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A fresh approach to file system quality of service","authors":"Paul Barham","doi":"10.1109/NOSDAV.1997.629372","DOIUrl":"https://doi.org/10.1109/NOSDAV.1997.629372","url":null,"abstract":"This paper describes a file system for supporting quality of service (QoS) guarantees. The device driver model clearly separates control- and data-path operations and presents a low-level of abstraction. The data-path module provides translation and protection of I/O requests enabling the file system layers to be executed as unprivileged code within shared libraries. Scheduling of low-level operations within the device driver is used to provide isolation between clients and quality of service guarantees.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131313507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Service aggregation through rate adaptation using a single storage format","authors":"Rajesh Krishnan, Thomas D. C. Little","doi":"10.1109/NOSDAV.1997.629386","DOIUrl":"https://doi.org/10.1109/NOSDAV.1997.629386","url":null,"abstract":"Service aggregation schemes like batching, caching and rate adaptation can enable large scale interactive multimedia services, such as movies-on-demand and popular television programming. These applications are characterized by a large user population and a high density of access. Rate adaptation is a dynamic service aggregation technique that can merge streams and reclaim resources at run-time. Existing schemes for rate adaptation are expensive since they require multiple content storage formats or special hardware, therefore, this technique has not been exploited so far. We propose a novel data placement and disk scheduling strategy which supports two different content progression rates originating from a single storage format, and that is applicable to single-disk architectures as well as to multi-disk architectures with large or small stripe-sets. The proposal leads to a feasible solution for dynamic service aggregation via rate adaptation, thereby making large scale multimedia services more economical.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122102745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. Miller, Heung-Man Lam, XiaoChun Mei, K. Zhang, S. Tripathi
{"title":"Practical experience with a smoothing algorithm for video streaming","authors":"F. Miller, Heung-Man Lam, XiaoChun Mei, K. Zhang, S. Tripathi","doi":"10.1109/NOSDAV.1997.629387","DOIUrl":"https://doi.org/10.1109/NOSDAV.1997.629387","url":null,"abstract":"An on-demand system for transmission of MPEG-1 video across Internet connections using a smoothing algorithm developed by (Salehi et al., 1996) is presented. Experiments with this system transmitting video over Ethernet and ATM network hardware indicate the potential for higher playback rates in our system when smoothed transmissions are used.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"24 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114397275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. McCanne, Eric A. Brewer, R. Katz, L. Rowe, E. Amir, Y. Chawathe, A. Coopersmith, Ketan Mayer-Patel, Suchitra Raman, Angela Schuett, David Simpson, Andrew Swan, T. Tung, David Wu, Brian Smith
{"title":"Toward a common infrastructure for multimedia-networking middleware","authors":"S. McCanne, Eric A. Brewer, R. Katz, L. Rowe, E. Amir, Y. Chawathe, A. Coopersmith, Ketan Mayer-Patel, Suchitra Raman, Angela Schuett, David Simpson, Andrew Swan, T. Tung, David Wu, Brian Smith","doi":"10.1109/NOSDAV.1997.629353","DOIUrl":"https://doi.org/10.1109/NOSDAV.1997.629353","url":null,"abstract":"Real-time multimedia streams like audio and video are now integral data types in modern programming environments. Although a great deal of research has investigated effective and efficient programming support for manipulating such streams and although the design of digital media \"middleware\" is fairly well understood, no widely available or commonly accepted programming model exists within the research community. The authors believe this lack of common practice impedes our collective progress because it prevents disparate research groups from easily leveraging each other's work. They propose a solution to this problem that combines the best features of a number of existing multimedia toolkits-Berkeley's Continuous Media Toolkit, MIT's VuSystem, and the LBL/UCB MBone tools-into a fine-grained, extensible, and high performance toolkit. They describe the convergence of these three toolkits into a common programming infrastructure and argue that the availability and acceptance of the middleware could potentially facilitate and accelerate breakthroughs in multimedia networking.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130488714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fair airport scheduling algorithms","authors":"P. Goyal, H. Vin","doi":"10.1109/NOSDAV.1997.629392","DOIUrl":"https://doi.org/10.1109/NOSDAV.1997.629392","url":null,"abstract":"We design a class of Fair Airport algorithms that combines Start-time Fair Queuing with a non-work conserving algorithm in Rate Controlled Service Discipline (RCSD) class. We derive fairness and deadline guarantees for FA servers and demonstrate that by appropriately choosing an algorithm from RCSD class, algorithms that either allocate only rate or achieve separation of rate and delay allocation and are fair over Fluctuation Constrained variable rate servers can be designed. This method leads to the design of the first fair algorithm that achieves separation of rate and delay allocation. We also show that the FA class contains algorithms with different implementation complexity and performance guarantees and thus enables tradeoffs between the two. Furthermore, since FA contains algorithms that are fair over variable rate servers, they can be employed for achieving hierarchical link sharing. Finally, we demonstrate that the FA algorithms can be generalized to achieve other objectives such as prioritized fair allocation of residual bandwidth.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124704512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient striping techniques for multimedia file servers","authors":"Prashant Shenoy, H. Vin","doi":"10.1109/NOSDAV.1997.629332","DOIUrl":"https://doi.org/10.1109/NOSDAV.1997.629332","url":null,"abstract":"The performance of striped disk arrays is governed by two parameters: the stripe unit size and the degree of striping. The authors describe techniques for determining the stripe unit size and degree of striping for disk arrays storing variable bit rate continuous media data. They present an analytical model that uses the server configuration and the workload characteristics to predict the load on the most heavily loaded disk in redundant and non-redundant arrays. They then use the model to determine the optimal stripe unit size for different workloads. They also use the model to study the effect of various system parameters on the optimal stripe unit size. To determine the degree of striping, they first demonstrate that striping a continuous media stream across all disks in the array causes the number of clients supported to increase sub-linearly with increase in the number of disks. To maximize the number of clients supported in large arrays, they propose a technique that partitions a disk array and stripes each media stream across a single partition. Since load imbalance can occur in such partitioned arrays, they present an analytical model to compute the imbalance across partitions in the array. They then use the model to determine a partition size that minimizes the load imbalance, and hence, maximizes the number of clients supported by the array.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115333112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
W. Feng, D. Kandlur, Diptikalyan Saha, Kang G. Shin
{"title":"Understanding TCP dynamics in an integrated services Internet","authors":"W. Feng, D. Kandlur, Diptikalyan Saha, Kang G. Shin","doi":"10.1109/NOSDAV.1997.629395","DOIUrl":"https://doi.org/10.1109/NOSDAV.1997.629395","url":null,"abstract":"A large number of Internet applications are sensitive to overload conditions in the network. While these applications have been designed to adapt somewhat to the varying conditions in the Internet, they can benefit greatly from an increased level of predictability in network services. We propose minor extensions to the packet queueing and discard mechanisms used in routers, coupled with simple control mechanisms at the source that enable the network to guarantee minimal levels of throughput to different network sessions while sharing the residual network capacity in a cooperative manner. The service realized by the proposed mechanisms is an interpretation of the controlled-load service being standardized by the IETF. Although controlled-load service can be used in conjunction with any transport protocol, our focus in this paper is on understanding its interaction with TCP. Specifically, we study the dynamics of TCP traffic in an integrated services network that simultaneously supports both best-effort and controlled-load sessions. In light of this study, we propose and experiment with several variations to TCP's control mechanisms with the objective of fine-tuning them for an integrated services environment. We then investigate the overheads associated with these enhancements and the benefits they provide. Finally, we show how the service mechanisms proposed here can be embedded within more elaborate packet and link scheduling frameworks in a fully-evolved integrated services Internet.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131691081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ThinStreams: an architecture for multicasting layered video","authors":"L. Wu, R. Sharma, B. Smith","doi":"10.1109/NOSDAV.1997.629384","DOIUrl":"https://doi.org/10.1109/NOSDAV.1997.629384","url":null,"abstract":"Multicast is a common method for distributing audio and video over the Internet. Since receivers are heterogeneous in processing capability, network bandwidth, and requirements for video quality, a single multicast stream is usually insufficient. A common strategy is to use layered video coding with multiple multicast groups. In this scheme, a receiver adjusts its video quality by selecting the number of multicast groups, and thereby video layers, it receives. Implementing this scheme requires the receivers to decide when to join a new group or leave a subscribed group. This paper presents a new solution to the join/leave problem using ThinStreams. In ThinStreams, a single video layer is multicast over several multicast groups, each with identical bandwidth. ThinStreams separates the coding scheme (i.e., the video layers) from control (i.e., the multicast groups), helping to bound network oscillations caused by receivers joining and leaving high bandwidth multicast groups. This work evaluates the join/leave algorithms used in ThinStreams using simulations and preliminary experiments on the MBONE. It also addresses fairness among independent video broadcasts and shows how to prevent interference between them.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130277011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}