Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784698
Joongheon Kim, Beomjin Jeon
This paper addresses optimal beacon fragmentation schemes for high-performance MAC in 60 GHz millimeter wave (mmWave) networks. The proposed optimal beacon scheme can be classified into two methods, i.e., differentiated and fragmentized beaconing. Differentiated and fragmentized beaconing schemes are for directional and omni-directional data transmission. By the result of performance evaluation, the novelty of the proposed schemes is verified.
{"title":"Optimal Beaconing for 60 GHz Millimeter Wave","authors":"Joongheon Kim, Beomjin Jeon","doi":"10.1109/CCNC.2009.4784698","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784698","url":null,"abstract":"This paper addresses optimal beacon fragmentation schemes for high-performance MAC in 60 GHz millimeter wave (mmWave) networks. The proposed optimal beacon scheme can be classified into two methods, i.e., differentiated and fragmentized beaconing. Differentiated and fragmentized beaconing schemes are for directional and omni-directional data transmission. By the result of performance evaluation, the novelty of the proposed schemes is verified.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131178154","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784886
A. D. Pragad, P. Pangalos, V. Friderikos, H. Aghvami
To minimize the large handover delays associated with Mobile IPv6 numerous micro-mobility protocols were proposed. In this paper, we consider the Mobility Agent (MA) based family of micro-mobility protocols such as Hierarchical Mobile IPv6 and Proxy Mobile IPv6 and focus on the issue of the bottlenecks that MAs can lead up to under high network load. We propose a Dynamic QoS aware Route Optimization with the aim of reducing the bottlenecks around MAs. We exploit the fact that not all classes of IP traffic require low handover latency support; for example, P2P traffic, web browsing, etc. do not require high QoS and are delay tolerant. Hence, such traffic classes can be forced to establish a direct connection with the CN and the routing policies at edge routers can ensure these traffic classes bypass the MA. The number of traffic classes that are to bypass the MA increases dynamically according to the congestion of the network. Results show that by implementing the dynamic route optimization the network utilization increases and the average packet delay in the network are reduced.
{"title":"Dynamic QoS Aware Route Optimization for Networks with Mobility Agents","authors":"A. D. Pragad, P. Pangalos, V. Friderikos, H. Aghvami","doi":"10.1109/CCNC.2009.4784886","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784886","url":null,"abstract":"To minimize the large handover delays associated with Mobile IPv6 numerous micro-mobility protocols were proposed. In this paper, we consider the Mobility Agent (MA) based family of micro-mobility protocols such as Hierarchical Mobile IPv6 and Proxy Mobile IPv6 and focus on the issue of the bottlenecks that MAs can lead up to under high network load. We propose a Dynamic QoS aware Route Optimization with the aim of reducing the bottlenecks around MAs. We exploit the fact that not all classes of IP traffic require low handover latency support; for example, P2P traffic, web browsing, etc. do not require high QoS and are delay tolerant. Hence, such traffic classes can be forced to establish a direct connection with the CN and the routing policies at edge routers can ensure these traffic classes bypass the MA. The number of traffic classes that are to bypass the MA increases dynamically according to the congestion of the network. Results show that by implementing the dynamic route optimization the network utilization increases and the average packet delay in the network are reduced.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116974419","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784728
Wei Wang, H. Man, Yu Liu
We introduce a social network analysis method as a new approach to build an Intrusion Detection System (SNIDS) in ad hoc networks. The SN-IDS utilizes social relations as metrics-of-interest for anomaly detections, which is different from most traditional IDS approaches. To construct proper social networks, we first investigate ad hoc MAC and network layer data attributes and select relevant social feature sets; then we build up a set of socio-matrices based on these features. Social analysis methods are applied to these matrices to detect suspicious behaviors of mobile nodes. NS-2 simulation results show that this SN-IDS system can effectively detect common attacks with high detection rates and low false positive alarm rates. Furthermore, it has clear advantages over the conventional association rule based data mining IDS in terms of computation and system complexity.
本文介绍了一种社会网络分析方法，作为在自组织网络中构建入侵检测系统(SNIDS)的新方法。SN-IDS利用社会关系作为异常检测的兴趣度量，这与大多数传统的IDS方法不同。为了构建合适的社交网络，我们首先研究ad hoc MAC和网络层数据属性，并选择相关的社交特征集;然后我们根据这些特征建立一组社会矩阵。对这些矩阵应用社会分析方法来检测移动节点的可疑行为。NS-2仿真结果表明，该系统能够有效检测常见攻击，检测率高，误报率低。此外，与传统的基于关联规则的数据挖掘IDS相比，它在计算量和系统复杂性方面具有明显的优势。
{"title":"An Intrusion Detection System in Ad Hoc Networks: A Social Network Analysis Approach","authors":"Wei Wang, H. Man, Yu Liu","doi":"10.1109/CCNC.2009.4784728","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784728","url":null,"abstract":"We introduce a social network analysis method as a new approach to build an Intrusion Detection System (SNIDS) in ad hoc networks. The SN-IDS utilizes social relations as metrics-of-interest for anomaly detections, which is different from most traditional IDS approaches. To construct proper social networks, we first investigate ad hoc MAC and network layer data attributes and select relevant social feature sets; then we build up a set of socio-matrices based on these features. Social analysis methods are applied to these matrices to detect suspicious behaviors of mobile nodes. NS-2 simulation results show that this SN-IDS system can effectively detect common attacks with high detection rates and low false positive alarm rates. Furthermore, it has clear advantages over the conventional association rule based data mining IDS in terms of computation and system complexity.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117145604","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784750
Ting Zhou, H. Sharif, M. Hempel, P. Mahasukhon, Wei Wang
This paper presents a novel passive measurement approach to accurately evaluate the performance of outdoor multi-hop 802.11 networks from the wireless side directly. Our approach employs five processing steps to evaluate per-hop system performances. Firstly, reference packets are identified from multiple independent packet traces. Secondly, multiple packet traces in one channel are merged together using the identified reference packets. Thirdly, redundant packets are filtered from the merging packet traces. To adjust for propagation differences between access points and monitors, the status of each packet is then corrected according to its context packets. Finally, an inference approach based on finite state machines (FSM) is designed to infer missing packets which are not recorded in any of the monitor traces but known to have existed in the real traffic. The unique features in our approach include propagation delay evaluation and FSM designs for existing packet status correction and missing packet inference. The measurement results collected from our outdoor multi-hop 802.11 testbed are used to validate the accuracy of our approach.
{"title":"Quantitative Study of an Outdoor Multi-Hop 802.11 Network Performance using a Novel Passive Measurement Approach","authors":"Ting Zhou, H. Sharif, M. Hempel, P. Mahasukhon, Wei Wang","doi":"10.1109/CCNC.2009.4784750","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784750","url":null,"abstract":"This paper presents a novel passive measurement approach to accurately evaluate the performance of outdoor multi-hop 802.11 networks from the wireless side directly. Our approach employs five processing steps to evaluate per-hop system performances. Firstly, reference packets are identified from multiple independent packet traces. Secondly, multiple packet traces in one channel are merged together using the identified reference packets. Thirdly, redundant packets are filtered from the merging packet traces. To adjust for propagation differences between access points and monitors, the status of each packet is then corrected according to its context packets. Finally, an inference approach based on finite state machines (FSM) is designed to infer missing packets which are not recorded in any of the monitor traces but known to have existed in the real traffic. The unique features in our approach include propagation delay evaluation and FSM designs for existing packet status correction and missing packet inference. The measurement results collected from our outdoor multi-hop 802.11 testbed are used to validate the accuracy of our approach.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124107843","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784743
Qinghai Yang, K. Kwak, Fenglin Fu
This paper addresses the performance analysis for orthogonal space-time block coded (STBC) multiband orthogonal frequency division multiplexing (MB-OFDM) ultra-wideband (UWB) systems. As the channel model considers the log-normal fading, the resultant signal to noise ratio (SNR) will be the product of a log-normal distributed variable and a variable of sum of several Gamma-distributed variants. Based on this, the exact expressions for the bit error probability and the outage probability are derived theoretically. And their approximate expressions can be obtained via the Gauss-Hermite and the Gauss-Laguerre quadratures, respectively. Simulation results verify the theoretical solutions.
{"title":"Performance Analysis of STBC MB-OFDM UWB","authors":"Qinghai Yang, K. Kwak, Fenglin Fu","doi":"10.1109/CCNC.2009.4784743","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784743","url":null,"abstract":"This paper addresses the performance analysis for orthogonal space-time block coded (STBC) multiband orthogonal frequency division multiplexing (MB-OFDM) ultra-wideband (UWB) systems. As the channel model considers the log-normal fading, the resultant signal to noise ratio (SNR) will be the product of a log-normal distributed variable and a variable of sum of several Gamma-distributed variants. Based on this, the exact expressions for the bit error probability and the outage probability are derived theoretically. And their approximate expressions can be obtained via the Gauss-Hermite and the Gauss-Laguerre quadratures, respectively. Simulation results verify the theoretical solutions.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124791513","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784822
Michael Chukwu
The significant increase in data transmission rates of mobile networks, improvement in camera/display technologies and the continuous rise in computational power of mobile devices has stimulated and supported the wide deployment of multimedia services to mobile platforms. However the wide diversity of these devices creates a need for efficient and seamless adaptation scheme that provides for the transparent and augmented use of these multimedia services.
{"title":"Media Adaptation for Connected Mobile Devices","authors":"Michael Chukwu","doi":"10.1109/CCNC.2009.4784822","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784822","url":null,"abstract":"The significant increase in data transmission rates of mobile networks, improvement in camera/display technologies and the continuous rise in computational power of mobile devices has stimulated and supported the wide deployment of multimedia services to mobile platforms. However the wide diversity of these devices creates a need for efficient and seamless adaptation scheme that provides for the transparent and augmented use of these multimedia services.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124877335","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784767
Federico Covino, Massimo Mecella
The increasing of bandwidth capacity and the rising of more active and more demanding Internet users motivate the research of the best solution in P2P multimedia streaming. This paper presents STREAM COMPLETE, a new architecture and prototype system for mesh-based P2P live video streaming; it realizes a new concept of overlay network's management as well as merges the best practices of tree- and mesh-based approaches. STREAM COMPLETE creates a dynamic overlay network that optimizes itself basing on local conditions of peers. The two core operations are: (i) FastTop, that reorganizes peers in order to improve the general performance of the network; (ii) LoopCheck, that detects bounded loops of the multimedia streaming in the mesh overlay network. We have extensively evaluated the performance and the behavior of STREAM COMPLETE over the Planet Lab. Our experiments demonstrate the ability of peers in managing the overlay network with autonomic behavior in case of network changes. Furthermore the system is scalable w.r.t. the cardinality of the overlay network, by requiring very few control traffic.
{"title":"StreamComplete: An Architecture for Mesh-Based Peer-to-Peer Live Video Streaming","authors":"Federico Covino, Massimo Mecella","doi":"10.1109/CCNC.2009.4784767","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784767","url":null,"abstract":"The increasing of bandwidth capacity and the rising of more active and more demanding Internet users motivate the research of the best solution in P2P multimedia streaming. This paper presents STREAM COMPLETE, a new architecture and prototype system for mesh-based P2P live video streaming; it realizes a new concept of overlay network's management as well as merges the best practices of tree- and mesh-based approaches. STREAM COMPLETE creates a dynamic overlay network that optimizes itself basing on local conditions of peers. The two core operations are: (i) FastTop, that reorganizes peers in order to improve the general performance of the network; (ii) LoopCheck, that detects bounded loops of the multimedia streaming in the mesh overlay network. We have extensively evaluated the performance and the behavior of STREAM COMPLETE over the Planet Lab. Our experiments demonstrate the ability of peers in managing the overlay network with autonomic behavior in case of network changes. Furthermore the system is scalable w.r.t. the cardinality of the overlay network, by requiring very few control traffic.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128437679","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784830
Kenji Saito, E. Morino
Today, money forms its own virtual world that is destructive to real economy; monetary economy formed by circulation of money has grown in an imbalanced way to have unproportionate influences over the real economy that consists solely of production, distribution and consumption. Virtual world technology can potentially lower the cost of alternative forms of economy that existed in the past, and bring tangibility, or agreement with real economy, back to money. But most available economy systems in the virtual worlds today are equally destructive as the monetary system in the real world. This position paper proposes revived forms of commodity money (common merchandise being used as a medium of exchange) and drafts in real terms (exchange tickets with promises of providing equivalent commodities as specified), utilizing virtual world technology to form tangible monetary systems for the benefit of both virtual and real economies.
{"title":"Towards Tangible \"Virtual Money\" - Position Paper","authors":"Kenji Saito, E. Morino","doi":"10.1109/CCNC.2009.4784830","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784830","url":null,"abstract":"Today, money forms its own virtual world that is destructive to real economy; monetary economy formed by circulation of money has grown in an imbalanced way to have unproportionate influences over the real economy that consists solely of production, distribution and consumption. \u0000 \u0000Virtual world technology can potentially lower the cost of alternative forms of economy that existed in the past, and bring tangibility, or agreement with real economy, back to money. But most available economy systems in the virtual worlds today are equally destructive as the monetary system in the real world. \u0000 \u0000This position paper proposes revived forms of commodity money (common merchandise being used as a medium of exchange) and drafts in real terms (exchange tickets with promises of providing equivalent commodities as specified), utilizing virtual world technology to form tangible monetary systems for the benefit of both virtual and real economies.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128611501","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784888
K. Sinha
Applications requiring low power and quick turn on time (e.g., sensor networks) usually employ radios with only simple modulation techniques such as ASK, OOK and FSK [12]. We present in this paper a non-coherent detection based transceiver implementation for the RBNSiZeComm protocol proposed in [1], [2]. For a hybrid modulation scheme using FSK and ASK and assuming equal likelihood of all possible binary strings of a given length, we show that relative to binary FSK, there is a 41% savings in energy on an average at the transmitter, over additive white gaussian noise (AWGN) channels. Furthermore, our simulation results demonstrate that compared to binary FSK, for wireless application scenarios where longevity of power supply is a major concern (e.g., remote healthcare, streaming multimedia and agriculture wireless sensor networks) our proposed implementation can extend the battery life of devices from about 33% to 61% on an average, for the different communication data types used in these applications. Coupled with the low cost and low complexity of the transceiver, these savings demonstrate the usefulness of RBNSiZeComm for applications involving low power wireless networks.
{"title":"An Energy Efficient Communication Scheme with Potential Application to Consumer and Personal Wireless Networks","authors":"K. Sinha","doi":"10.1109/CCNC.2009.4784888","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784888","url":null,"abstract":"Applications requiring low power and quick turn on time (e.g., sensor networks) usually employ radios with only simple modulation techniques such as ASK, OOK and FSK [12]. We present in this paper a non-coherent detection based transceiver implementation for the RBNSiZeComm protocol proposed in [1], [2]. For a hybrid modulation scheme using FSK and ASK and assuming equal likelihood of all possible binary strings of a given length, we show that relative to binary FSK, there is a 41% savings in energy on an average at the transmitter, over additive white gaussian noise (AWGN) channels. Furthermore, our simulation results demonstrate that compared to binary FSK, for wireless application scenarios where longevity of power supply is a major concern (e.g., remote healthcare, streaming multimedia and agriculture wireless sensor networks) our proposed implementation can extend the battery life of devices from about 33% to 61% on an average, for the different communication data types used in these applications. Coupled with the low cost and low complexity of the transceiver, these savings demonstrate the usefulness of RBNSiZeComm for applications involving low power wireless networks.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128629984","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784963
Satoru Noguchi, A. Inomata, K. Fujikawa, H. Sunahara
Distributed Hash Table (DHT) is a specialized distributed system that aims to lookup hashed identifiers efficiently in order to route messages to and from the corresponding nodes and objects. However DHTs are mechanisms sensitive to churn (the continuous and interleaved process of arrival / departure of nodes). As a result, they often cause loss of stored objects and failures in the lookup, a serious issue for all overlay networks. In this paper, we propose a dynamic replica location method using the session log in DHT. Our method can determine dynamically the effective number of replicas on session running periods among anticipate nodes. We also implemented a prototype based on an existing DHT routing algorithm, and we evaluated the performance of the prototype. Our proposed method was shown to reduce data loss and the cost for locating replication.
{"title":"Efficient Data Management using the Session Log in DHT and its Evaluation","authors":"Satoru Noguchi, A. Inomata, K. Fujikawa, H. Sunahara","doi":"10.1109/CCNC.2009.4784963","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784963","url":null,"abstract":"Distributed Hash Table (DHT) is a specialized distributed system that aims to lookup hashed identifiers efficiently in order to route messages to and from the corresponding nodes and objects. However DHTs are mechanisms sensitive to churn (the continuous and interleaved process of arrival / departure of nodes). As a result, they often cause loss of stored objects and failures in the lookup, a serious issue for all overlay networks. In this paper, we propose a dynamic replica location method using the session log in DHT. Our method can determine dynamically the effective number of replicas on session running periods among anticipate nodes. We also implemented a prototype based on an existing DHT routing algorithm, and we evaluated the performance of the prototype. Our proposed method was shown to reduce data loss and the cost for locating replication.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127292526","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
扫码关注我们
求助内容：
应助结果提醒方式：