Variable bit rate encoding is considered to outper- form constant bit rate encoding with regard to compression gain and constancy of the video quality. The drawback is, however, that variable bit rate video streams usually exhibit a significant degree of burstiness which may result in poor multiplexing properties, buffer overflows, and large network delays. In this work we show how the explicit selection of slice mode types can effectively be used to generally avoid the use of large intracoded frames while still providing robustness against packet losses in the network. The employed encoding scheme provides a considerable smoothing of variable bit rate video traffic, resulting in less delay, less delay jitter, and less loss due to buffer overflows and late arrivals. It preserves the efficiency of variable bit rate video encoding, has little overhead, and is in accordance with current video coding standards.
{"title":"Efficient Smoothing of Robust VBR Video Traffic by Explicit Slice-based Mode Type Selection","authors":"M. Fidler, Yuan Lin, P. Emstad, A. Perkis","doi":"10.1109/CCNC.2007.178","DOIUrl":"https://doi.org/10.1109/CCNC.2007.178","url":null,"abstract":"Variable bit rate encoding is considered to outper- form constant bit rate encoding with regard to compression gain and constancy of the video quality. The drawback is, however, that variable bit rate video streams usually exhibit a significant degree of burstiness which may result in poor multiplexing properties, buffer overflows, and large network delays. In this work we show how the explicit selection of slice mode types can effectively be used to generally avoid the use of large intracoded frames while still providing robustness against packet losses in the network. The employed encoding scheme provides a considerable smoothing of variable bit rate video traffic, resulting in less delay, less delay jitter, and less loss due to buffer overflows and late arrivals. It preserves the efficiency of variable bit rate video encoding, has little overhead, and is in accordance with current video coding standards.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116522678","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}
Shintaro Mizuno, Takahiro Haruyama, Kohji Yamada, O. Mizuno
We demonstrate a prototype of a mobile phone based authentication service that can easily be used by home appliance users. The system employs the mobile phone's strong user identification capabilities such as UIMs, device identifiers or digital certificates to authenticate users over the mobile phone network while services are delivered to their appliances via the Internet. The authentication method is targeted to be used on home appliances such as digital televisions with web browsers which do not have rich interfaces. Therefore it is designed not to require users to enter any user information or to install any hardware and/or software into the appliance. This is achieved by binding a service session on the Internet and mobile network session using a barcode scanner on a mobile phone terminal. The prototype also provides an alternative method for mobile phone terminals which does not have a barcode scanner function to complement user availability.
{"title":"A Mobile Phone Based Authentication Service for Home Appliances","authors":"Shintaro Mizuno, Takahiro Haruyama, Kohji Yamada, O. Mizuno","doi":"10.1109/CCNC.2007.236","DOIUrl":"https://doi.org/10.1109/CCNC.2007.236","url":null,"abstract":"We demonstrate a prototype of a mobile phone based authentication service that can easily be used by home appliance users. The system employs the mobile phone's strong user identification capabilities such as UIMs, device identifiers or digital certificates to authenticate users over the mobile phone network while services are delivered to their appliances via the Internet. The authentication method is targeted to be used on home appliances such as digital televisions with web browsers which do not have rich interfaces. Therefore it is designed not to require users to enter any user information or to install any hardware and/or software into the appliance. This is achieved by binding a service session on the Internet and mobile network session using a barcode scanner on a mobile phone terminal. The prototype also provides an alternative method for mobile phone terminals which does not have a barcode scanner function to complement user availability.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120964142","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 describes the design and implementation of a Media Server for Multimedia Home Network environments and particularly focuses on one of its components namely Content Management. A core design goal is the aggregation and presentation of content metadata regardless of location of the original source. The implementation of our user-centric approach proved to be an effective solution enabling a unified view of home and Internet content available to the user.
{"title":"Content Aware Media Server for Multimedia Home Network","authors":"G. Pekhteryev, F. Matsubara","doi":"10.1109/CCNC.2007.69","DOIUrl":"https://doi.org/10.1109/CCNC.2007.69","url":null,"abstract":"This paper describes the design and implementation of a Media Server for Multimedia Home Network environments and particularly focuses on one of its components namely Content Management. A core design goal is the aggregation and presentation of content metadata regardless of location of the original source. The implementation of our user-centric approach proved to be an effective solution enabling a unified view of home and Internet content available to the user.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132774833","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 simplified MIMO transmission scheme combined with symbol spreading, which can improve system performance without additional bandwidth or power resources under fast Rayleigh flat fading channels. The same scheme can also be viewed as a design of space-frequency codes for MIMO-OFDM systems with large frequency selectivity. The tensor product is used to generate rotation matrices for MIMO systems from well-designed ones that are known for single-antenna systems. Because of the lattice-based structure, sphere decoding can be employed to reduce the complexity of ML decoding while maintaining the near ML performance. Moreover, MMSE receivers can also be used due to the systematic structure at the transmitter. Simulation results have been provided to support good performance of the proposed scheme for uncoded system as well as coded system under IEEE 802.11n channel modeling.
{"title":"A Simplified Design for MIMO System with Symbol Spreading","authors":"Jun Yang, M. Ghosh","doi":"10.1109/CCNC.2007.93","DOIUrl":"https://doi.org/10.1109/CCNC.2007.93","url":null,"abstract":"In this paper, we propose a simplified MIMO transmission scheme combined with symbol spreading, which can improve system performance without additional bandwidth or power resources under fast Rayleigh flat fading channels. The same scheme can also be viewed as a design of space-frequency codes for MIMO-OFDM systems with large frequency selectivity. The tensor product is used to generate rotation matrices for MIMO systems from well-designed ones that are known for single-antenna systems. Because of the lattice-based structure, sphere decoding can be employed to reduce the complexity of ML decoding while maintaining the near ML performance. Moreover, MMSE receivers can also be used due to the systematic structure at the transmitter. Simulation results have been provided to support good performance of the proposed scheme for uncoded system as well as coded system under IEEE 802.11n channel modeling.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122218065","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 ontology-based video content annotation and recommendation tools. Our system is able to perform automatic shot detection and supports users during the annotation phase in a collaborative framework by providing suggestions on the basis of actual user needs as well as modifiable user behaviour and interests. Annotations are based on domain ontologies expressing hierarchical links between entities and guarantying interoperability of resources. Examples to verify the effectiveness of both the shot detection and the frame matching modules are analyzed.
{"title":"Ontology-Based Video Annotation in Multimedia Entertainment","authors":"A. Carbonaro, R. Ferrini","doi":"10.1109/CCNC.2007.219","DOIUrl":"https://doi.org/10.1109/CCNC.2007.219","url":null,"abstract":"In this paper we propose ontology-based video content annotation and recommendation tools. Our system is able to perform automatic shot detection and supports users during the annotation phase in a collaborative framework by providing suggestions on the basis of actual user needs as well as modifiable user behaviour and interests. Annotations are based on domain ontologies expressing hierarchical links between entities and guarantying interoperability of resources. Examples to verify the effectiveness of both the shot detection and the frame matching modules are analyzed.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130315170","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}
Contemporary multimedia consumer devices are increasingly obtaining network connectivity mostly through wireless means. In order to economically support the mobile lifestyle of users, a new class of multimodal consumer devices has emerged that are equipped with heterogeneous wireless access capability. Inter-working of heterogeneous packet switched wireless networks, e.g., cellular and WLANs, via IP is a key step to provide ubiquitous service delivery via seamless connectivity of consumer devices. These wireless networks have a diverse range of capabilities and therefore selection of a specific network to optimize service delivery is an issue. Various algorithms have been proposed for use in the decision making process, with the class of Multi Attribute Decision Making (MADM) methods being one of the most promising. MADM methods, however, are known to suffer from ranking abnormalities. This paper applies TOPSIS, a MADM algorithm, to the problem of network selection. The causes of ranking abnormalities in TOPSIS are analyzed. An improvement to the algorithm as applied to the problem of network selection, where only the top ranking alternatives are considered important for decision making, is proposed. The new approach iteratively applies TOPSIS to the problem, removing the bottom ranked candidate network after each iteration. Simulation results are presented to demonstrate the effectiveness of the proposed iterative TOPSIS approach.
{"title":"Multi-Attribute Network Selection by Iterative TOPSIS for Heterogeneous Wireless Access","authors":"F. Bari, V. Leung","doi":"10.1109/CCNC.2007.164","DOIUrl":"https://doi.org/10.1109/CCNC.2007.164","url":null,"abstract":"Contemporary multimedia consumer devices are increasingly obtaining network connectivity mostly through wireless means. In order to economically support the mobile lifestyle of users, a new class of multimodal consumer devices has emerged that are equipped with heterogeneous wireless access capability. Inter-working of heterogeneous packet switched wireless networks, e.g., cellular and WLANs, via IP is a key step to provide ubiquitous service delivery via seamless connectivity of consumer devices. These wireless networks have a diverse range of capabilities and therefore selection of a specific network to optimize service delivery is an issue. Various algorithms have been proposed for use in the decision making process, with the class of Multi Attribute Decision Making (MADM) methods being one of the most promising. MADM methods, however, are known to suffer from ranking abnormalities. This paper applies TOPSIS, a MADM algorithm, to the problem of network selection. The causes of ranking abnormalities in TOPSIS are analyzed. An improvement to the algorithm as applied to the problem of network selection, where only the top ranking alternatives are considered important for decision making, is proposed. The new approach iteratively applies TOPSIS to the problem, removing the bottom ranked candidate network after each iteration. Simulation results are presented to demonstrate the effectiveness of the proposed iterative TOPSIS approach.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116683249","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}
Wi-Fi mesh networks and WiMAX are two new emerging wireless access technologies for the delivery of broadband services to mobile users in the metropolitan area. To take advantage of the strengths of these two, we propose a novel architecture for next generation wireless metropolitan area networks. In this architecture, no wired backhaul connections for Wi-Fi mesh portals are needed, which considerably reduces the deployment cost and at the same time improves the system scalability. Due to the unique feature of wireless mesh networks which is a part of the architecture, previously proposed mobility management protocol can not work properly in this network environment. We propose a hierarchical mobility management scheme for mobile stations to maintain network connectivity while roaming within the Wi-Fi mesh networks. In this scheme, the dynamic forwarding chain is used to reduce the signalling traffic involved in the mobility management including registration and handoff procedures. The results of the performance evaluation justified the benefits of our proposed mechanism.
{"title":"A Dynamic Hierarchical Mobility Management Protocol for Next Generation Wireless Metropolitan Area Networks","authors":"Hairong Zhou, C. Yeh, H. Mouftah","doi":"10.1109/CCNC.2007.83","DOIUrl":"https://doi.org/10.1109/CCNC.2007.83","url":null,"abstract":"Wi-Fi mesh networks and WiMAX are two new emerging wireless access technologies for the delivery of broadband services to mobile users in the metropolitan area. To take advantage of the strengths of these two, we propose a novel architecture for next generation wireless metropolitan area networks. In this architecture, no wired backhaul connections for Wi-Fi mesh portals are needed, which considerably reduces the deployment cost and at the same time improves the system scalability. Due to the unique feature of wireless mesh networks which is a part of the architecture, previously proposed mobility management protocol can not work properly in this network environment. We propose a hierarchical mobility management scheme for mobile stations to maintain network connectivity while roaming within the Wi-Fi mesh networks. In this scheme, the dynamic forwarding chain is used to reduce the signalling traffic involved in the mobility management including registration and handoff procedures. The results of the performance evaluation justified the benefits of our proposed mechanism.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116929308","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}
A method is provided for parallelizing overlay operations in an overlay network. The method includes: identifying an overlay operation having a parallel messaging scheme; determining a destination address for each parallel message in the messaging scheme; encoding each destination address into a data packet; and transmitting the data packet over the overlay network using a multi-destination, multicast routing protocol.
{"title":"Parallelizing Peer-to-Peer Overlays with Multi-Destination Routing","authors":"J. Buford, A. Brown, M. Kolberg","doi":"10.1109/CCNC.2007.112","DOIUrl":"https://doi.org/10.1109/CCNC.2007.112","url":null,"abstract":"A method is provided for parallelizing overlay operations in an overlay network. The method includes: identifying an overlay operation having a parallel messaging scheme; determining a destination address for each parallel message in the messaging scheme; encoding each destination address into a data packet; and transmitting the data packet over the overlay network using a multi-destination, multicast routing protocol.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130998094","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}
Motivated by the low utilization of the licensed spectrum across many frequency bands, sensing-based oppor- tunistic spectrum access has recently emerged as an alternative to the outdated exclusive spectrum access policy. Under this new paradigm, a secondary (unlicensed) user monitors a primary (licensed) frequency band for a given time and opportunistically transmits if it does not detect any ongoing licensed operations. Evidently, selection of the sensing parameters involves balanc- ing a tradeoff between the speed and the quality with which the secondary user senses the licensed band. With the average throughput as the performance criterion, we obtain the sensing parameters so as to optimize the performance of the secondary user while providing the primary user with its desired level of interference protection. I. INTRODUCTION As evidenced by recent measurements, many frequency bands across the licensed spectrum are significantly under- utilized (1), (2). This finding suggests that the spectrum scarcity, as perceived today, is largely due to the inefficient fixed frequency allocations rather than the physical shortage of the spectrum and has led the regulatory bodies to consider the opportunistic access to the temporally/spatially unused licensed bands (a.k.a. the white spaces) as a means to improve the efficiency of spectrum usage. In the absence of cooperation or signalling between the primary licensee and the secondary users, spectrum availability for the opportunistic access may be determined by direct spectrum sensing where the secondary user monitors a licensed band for a given "sensing time" and opportunistically transmits if it does not detect any ongoing licensed operations. This approach is particularly appealing due to its low deployment cost and its compatibility with legacy primary users and is being considered for inclusion in the upcoming IEEE 802.22 standard for opportunistic access to the TV spectrum (3). Due to their ability to autonomously detect and to react to the changes in the spectrum usage, secondary users equipped with the spectrum sensing capability may be considered as a primitive form of the cognitive radio (4). Design of any sensing scheme involves balancing a tradeoff between the quality and the speed of sensing through an appropriate selection of the sensing time. As we shall illustrate, in the context of spectrum sensing, sensing time may be fine- tuned to enhance the secondary users' perceived quality-of- service (QoS) as long as the regulatory constraint for the protection of the primary users against harmful interference is satisfied. In particular, we will obtain the optimum sensing times at different stages of the spectrum sensing to maximize the average throughput of the secondary user. In this paper, simple energy detection (a.k.a. radiometry) (5) is chosen as the underlying detection scheme. In general, when some information about the structure of the primary signal is available, ad hoc feature-detector
{"title":"Optimization of Spectrum Sensing for Opportunistic Spectrum Access in Cognitive Radio Networks","authors":"A. Ghasemi, E. Sousa","doi":"10.1109/CCNC.2007.206","DOIUrl":"https://doi.org/10.1109/CCNC.2007.206","url":null,"abstract":"Motivated by the low utilization of the licensed spectrum across many frequency bands, sensing-based oppor- tunistic spectrum access has recently emerged as an alternative to the outdated exclusive spectrum access policy. Under this new paradigm, a secondary (unlicensed) user monitors a primary (licensed) frequency band for a given time and opportunistically transmits if it does not detect any ongoing licensed operations. Evidently, selection of the sensing parameters involves balanc- ing a tradeoff between the speed and the quality with which the secondary user senses the licensed band. With the average throughput as the performance criterion, we obtain the sensing parameters so as to optimize the performance of the secondary user while providing the primary user with its desired level of interference protection. I. INTRODUCTION As evidenced by recent measurements, many frequency bands across the licensed spectrum are significantly under- utilized (1), (2). This finding suggests that the spectrum scarcity, as perceived today, is largely due to the inefficient fixed frequency allocations rather than the physical shortage of the spectrum and has led the regulatory bodies to consider the opportunistic access to the temporally/spatially unused licensed bands (a.k.a. the white spaces) as a means to improve the efficiency of spectrum usage. In the absence of cooperation or signalling between the primary licensee and the secondary users, spectrum availability for the opportunistic access may be determined by direct spectrum sensing where the secondary user monitors a licensed band for a given \"sensing time\" and opportunistically transmits if it does not detect any ongoing licensed operations. This approach is particularly appealing due to its low deployment cost and its compatibility with legacy primary users and is being considered for inclusion in the upcoming IEEE 802.22 standard for opportunistic access to the TV spectrum (3). Due to their ability to autonomously detect and to react to the changes in the spectrum usage, secondary users equipped with the spectrum sensing capability may be considered as a primitive form of the cognitive radio (4). Design of any sensing scheme involves balancing a tradeoff between the quality and the speed of sensing through an appropriate selection of the sensing time. As we shall illustrate, in the context of spectrum sensing, sensing time may be fine- tuned to enhance the secondary users' perceived quality-of- service (QoS) as long as the regulatory constraint for the protection of the primary users against harmful interference is satisfied. In particular, we will obtain the optimum sensing times at different stages of the spectrum sensing to maximize the average throughput of the secondary user. In this paper, simple energy detection (a.k.a. radiometry) (5) is chosen as the underlying detection scheme. In general, when some information about the structure of the primary signal is available, ad hoc feature-detector","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"112 37","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131914409","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}
Recently, peer-to-peer (P2P) overlay networks have become popular and many P2P applications such as file sharing and content distribution have been introduced. Naturally, P2P cooperative caching schemes for streaming were introduced. However, these approaches manifest inefficiency of cache utilization due to inappropriate cache replacement algorithms, and no consideration of dynamic membership changes of peer nodes. In this paper, we investigate an efficient cooperative caching mechanism for VOD streaming service over P2P overlay networks. The target of the system is to provide low-latency and high-quality services by virtue of pees' collaboration. The storage and replacement of caching content are based on segment-based strategy. And a utility-based fine-grained cooperative cache (DUFC) policy was proposed for cache replacement. We demonstrate the effectiveness of the proposed scheme and compare with traditional LRUF scheme through extensive simulation experiments over large, Internet-like topologies.
{"title":"An Efficient Caching Scheme for On-Demand Streaming Service on Overlay Networks","authors":"Hui Guo, K. Lo, Jiang Li","doi":"10.1109/CCNC.2007.70","DOIUrl":"https://doi.org/10.1109/CCNC.2007.70","url":null,"abstract":"Recently, peer-to-peer (P2P) overlay networks have become popular and many P2P applications such as file sharing and content distribution have been introduced. Naturally, P2P cooperative caching schemes for streaming were introduced. However, these approaches manifest inefficiency of cache utilization due to inappropriate cache replacement algorithms, and no consideration of dynamic membership changes of peer nodes. In this paper, we investigate an efficient cooperative caching mechanism for VOD streaming service over P2P overlay networks. The target of the system is to provide low-latency and high-quality services by virtue of pees' collaboration. The storage and replacement of caching content are based on segment-based strategy. And a utility-based fine-grained cooperative cache (DUFC) policy was proposed for cache replacement. We demonstrate the effectiveness of the proposed scheme and compare with traditional LRUF scheme through extensive simulation experiments over large, Internet-like topologies.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133513887","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
扫码关注我们
求助内容：
应助结果提醒方式：