Maxmin is a flow control mechanism based on fairness criteria. In this paper we consider the problem of routing and maxmin rate allocation over a communication network. We present two contributions in this paper. The first contribution is to provide a new relative maxmin definition and to extend the concepts of advertised rate from single-path to multi-path networks. The second contribution is to propose a novel multi- path maxmin routing scheme based on new advertised rate algorithm. We prove that this new scheme will converge to relative maxmin solution.
{"title":"Using Advertised Rate for Multi-Path Relative Maxmin Routing","authors":"D. Tsai, W. Tsai, Pohao Huang","doi":"10.1109/CCNC.2007.100","DOIUrl":"https://doi.org/10.1109/CCNC.2007.100","url":null,"abstract":"Maxmin is a flow control mechanism based on fairness criteria. In this paper we consider the problem of routing and maxmin rate allocation over a communication network. We present two contributions in this paper. The first contribution is to provide a new relative maxmin definition and to extend the concepts of advertised rate from single-path to multi-path networks. The second contribution is to propose a novel multi- path maxmin routing scheme based on new advertised rate algorithm. We prove that this new scheme will converge to relative maxmin solution.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"85 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":"116700386","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}
Nowadays, the growing demand on the implantation of onboard services for road vehicles encourages its development as a part of the current and future vehicles. In this sense, the implementation of new facilities cannot lead to an increase of hardware devices in the driver compartment, because space limitations and the need of an easy non-distracting interface with the user must be considered. For these reasons, it is advisable to have a service architecture suitable for further developments, considering the requirements of extensibility. New services should be created using modules shareable with the rest of applications in the vehicle. For this purpose, this work shows an extensible architecture useful in the software development of road services for vehicles. The solution presented is based on the division of services in different levels of abstraction, according to the underlying hardware. This structure is placed over a general purpose computer. A wide range of sensors has been installed in our test vehicle, allowing the implementation of several context aware services, and proving the feasibility of the proposed solution. A set of examples of location based services (LBS), multimedia services, and advanced driver assistance systems (ADAS) has been developed as described in this paper. Index Terms—Embedded Platforms, Service Composition, OS- Gi, Location-based Services.
{"title":"A Multiplatform OSGi Based Architecture for Developing Road Vehicle Services","authors":"J. Santa, Benito Úbeda Miñaro, A. Gómez-Skarmeta","doi":"10.1109/CCNC.2007.144","DOIUrl":"https://doi.org/10.1109/CCNC.2007.144","url":null,"abstract":"Nowadays, the growing demand on the implantation of onboard services for road vehicles encourages its development as a part of the current and future vehicles. In this sense, the implementation of new facilities cannot lead to an increase of hardware devices in the driver compartment, because space limitations and the need of an easy non-distracting interface with the user must be considered. For these reasons, it is advisable to have a service architecture suitable for further developments, considering the requirements of extensibility. New services should be created using modules shareable with the rest of applications in the vehicle. For this purpose, this work shows an extensible architecture useful in the software development of road services for vehicles. The solution presented is based on the division of services in different levels of abstraction, according to the underlying hardware. This structure is placed over a general purpose computer. A wide range of sensors has been installed in our test vehicle, allowing the implementation of several context aware services, and proving the feasibility of the proposed solution. A set of examples of location based services (LBS), multimedia services, and advanced driver assistance systems (ADAS) has been developed as described in this paper. Index Terms—Embedded Platforms, Service Composition, OS- Gi, Location-based Services.","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":"122461020","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}
Intra prediction is an effective tool for coding still images and intra pictures in video. The H.264/AVC video compression standard uses extrapolation of the reconstructed pixels surrounding the target block to be coded to form the sample predictor block. Our previous paper augmented this conventional intra prediction method with sample predictor blocks generated using pixel based texture synthesis by template matching methods. This paper describes further improvements and refinements of the sample predictor block creation method. Multiple candidate sample predictor blocks were created using template matching. A weighted average of the multiple candidates then formed the final sample predictor block. Improvements in coding efficiency by more than 15% in bitrates were achieved by this refined method compared to the conventional intra prediction. The impact of the search window and the different template shapes used in the template matching method was also studied and presented.
{"title":"Intra Prediction by Averaged Template Matching Predictors","authors":"T. K. Tan, C. Boon, Yoshinori Suzuki","doi":"10.1109/CCNC.2007.86","DOIUrl":"https://doi.org/10.1109/CCNC.2007.86","url":null,"abstract":"Intra prediction is an effective tool for coding still images and intra pictures in video. The H.264/AVC video compression standard uses extrapolation of the reconstructed pixels surrounding the target block to be coded to form the sample predictor block. Our previous paper augmented this conventional intra prediction method with sample predictor blocks generated using pixel based texture synthesis by template matching methods. This paper describes further improvements and refinements of the sample predictor block creation method. Multiple candidate sample predictor blocks were created using template matching. A weighted average of the multiple candidates then formed the final sample predictor block. Improvements in coding efficiency by more than 15% in bitrates were achieved by this refined method compared to the conventional intra prediction. The impact of the search window and the different template shapes used in the template matching method was also studied and presented.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"1 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":"131453926","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}
Ambient networks is a new networking concept for beyond 3G. An ambient network is defined as one or more network nodes or devices that share a common network control plane. Network composition is a core concept of ambient networks. It requires the composition of the different registries hosted by the composing ambient networks. These registries may be heterogeneous. Entities in a given network may also need to access information hosted by a registry in another network. This makes the problem of information discovery and publication after composition very challenging. This paper proposes a solution based on an overlay architecture. We introduce the functional entities of the overlay architecture; present the procedures and messages related to the publication and discovery of information and describe the implementation of a proof-of-concept prototype based on JXTA, a middleware commonly used in peer-to-peer settings.
{"title":"An Overlay Architecture for Information Publication and Discovery After the Composition of Registries in Ambient Networks","authors":"F. Belqasmi, R. Glitho, R. Dssouli","doi":"10.1109/CCNC.2007.28","DOIUrl":"https://doi.org/10.1109/CCNC.2007.28","url":null,"abstract":"Ambient networks is a new networking concept for beyond 3G. An ambient network is defined as one or more network nodes or devices that share a common network control plane. Network composition is a core concept of ambient networks. It requires the composition of the different registries hosted by the composing ambient networks. These registries may be heterogeneous. Entities in a given network may also need to access information hosted by a registry in another network. This makes the problem of information discovery and publication after composition very challenging. This paper proposes a solution based on an overlay architecture. We introduce the functional entities of the overlay architecture; present the procedures and messages related to the publication and discovery of information and describe the implementation of a proof-of-concept prototype based on JXTA, a middleware commonly used in peer-to-peer settings.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"75 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":"121793260","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 area of cryptography called broad- cast encryption has been used very successfully in content protection systems, especially protecting physical media. Today, however, a basic symmetric- key broadcast encryption system would depend on message authentication codes, not digital signatures, to "sign" data items. Message authentication codes are very efficient, but have other significant limi- tations. As commercial content protection systems based on broadcast encryption have continued to be introduced, each with more complexity than the previous one, the limitations have become apparent. The systems' designers have had to consider adding a public-key infrastructure on top of their broadcast encryption mechanism, with redundent credentials and revocation, just to add a digital signature feature. This paper presents a new broadcast-encryption- based attestation scheme that mimicks a digital sig- nature scheme, without the computational overhead inherent in public-key calculations. Although the scheme has limitations compared to public-key sig- natures, they do not reduce its effectiveness, because they are the same limitations that are present in any broadcast encryption system.
{"title":"A Signature-Like Primitive for Broadcast-Encryption-Based Systems","authors":"J. Lotspiech","doi":"10.1109/CCNC.2007.210","DOIUrl":"https://doi.org/10.1109/CCNC.2007.210","url":null,"abstract":"The area of cryptography called broad- cast encryption has been used very successfully in content protection systems, especially protecting physical media. Today, however, a basic symmetric- key broadcast encryption system would depend on message authentication codes, not digital signatures, to \"sign\" data items. Message authentication codes are very efficient, but have other significant limi- tations. As commercial content protection systems based on broadcast encryption have continued to be introduced, each with more complexity than the previous one, the limitations have become apparent. The systems' designers have had to consider adding a public-key infrastructure on top of their broadcast encryption mechanism, with redundent credentials and revocation, just to add a digital signature feature. This paper presents a new broadcast-encryption- based attestation scheme that mimicks a digital sig- nature scheme, without the computational overhead inherent in public-key calculations. Although the scheme has limitations compared to public-key sig- natures, they do not reduce its effectiveness, because they are the same limitations that are present in any broadcast encryption system.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"119 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":"133276499","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}
Y. P. Fallah, Darrell Koskinen, Avideh Shahabi, Faizal Karim, P. Nasiopoulos
Supporting video applications over 802.11 wireless local area networks is a challenging task due to the constant fluctuations in channel error rates and the inefficiency of the MAC layer. New video compression technologies, such as H.264, provide a network adaptation layer for adapting the output of the video encoder to the characteristics of the underlying transport network. In this article we demonstrate that it is possible to improve the performance of H.264 video applications over 802.11 WLANs through a cross-layer design that optimizes the encoded H.264 packet sizes. We propose the use of aggregation and fragmentation mechanisms to create the optimal frame lengths. We also investigate several application layer error
{"title":"A Cross Layer Optimization Mechanism to Improve H.264 Video Transmission over WLANs","authors":"Y. P. Fallah, Darrell Koskinen, Avideh Shahabi, Faizal Karim, P. Nasiopoulos","doi":"10.1109/CCNC.2007.177","DOIUrl":"https://doi.org/10.1109/CCNC.2007.177","url":null,"abstract":"Supporting video applications over 802.11 wireless local area networks is a challenging task due to the constant fluctuations in channel error rates and the inefficiency of the MAC layer. New video compression technologies, such as H.264, provide a network adaptation layer for adapting the output of the video encoder to the characteristics of the underlying transport network. In this article we demonstrate that it is possible to improve the performance of H.264 video applications over 802.11 WLANs through a cross-layer design that optimizes the encoded H.264 packet sizes. We propose the use of aggregation and fragmentation mechanisms to create the optimal frame lengths. We also investigate several application layer error","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"74 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":"133451951","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 proposes a content-sharing mechanism, which is both secure and usable for wireless guest devices. It is very difficult for average users to allow a guest device to share its content with the users’ devices supporting the principle of least privilege in the current Wi-Fi infrastructure home network environment. As a result, most people do not configure the security feature of their devices. The proposed mechanism frees users from security and tedious operations, thus enabling secure content sharing by a simple and intuitive user interaction via just one touch. Our evaluation shows that the proposed mechanism is secure and usable. Keywords-
{"title":"Content-Sharing for Dummies: A Secure and Usable Mechanism in Wi-Fi Infrastructure Home Networks","authors":"Sung-Min Lee, Se-Hee Han, K. Shin","doi":"10.1109/CCNC.2007.61","DOIUrl":"https://doi.org/10.1109/CCNC.2007.61","url":null,"abstract":"This paper proposes a content-sharing mechanism, which is both secure and usable for wireless guest devices. It is very difficult for average users to allow a guest device to share its content with the users’ devices supporting the principle of least privilege in the current Wi-Fi infrastructure home network environment. As a result, most people do not configure the security feature of their devices. The proposed mechanism frees users from security and tedious operations, thus enabling secure content sharing by a simple and intuitive user interaction via just one touch. Our evaluation shows that the proposed mechanism is secure and usable. Keywords-","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"44 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":"134204139","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}
We present two on-demand MAC protocols to provide differentiated service classes over multiple beam antennas. We use embedded feedback from neighboring nodes to synchronize data communication at multiple beams. The protocols use multilevel queues to organize data, and employ a quality of service (QoS) aware packet scheduler to facilitate disparate traffic flows. We further present a novel paradigm in wireless channel access - receiver initiated choice of sender (RICS). RICS organizes the senders into multilevel queues providing an elegant method to bias the probability of channel award to these nodes. Simulation results demonstrate successful provision for multiple service classes.
{"title":"Differentiated Service Classes over Multiple Beam Antennas","authors":"Anurag Gupta, V. Jain, D. Agrawal","doi":"10.1109/CCNC.2007.39","DOIUrl":"https://doi.org/10.1109/CCNC.2007.39","url":null,"abstract":"We present two on-demand MAC protocols to provide differentiated service classes over multiple beam antennas. We use embedded feedback from neighboring nodes to synchronize data communication at multiple beams. The protocols use multilevel queues to organize data, and employ a quality of service (QoS) aware packet scheduler to facilitate disparate traffic flows. We further present a novel paradigm in wireless channel access - receiver initiated choice of sender (RICS). RICS organizes the senders into multilevel queues providing an elegant method to bias the probability of channel award to these nodes. Simulation results demonstrate successful provision for multiple service classes.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"33 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":"125030820","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
扫码关注我们
求助内容：
应助结果提醒方式：