Pooja Agarwal, Raoul Rivas, Wanmin Wu, A. Arefin, Zixia Huang, K. Nahrstedt
This paper presents a novel paradigm of Streaming as a Service (SAS) to model correlated multi-streaming in Distributed Interactive Multimedia Environments. We propose SAS Kernel, a generic, distributed, and modular service kernel realizing SAS paradigm. SAS Kernel features high exibility by employing a configurable interface to allow for input of correlated multi-streams (bundle of streams) from diverse types of sensory devices. It is also highly extensible by allowing user-controlled functions to be applied to bundle of streams in runtime. Experiments with real-world applications demonstrate that the SAS Kernel incurs low overhead in delay, CPU, and bandwidth demands.
本文提出了一种新的流即服务(Streaming as a Service, SAS)模式来对分布式交互多媒体环境中相关的多流进行建模。SAS Kernel是一种实现SAS范式的通用、分布式、模块化服务内核。SAS内核通过采用可配置接口来允许从不同类型的传感设备输入相关的多流(流束)，从而具有高灵活性。它还具有高度的可扩展性，允许用户控制的函数在运行时应用于流包。实际应用程序的实验表明，SAS内核在延迟、CPU和带宽需求方面的开销很低。
{"title":"SAS kernel: streaming as a service kernel for correlated multi-streaming","authors":"Pooja Agarwal, Raoul Rivas, Wanmin Wu, A. Arefin, Zixia Huang, K. Nahrstedt","doi":"10.1145/1989240.1989261","DOIUrl":"https://doi.org/10.1145/1989240.1989261","url":null,"abstract":"This paper presents a novel paradigm of Streaming as a Service (SAS) to model correlated multi-streaming in Distributed Interactive Multimedia Environments. We propose SAS Kernel, a generic, distributed, and modular service kernel realizing SAS paradigm. SAS Kernel features high exibility by employing a configurable interface to allow for input of correlated multi-streams (bundle of streams) from diverse types of sensory devices. It is also highly extensible by allowing user-controlled functions to be applied to bundle of streams in runtime. Experiments with real-world applications demonstrate that the SAS Kernel incurs low overhead in delay, CPU, and bandwidth demands.","PeriodicalId":254694,"journal":{"name":"Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125113645","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}
Rohan Gandhi, Meilin Yang, Dimitrios Koutsonikolas, Y. C. Hu, M. Comer, Amr M. Mohamed, Chih-Chun Wang
A primary challenge in multicasting video in a wireless LAN is to deal with the client diversity -- clients may have different channel characteristics and hence receive different numbers of transmissions from the AP. A promising approach to overcome this problem is to combine scalable video coding techniques such as MRC or MDC, which divide a video stream into multiple substreams, with inter-layer network coding. The fundamental challenge in such an approach is to determine the strategy of coding the packets across different layers that maximizes the number of decoded layers at all clients. In [7], the authors showed that inter-layer NC indeed helps the delivery of MRC coded media over the WiFi, and proposed how to efficiently search for the optimal coding strategies online. In this paper, we study (1) how NC can help with WiFi delivery of MDC media, and (2) in particular, due to the different decoding requirements of MDC from MRC, whether WiFi delivery of MDC media can benefit more from NC compared to that of MRC media. Our simulation results are somewhat surprising. Even though MDC is generally shown to outperform MRC in lossy channels, most of the benefit of MDC over MRC is lost after applying NC to both schemes.
{"title":"The impact of inter-layer network coding on the relative performance of MRC/MDC WiFi media delivery","authors":"Rohan Gandhi, Meilin Yang, Dimitrios Koutsonikolas, Y. C. Hu, M. Comer, Amr M. Mohamed, Chih-Chun Wang","doi":"10.1145/1989240.1989249","DOIUrl":"https://doi.org/10.1145/1989240.1989249","url":null,"abstract":"A primary challenge in multicasting video in a wireless LAN is to deal with the client diversity -- clients may have different channel characteristics and hence receive different numbers of transmissions from the AP. A promising approach to overcome this problem is to combine scalable video coding techniques such as MRC or MDC, which divide a video stream into multiple substreams, with inter-layer network coding. The fundamental challenge in such an approach is to determine the strategy of coding the packets across different layers that maximizes the number of decoded layers at all clients. In [7], the authors showed that inter-layer NC indeed helps the delivery of MRC coded media over the WiFi, and proposed how to efficiently search for the optimal coding strategies online. In this paper, we study (1) how NC can help with WiFi delivery of MDC media, and (2) in particular, due to the different decoding requirements of MDC from MRC, whether WiFi delivery of MDC media can benefit more from NC compared to that of MRC media. Our simulation results are somewhat surprising. Even though MDC is generally shown to outperform MRC in lossy channels, most of the benefit of MDC over MRC is lost after applying NC to both schemes.","PeriodicalId":254694,"journal":{"name":"Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128029742","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}
Last year at Google IO, we launched the WebM Project(webmproject.org) a project that aims to develop a high-quality, open video format for the web that is freely available to everyone. In this session, we'll explore the history of the project and discuss the long term goals we have for WebM. We'll also deep dive in all the pieces that make up the WebM format, review related projects and present the technical features that make WebM work especially well for web video. Finally, we'll compare the performance of WebM to other formats used on the Internet and open up the floor for discussion.
{"title":"Intro to WebM","authors":"Jim Bankoski","doi":"10.1145/1989240.1989242","DOIUrl":"https://doi.org/10.1145/1989240.1989242","url":null,"abstract":"Last year at Google IO, we launched the WebM Project(webmproject.org) a project that aims to develop a high-quality, open video format for the web that is freely available to everyone. In this session, we'll explore the history of the project and discuss the long term goals we have for WebM. We'll also deep dive in all the pieces that make up the WebM format, review related projects and present the technical features that make WebM work especially well for web video. Finally, we'll compare the performance of WebM to other formats used on the Internet and open up the floor for discussion.","PeriodicalId":254694,"journal":{"name":"Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132849913","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}
In this paper, we propose a content-based, threaded stereoscopic video compression algorithm. We believe that it is likely future stereoscopic imaging systems will contain more than two lenses, allowing the display system to optimize the stereoscopic viewing experience. Furthermore, it will allow for the adjustment of framing (scene) composition errors that can arise from stereoscopic capture. Our proposed system uses 10 linearly aligned lenses. Upon capture, the images are run through a feature detection and matching algorithm in order to determine disparity between the stereoscopic images. During compression, the disparity measurements can be used to drive the selection of key frames within the image sets to provide better retrieval of data for display.
{"title":"Systems support for stereoscopic video compression","authors":"W. Feng, Feng Liu, Yuzhen Niu, Scott Price","doi":"10.1145/1989240.1989265","DOIUrl":"https://doi.org/10.1145/1989240.1989265","url":null,"abstract":"In this paper, we propose a content-based, threaded stereoscopic video compression algorithm. We believe that it is likely future stereoscopic imaging systems will contain more than two lenses, allowing the display system to optimize the stereoscopic viewing experience. Furthermore, it will allow for the adjustment of framing (scene) composition errors that can arise from stereoscopic capture. Our proposed system uses 10 linearly aligned lenses. Upon capture, the images are run through a feature detection and matching algorithm in order to determine disparity between the stereoscopic images. During compression, the disparity measurements can be used to drive the selection of key frames within the image sets to provide better retrieval of data for display.","PeriodicalId":254694,"journal":{"name":"Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126452123","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}
The problem of streaming packetized media has been intensively studied for a long time. In this paper, we revisit this problem in the high-speed railway context, where passengers encode and upload videos through increasingly powerful smartphones. The challenge is highlighted by the fast changing channel conditions in high-speed trains and the limited battery of cell phones. Inspired by the unique spatial-temporal characteristics of wireless signals along high-speed railways, we propose a novel energy-efficient and rate-distortion optimized approach for video streaming. Our solution effectively predicts the signal strength through its spatial-temporal periodicity in this new application scenario. It then smartly adjusts the GOF budget, schedules the video transmission to achieve graceful rate-distortion performance and yet conserves the energy consumption. Performance evaluation based on simulated railway scenarios and H.264 video traces demonstrates the effectiveness of our solution and its superiority as compared to existing solutions.
{"title":"Energy-efficient video streaming from high-speed trains","authors":"Xiaoqiang Ma, Jiangchuan Liu, Hongbo Jiang","doi":"10.1145/1989240.1989269","DOIUrl":"https://doi.org/10.1145/1989240.1989269","url":null,"abstract":"The problem of streaming packetized media has been intensively studied for a long time. In this paper, we revisit this problem in the high-speed railway context, where passengers encode and upload videos through increasingly powerful smartphones. The challenge is highlighted by the fast changing channel conditions in high-speed trains and the limited battery of cell phones. Inspired by the unique spatial-temporal characteristics of wireless signals along high-speed railways, we propose a novel energy-efficient and rate-distortion optimized approach for video streaming. Our solution effectively predicts the signal strength through its spatial-temporal periodicity in this new application scenario. It then smartly adjusts the GOF budget, schedules the video transmission to achieve graceful rate-distortion performance and yet conserves the energy consumption. Performance evaluation based on simulated railway scenarios and H.264 video traces demonstrates the effectiveness of our solution and its superiority as compared to existing solutions.","PeriodicalId":254694,"journal":{"name":"Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121579443","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}
The popularity of P2P streaming systems has rapidly created extensive, far-reaching Internet traffic. Recent studies have demonstrated that localizing cross-ISP (Internet service provider) traffic can mitigate this challenge. Another trend shows that households own an increasing number of devices, which are sharing a LAN of 2 or more peers. To this date, however, no study has investigated the potential of localizing traffic within LANs. In our presented work, we propose the concept of LAN-awareness and introduce its threefold benefits: 1) reducing Internet streaming traffic, 2) lowering stream server workload, and 3) improving streaming quality. First we conduct a large-scale measurement on PPLive, confirming that a considerable number of peers (up to 21%) are connected to the LANs having 2 or more peers. Recognizing the opportunity of localizing traffic within LANs, we discuss the principles to construct a LAN-aware overlay and propose a heuristic. The results of our trace-driven simulations confirm the benefits outlined above.
{"title":"LAN-awareness: improved P2P live streaming","authors":"Zhijie Shen, Roger Zimmermann","doi":"10.1145/1989240.1989244","DOIUrl":"https://doi.org/10.1145/1989240.1989244","url":null,"abstract":"The popularity of P2P streaming systems has rapidly created extensive, far-reaching Internet traffic. Recent studies have demonstrated that localizing cross-ISP (Internet service provider) traffic can mitigate this challenge. Another trend shows that households own an increasing number of devices, which are sharing a LAN of 2 or more peers. To this date, however, no study has investigated the potential of localizing traffic within LANs. In our presented work, we propose the concept of LAN-awareness and introduce its threefold benefits: 1) reducing Internet streaming traffic, 2) lowering stream server workload, and 3) improving streaming quality. First we conduct a large-scale measurement on PPLive, confirming that a considerable number of peers (up to 21%) are connected to the LANs having 2 or more peers. Recognizing the opportunity of localizing traffic within LANs, we discuss the principles to construct a LAN-aware overlay and propose a heuristic. The results of our trace-driven simulations confirm the benefits outlined above.","PeriodicalId":254694,"journal":{"name":"Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131608382","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}
IP telephony suffers from the well-known fact that the Internet does only provide a best-effort service. Thus, minimum transmission quality cannot be guaranteed and, especially during times of network congestion or occasional link failures, UDP-based VoIP becomes unusable. To overcome these limitations, we have developed a rate-adaptive transmission system for highly scalable speech and audio codecs that uses the Delay Tolerant Networking (DTN) approach for very low bit rates. In this way, as soon as the available transmission capacity falls below the minimum coding rate, our system switches to a Push-To-Talk (PTT) like conversational mode. Subjective conversational quality tests have shown that the algorithm allows for a good and effective conversation (MOS-CQS is 3.5) even in cases where traditional UDP based VoIP telephony fails (MOS-CQS is 1).
{"title":"A DTN mode for reliable internet telephony","authors":"C. Hoene, Patrick Schreiner","doi":"10.1145/1989240.1989257","DOIUrl":"https://doi.org/10.1145/1989240.1989257","url":null,"abstract":"IP telephony suffers from the well-known fact that the Internet does only provide a best-effort service. Thus, minimum transmission quality cannot be guaranteed and, especially during times of network congestion or occasional link failures, UDP-based VoIP becomes unusable. To overcome these limitations, we have developed a rate-adaptive transmission system for highly scalable speech and audio codecs that uses the Delay Tolerant Networking (DTN) approach for very low bit rates. In this way, as soon as the available transmission capacity falls below the minimum coding rate, our system switches to a Push-To-Talk (PTT) like conversational mode. Subjective conversational quality tests have shown that the algorithm allows for a good and effective conversation (MOS-CQS is 3.5) even in cases where traditional UDP based VoIP telephony fails (MOS-CQS is 1).","PeriodicalId":254694,"journal":{"name":"Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video","volume":"416 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126697741","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}
Social networked applications have been more and more popular, and have brought great challenges to the network engineering, particularly the huge demands of bandwidth and storage for social media. The recently emerged content clouds shed light on this dilemma. Towards the migration to clouds, partitioning the social contents has drawn significant interests from the literature. Yet the existing works focus on preserving the social relationship only, while an important factor, user access pattern, is largely overlooked. In this paper, by examining a large collection of YouTube video data, we first demonstrate that partitioning the network entirely based on social relationship would lead to unbalanced partitions in terms of access. We further analyze the role of social relationship in the social media applications, and conclude that user access pattern should be taken into account and social relationship should be dynamically preserved. We formulate the problem as a constrained k-medoids clustering problem, and propose a novel Weighted Partitioning Around Medoids (wPAM) solution. We present a dissimilarity/similarity metric to facilitate the preservation of the social relationship. We compare our solution with other state-of-the-art algorithms, and the preliminary results show that it significantly decreases the access deviation in each cloud server, and flexibly preserves the social relationship.
{"title":"Load-balanced migration of social media to content clouds","authors":"Xu Cheng, Jiangchuan Liu","doi":"10.1145/1989240.1989254","DOIUrl":"https://doi.org/10.1145/1989240.1989254","url":null,"abstract":"Social networked applications have been more and more popular, and have brought great challenges to the network engineering, particularly the huge demands of bandwidth and storage for social media. The recently emerged content clouds shed light on this dilemma. Towards the migration to clouds, partitioning the social contents has drawn significant interests from the literature. Yet the existing works focus on preserving the social relationship only, while an important factor, user access pattern, is largely overlooked. In this paper, by examining a large collection of YouTube video data, we first demonstrate that partitioning the network entirely based on social relationship would lead to unbalanced partitions in terms of access. We further analyze the role of social relationship in the social media applications, and conclude that user access pattern should be taken into account and social relationship should be dynamically preserved. We formulate the problem as a constrained k-medoids clustering problem, and propose a novel Weighted Partitioning Around Medoids (wPAM) solution. We present a dissimilarity/similarity metric to facilitate the preservation of the social relationship. We compare our solution with other state-of-the-art algorithms, and the preliminary results show that it significantly decreases the access deviation in each cloud server, and flexibly preserves the social relationship.","PeriodicalId":254694,"journal":{"name":"Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125302675","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}
This paper explores a new abstraction to replace the framebuffer as the metaphor for a new display interface. Our novel approach aims to provide backward compatibility with applications that require a simple framebuffer, while also providing tremendous channel capacity savings to applications that exploit application level semantics to use the display interface in a more sophisticated way. The goal is to develop a versatile interface that scales from very large displays to small, low-power displays connected over wireless links.
{"title":"Moving beyond the framebuffer","authors":"Charles D. Estes, Ketan Mayer-Patel","doi":"10.1145/1989240.1989264","DOIUrl":"https://doi.org/10.1145/1989240.1989264","url":null,"abstract":"This paper explores a new abstraction to replace the framebuffer as the metaphor for a new display interface. Our novel approach aims to provide backward compatibility with applications that require a simple framebuffer, while also providing tremendous channel capacity savings to applications that exploit application level semantics to use the display interface in a more sophisticated way. The goal is to develop a versatile interface that scales from very large displays to small, low-power displays connected over wireless links.","PeriodicalId":254694,"journal":{"name":"Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131890091","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}
TCP is quite a heavyweight protocol when serving very small web pages. We introduce a server-side kernel modification which enables a web server to perform HTTP over a UDP socket while the kernel provides a regular TCP interface 'on the wire' to remote clients. We show that our "stateless" TCP modification can greatly reduce a server's CPU usage (>20%) and TCP related memory requirements(>90%), potentially enabling it to serve small web pages even under extreme overload conditions.
{"title":"Improving HTTP performance using \"stateless\" TCP","authors":"D. Hayes, M. Welzl, G. Armitage, Mattia Rossi","doi":"10.1145/1989240.1989256","DOIUrl":"https://doi.org/10.1145/1989240.1989256","url":null,"abstract":"TCP is quite a heavyweight protocol when serving very small web pages. We introduce a server-side kernel modification which enables a web server to perform HTTP over a UDP socket while the kernel provides a regular TCP interface 'on the wire' to remote clients. We show that our \"stateless\" TCP modification can greatly reduce a server's CPU usage (>20%) and TCP related memory requirements(>90%), potentially enabling it to serve small web pages even under extreme overload conditions.","PeriodicalId":254694,"journal":{"name":"Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video","volume":"348 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134074404","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：