We demonstrate the prototype of the network camera with a multicast transport-layer protocol called Sender Initiated Congestion Control (SICC) which provides adaptive flow control for multicast methods such as Application Layer Multicast (ALM) or eXplicit multi-unicast6 (XCAST6). SICC is capable of achieving fast congestion avoidance and significantly increases throughput at receivers while still remaining TCP friendly. We verified the applicability to small appliance by implementing SICC/XCAST6 on a prototype network camera We demonstrate the prototype of network camera and receiver terminals with viewer. It shows the capability of adaptive flow control to multiple receivers with or without competing traffics.
{"title":"Demonstration of the Prototype of the Network Camera with Sender Initiated Congestion Control","authors":"Eiichi Muramoto, T. Yoneda, Kazunobu Konishi","doi":"10.1109/CCNC.2007.245","DOIUrl":"https://doi.org/10.1109/CCNC.2007.245","url":null,"abstract":"We demonstrate the prototype of the network camera with a multicast transport-layer protocol called Sender Initiated Congestion Control (SICC) which provides adaptive flow control for multicast methods such as Application Layer Multicast (ALM) or eXplicit multi-unicast6 (XCAST6). SICC is capable of achieving fast congestion avoidance and significantly increases throughput at receivers while still remaining TCP friendly. We verified the applicability to small appliance by implementing SICC/XCAST6 on a prototype network camera We demonstrate the prototype of network camera and receiver terminals with viewer. It shows the capability of adaptive flow control to multiple receivers with or without competing traffics.","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":"130340651","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 provides a brief overview of standardization activities in the IEEE and the International Telecommunications Union in the areas of advanced radio systems (including cognitive radio systems) and advanced concepts in spectrum management such as dynamic spectrum access.
{"title":"IEEE 1900 and ITU-R Standardization Activities in Advanced Radio Systems and Spectrum Management","authors":"J. Hoffmeyer","doi":"10.1109/CCNC.2007.233","DOIUrl":"https://doi.org/10.1109/CCNC.2007.233","url":null,"abstract":"This paper provides a brief overview of standardization activities in the IEEE and the International Telecommunications Union in the areas of advanced radio systems (including cognitive radio systems) and advanced concepts in spectrum management such as dynamic spectrum access.","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":"129496900","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}
Yukimasa Nagai, A. Fujimura, Yoshihiko Shirokura, F. Ishizu, H. Nakase, S. Kameda, H. Oguma, K. Tsubouchi
We developed a high speed wireless LAN prototype in the 5GHz band. Maximum transmission rate of the developed WLAN equipment was 324Mbit/sec using 6 multi-channels of 802.11a (1). We implemented a frame aggregation scheme to improve MAC efficiency (2-3). The evaluated system throughput was achieved more than 170Mbit/sec using the implemented frame aggregation. The HDTV transmission using 324Mbit/sec WLAN equipment was demonstrated. We compared the developed prototype and the conventional 802.11g (4).
{"title":"Demonstration of HDTV Transmission Using 324Mbps WLAN Equipment","authors":"Yukimasa Nagai, A. Fujimura, Yoshihiko Shirokura, F. Ishizu, H. Nakase, S. Kameda, H. Oguma, K. Tsubouchi","doi":"10.1109/CCNC.2007.244","DOIUrl":"https://doi.org/10.1109/CCNC.2007.244","url":null,"abstract":"We developed a high speed wireless LAN prototype in the 5GHz band. Maximum transmission rate of the developed WLAN equipment was 324Mbit/sec using 6 multi-channels of 802.11a (1). We implemented a frame aggregation scheme to improve MAC efficiency (2-3). The evaluated system throughput was achieved more than 170Mbit/sec using the implemented frame aggregation. The HDTV transmission using 324Mbit/sec WLAN equipment was demonstrated. We compared the developed prototype and the conventional 802.11g (4).","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":"130666051","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, based on a cross-layer design prin- ciple, we propose an interference aware distributed medium access control (MAC) scheme for a code-division multiple access (CDMA)-based wireless mesh backbone. Specifically, benefiting from the fixed location of wireless routers, the power allocation is based on the length of the transmission path, so as to ensure some level of fairness in resource allocation among the routers. For call admission and slot/rate allocation, based on the maximum sustainable interference concept, we propose to estimate the interference from the viewpoint of the receiver (rather than the transmitter). Each receiver estimates its experienced interference level for the hypothesis that one or more new calls are admitted. If the interference is not tolerable, the receiver rejects the new call(s). The main advantages of our proposed scheme are the low control message overhead for easy implementation, and the accurate interference estimation. Simulation results are presented to evaluate the performance of our scheme. router. In such a backbone, fine-granularity QoS provisioning is desired or required. Carrier sense multiple access (CSMA)- based random access schemes, the major stream for traditional ad hoc networks, may not be a choice, due to their limited QoS provisioning capability. Thus reservation-based MAC schemes should be more suitable for the wireless mesh backbone. When resources are reserved for each active flow, fine-granularity QoS can be achieved. This paper presents an effective distributed MAC scheme for the wireless mesh backbone, taking into account the unique networking characteristics. Specifically, we consider a wireless mesh backbone based on code-division multiple access (CDMA) technology, and propose a MAC scheme based on the cross-layer design principle. The merits of our proposed scheme are four-fold: 1) it is fully distributed; 2) each link does not need to have the dynamic information of other links in terms of transmission power, tolerable interference, etc., thus requiring a low information exchange overhead and increasing the robustness and scalability of the MAC scheme; 3) accurate interference estimation can be achieved for each receiver; and 4) fine-granularity QoS can be achieved by burst- based resource reservation. If a traffic burst is admitted into the network, it can use the reserved resources until the completion of the burst.
{"title":"An Interference Aware Distributed MAC Scheme for CDMA-Based Wireless Mesh Backbone","authors":"X. Shen, Hai Jiang, Ping Wang, W. Zhuang","doi":"10.1109/CCNC.2007.19","DOIUrl":"https://doi.org/10.1109/CCNC.2007.19","url":null,"abstract":"In this paper, based on a cross-layer design prin- ciple, we propose an interference aware distributed medium access control (MAC) scheme for a code-division multiple access (CDMA)-based wireless mesh backbone. Specifically, benefiting from the fixed location of wireless routers, the power allocation is based on the length of the transmission path, so as to ensure some level of fairness in resource allocation among the routers. For call admission and slot/rate allocation, based on the maximum sustainable interference concept, we propose to estimate the interference from the viewpoint of the receiver (rather than the transmitter). Each receiver estimates its experienced interference level for the hypothesis that one or more new calls are admitted. If the interference is not tolerable, the receiver rejects the new call(s). The main advantages of our proposed scheme are the low control message overhead for easy implementation, and the accurate interference estimation. Simulation results are presented to evaluate the performance of our scheme. router. In such a backbone, fine-granularity QoS provisioning is desired or required. Carrier sense multiple access (CSMA)- based random access schemes, the major stream for traditional ad hoc networks, may not be a choice, due to their limited QoS provisioning capability. Thus reservation-based MAC schemes should be more suitable for the wireless mesh backbone. When resources are reserved for each active flow, fine-granularity QoS can be achieved. This paper presents an effective distributed MAC scheme for the wireless mesh backbone, taking into account the unique networking characteristics. Specifically, we consider a wireless mesh backbone based on code-division multiple access (CDMA) technology, and propose a MAC scheme based on the cross-layer design principle. The merits of our proposed scheme are four-fold: 1) it is fully distributed; 2) each link does not need to have the dynamic information of other links in terms of transmission power, tolerable interference, etc., thus requiring a low information exchange overhead and increasing the robustness and scalability of the MAC scheme; 3) accurate interference estimation can be achieved for each receiver; and 4) fine-granularity QoS can be achieved by burst- based resource reservation. If a traffic burst is admitted into the network, it can use the reserved resources until the completion of the burst.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"764 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":"133215709","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 introduce a hybrid scalable approach for data-gathering and dissemination in sensor networks. The approach maintains the desirable on-demand communication feature of the pull technique by synchronizing its underling push and pull components. At the same time, scalability is achieved by allowing sinks to cooperatively embed virtual network sectorizing. The mechanism has two phases. First, virtual boards are constructed to form virtual closed sectors where queries are announced. Second, nodes located outside these boards initiate local bridges to carry their active events to the first board they encounter. Bridges are only created when boards are constructed. We validate our proposed solution with a simple analytical model and extensive software simulation. The initial investigation shows that our integrated protocol promises an efficient and scalable paradigm for data-gathering and dissemination in sensor networks that reduces the communication cost and leads to load balancing.
{"title":"Hybrid Data Dissemination Approach for Sensor Network with Multiple Cooperative Sinks","authors":"S. Hashish, A. Karmouch","doi":"10.1109/CCNC.2007.170","DOIUrl":"https://doi.org/10.1109/CCNC.2007.170","url":null,"abstract":"In this paper, we introduce a hybrid scalable approach for data-gathering and dissemination in sensor networks. The approach maintains the desirable on-demand communication feature of the pull technique by synchronizing its underling push and pull components. At the same time, scalability is achieved by allowing sinks to cooperatively embed virtual network sectorizing. The mechanism has two phases. First, virtual boards are constructed to form virtual closed sectors where queries are announced. Second, nodes located outside these boards initiate local bridges to carry their active events to the first board they encounter. Bridges are only created when boards are constructed. We validate our proposed solution with a simple analytical model and extensive software simulation. The initial investigation shows that our integrated protocol promises an efficient and scalable paradigm for data-gathering and dissemination in sensor networks that reduces the communication cost and leads to load balancing.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"36 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":"132216821","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 would like to propose a demonstration presentation about the technology of “Secure Fast Mobility Manager for Ubiquitous Wireless Home Networks”. Recently, the IEEE 802.11-based Wi-Fi networks have increasingly been being deployed throughout the world for the construction of wireless home networks. However, most Wi-Fi-based home networks do not allow home residents to freely roam around the town houses or apartments while talking with their friends with mobile devices such as PDA or Wi-Fi phones. This is because the existing Wi-Fi mobility management technology does not provide a fast handover function for real-time multimedia service such as VoIP and interactive IPTV. For home network environment, the building and room structures of the house often block the penetration of electronic waves so that a user may experience significant handover delay while roaming around the house, either inside or outside. In the demo, we will show a new technology of providing fast secure mobility management for indoor and/or outdoor Wi-Fi based home networks. The basic idea is to make use of the ubiquitous contextual information such as building structure, AP (Access Point) locations, user locations, access time, etc, in addition to the RSSI values, for the efficient secure fast mobility management. Figure 1 shows the logical configuration and procedures for providing seamless fast handover within a Wi-Fi hot zone. In Figure 1, a user can move around within a zone with both guaranteed handover delay and security. Here, the zone is defined as a collection of access points in which a user is guaranteed to receive a certain QoS and security service level. The zone is an expanded concept of ESS where QoS and security requirements are appended. When a mobile station enters into a new zone, it first accesses the mobility manager, called OMS (Open Mobility Server), through the access point to get its mobility and security information. The mobility and security information for a specific user is dynamically maintained by OMS using the surrounding contextual information as mentioned above, when he/she enters into or leaves the zone.
{"title":"Secure Fast Mobility Manager for Ubiquitous Wireless Home Networks","authors":"Jong T. Park, J. Nah, Y. H. Cho","doi":"10.1109/CCNC.2007.248","DOIUrl":"https://doi.org/10.1109/CCNC.2007.248","url":null,"abstract":"We would like to propose a demonstration presentation about the technology of “Secure Fast Mobility Manager for Ubiquitous Wireless Home Networks”. Recently, the IEEE 802.11-based Wi-Fi networks have increasingly been being deployed throughout the world for the construction of wireless home networks. However, most Wi-Fi-based home networks do not allow home residents to freely roam around the town houses or apartments while talking with their friends with mobile devices such as PDA or Wi-Fi phones. This is because the existing Wi-Fi mobility management technology does not provide a fast handover function for real-time multimedia service such as VoIP and interactive IPTV. For home network environment, the building and room structures of the house often block the penetration of electronic waves so that a user may experience significant handover delay while roaming around the house, either inside or outside. In the demo, we will show a new technology of providing fast secure mobility management for indoor and/or outdoor Wi-Fi based home networks. The basic idea is to make use of the ubiquitous contextual information such as building structure, AP (Access Point) locations, user locations, access time, etc, in addition to the RSSI values, for the efficient secure fast mobility management. Figure 1 shows the logical configuration and procedures for providing seamless fast handover within a Wi-Fi hot zone. In Figure 1, a user can move around within a zone with both guaranteed handover delay and security. Here, the zone is defined as a collection of access points in which a user is guaranteed to receive a certain QoS and security service level. The zone is an expanded concept of ESS where QoS and security requirements are appended. When a mobile station enters into a new zone, it first accesses the mobility manager, called OMS (Open Mobility Server), through the access point to get its mobility and security information. The mobility and security information for a specific user is dynamically maintained by OMS using the surrounding contextual information as mentioned above, when he/she enters into or leaves the zone.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"32 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":"133554335","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}
While application-layer multicast (ALM) can re- duce latency and permit deployment in networks without network-layer multicast, often, it does not leverage application- specific behavior. For example, the existing ALM-based peer-to- peer (P2P) conferencing systems route media packets based only on bandwidth and on transmission delay without considering P2P conferencing specific behavior and varying mixing capabilities of participating peers. We propose an enhanced hybrid ALM-based P2P conferencing architecture that can leverage participating peers with different capabilities. We also present a three-step algorithm to construct such a hybrid ALM-based P2P conference. We have built a prototype for our architecture. Results from our prototype show that our approach is more scalable than the existing ALM-based P2P conferencing systems.
{"title":"Enhancing Application-Layer Multicast for P2P Conferencing","authors":"Xiaotao Wu, K. Dhara, V. Krishnaswamy","doi":"10.1109/CCNC.2007.199","DOIUrl":"https://doi.org/10.1109/CCNC.2007.199","url":null,"abstract":"While application-layer multicast (ALM) can re- duce latency and permit deployment in networks without network-layer multicast, often, it does not leverage application- specific behavior. For example, the existing ALM-based peer-to- peer (P2P) conferencing systems route media packets based only on bandwidth and on transmission delay without considering P2P conferencing specific behavior and varying mixing capabilities of participating peers. We propose an enhanced hybrid ALM-based P2P conferencing architecture that can leverage participating peers with different capabilities. We also present a three-step algorithm to construct such a hybrid ALM-based P2P conference. We have built a prototype for our architecture. Results from our prototype show that our approach is more scalable than the existing ALM-based P2P conferencing systems.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"251 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":"132563424","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 standardization of networking home appliances fosters home automation joining the mass market. Controlling the appliances requires several either specialized or generic controls. This paper is interested in the dynamic trading and deployment of software components implementing UPnP control points. It also addresses the bridge between UPnP and the world of micro-appliances. An OSGi-based prototype validates our proposition. (Abstract)
{"title":"On-Demand Component Deployment in the UPnP Device Architecture","authors":"D. Donsez","doi":"10.1109/CCNC.2007.186","DOIUrl":"https://doi.org/10.1109/CCNC.2007.186","url":null,"abstract":"The standardization of networking home appliances fosters home automation joining the mass market. Controlling the appliances requires several either specialized or generic controls. This paper is interested in the dynamic trading and deployment of software components implementing UPnP control points. It also addresses the bridge between UPnP and the world of micro-appliances. An OSGi-based prototype validates our proposition. (Abstract)","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"31 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":"133238841","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}
T. Rasheed, U. Javaid, Djamal-Eddine Meddour, L. Reynaud, K. A. Agha
The rapid proliferation of mobile devices has influenced the potential growth of wireless networking applications. This has lead to an augmentation in wireless ad hoc networking scenarios, particularly interesting for network operators. In this work, we present an adaptive framework for weight metric estimation and dissemination to construct stable and reliable weight-based clusters which can provide faster convergence rates and performance results for dynamic routing in mobile ad hoc networks. The framework considers critical node properties in determining a node's suitability for becoming clusterheads. It employs adaptive cluster radius and dynamic network constraints as the weight dissemination criterion. We observe that the proposed algorithm is suitable for scalable ad hoc networks and provides stable cluster formation decisions based on weighted metric approaches. Extensive performance evaluations confirm the suitability of the protocol for adaptive stable cluster formation and control overhead reduction in mobile ad hoc networks. We also provide comparisons with other clustering algorithms.
{"title":"An Efficient Stable Clustering Algorithm for Scalable Mobile Multi-Hop Networks","authors":"T. Rasheed, U. Javaid, Djamal-Eddine Meddour, L. Reynaud, K. A. Agha","doi":"10.1109/CCNC.2007.25","DOIUrl":"https://doi.org/10.1109/CCNC.2007.25","url":null,"abstract":"The rapid proliferation of mobile devices has influenced the potential growth of wireless networking applications. This has lead to an augmentation in wireless ad hoc networking scenarios, particularly interesting for network operators. In this work, we present an adaptive framework for weight metric estimation and dissemination to construct stable and reliable weight-based clusters which can provide faster convergence rates and performance results for dynamic routing in mobile ad hoc networks. The framework considers critical node properties in determining a node's suitability for becoming clusterheads. It employs adaptive cluster radius and dynamic network constraints as the weight dissemination criterion. We observe that the proposed algorithm is suitable for scalable ad hoc networks and provides stable cluster formation decisions based on weighted metric approaches. Extensive performance evaluations confirm the suitability of the protocol for adaptive stable cluster formation and control overhead reduction in mobile ad hoc networks. We also provide comparisons with other clustering algorithms.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"57 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":"130037501","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}
Retrieving data from the memory of a remote computer is significantly faster than retrieving data from a remote storage device. Therefore, sharing caches among several computers can reduce the number of storage device access. In this paper, we propose a new collaboration scheme among clients in a computer cluster to share their caches with each other. The collaboration is designed based on peer-to-peer computing model. The scheme not only provides an easy to develop software architecture but also yields a near optimal performance with rea- sonably low overheads. Simulations are conducted to demonstrate the performance of the proposed scheme.
{"title":"Low Cost Peer-to-Peer Collaborative Caching for Clusters","authors":"Xuemin Shen, Mohammad Mursalin Akon, Ajit Singh","doi":"10.1109/CCNC.2007.114","DOIUrl":"https://doi.org/10.1109/CCNC.2007.114","url":null,"abstract":"Retrieving data from the memory of a remote computer is significantly faster than retrieving data from a remote storage device. Therefore, sharing caches among several computers can reduce the number of storage device access. In this paper, we propose a new collaboration scheme among clients in a computer cluster to share their caches with each other. The collaboration is designed based on peer-to-peer computing model. The scheme not only provides an easy to develop software architecture but also yields a near optimal performance with rea- sonably low overheads. Simulations are conducted to demonstrate the performance of the proposed scheme.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"286 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":"116441865","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
扫码关注我们
求助内容：
应助结果提醒方式：