Pub Date : 2011-10-17DOI: 10.1109/ICNP.2011.6089044
S. Hameed, Xiaoming Fu, Pan Hui, Nishanth R. Sastry
In this paper we introduce LENS, a novel spam protection system based on the recipient's social network, which allows correspondence within the social circle to directly pass to the mailbox and further mitigates spam beyond social circles. The key idea in LENS is to select legitimate and authentic users, called Gatekeepers (GKs), from outside the recipients social circle and within pre-defined social distances. Unless a GK vouches for the emails of potential senders from outside the social circle of a particular recipient, those e-mails are prevented from transmission. In this way LENS drastically reduces the consumption of Internet bandwidth by spam. Using extensive evaluations, we show that LENS provides each recipient reliable email delivery from a large fraction of the social network. We also evaluate the computational complexity of email processing with LENS deployed on two Mail Servers (MSs) and compared it with the most popular content-based filter i.e SpamAssassin. LENS proved to be fast in processing emails (around 2–3 orders of magnitude better than SpamAssassin) and scales efficiently with increasing community size and GKs.
{"title":"LENS: Leveraging social networking and trust to prevent spam transmission","authors":"S. Hameed, Xiaoming Fu, Pan Hui, Nishanth R. Sastry","doi":"10.1109/ICNP.2011.6089044","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089044","url":null,"abstract":"In this paper we introduce LENS, a novel spam protection system based on the recipient's social network, which allows correspondence within the social circle to directly pass to the mailbox and further mitigates spam beyond social circles. The key idea in LENS is to select legitimate and authentic users, called Gatekeepers (GKs), from outside the recipients social circle and within pre-defined social distances. Unless a GK vouches for the emails of potential senders from outside the social circle of a particular recipient, those e-mails are prevented from transmission. In this way LENS drastically reduces the consumption of Internet bandwidth by spam. Using extensive evaluations, we show that LENS provides each recipient reliable email delivery from a large fraction of the social network. We also evaluate the computational complexity of email processing with LENS deployed on two Mail Servers (MSs) and compared it with the most popular content-based filter i.e SpamAssassin. LENS proved to be fast in processing emails (around 2–3 orders of magnitude better than SpamAssassin) and scales efficiently with increasing community size and GKs.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"30 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116405585","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 : 2011-10-17DOI: 10.1109/ICNP.2011.6089032
R. Panta, R. Hall, J. Auzins, M. Fernandez
An important but relatively less studied class of network layer protocol for sensor networks is geocast. It allows a sensor node to send messages to all nodes in a given geographical area without the sender node having any knowledge about which nodes are present in that area. Developing a robust geocast protocol for practical sensor networks poses several challenges. Geocast messages should be reliably delivered to the destination area in the presence of unreliable wireless links, a typical characteristic of practical sensor network deployments. The protocol should minimize the number of radio transmissions and avoid control traffic to save energy, which is a scarce resource in sensor networks. The protocol should be robust against a wide range of network densities. This paper presents the design, implementation, and evaluation of SGcast — a reliable, robust, and energy-efficient geocast protocol that achieves these goals. For a wide range of experiments conducted using networks of real sensor nodes and simulations, we show that compared to a recent geocast protocol, SGcast achieves up to 11.08x reduction in energy consumption and up to 2.17x improvement in successful delivery of geocast messages to the destination area, while being robust against a wide variability in network densities.
{"title":"Geocast for wireless sensor networks","authors":"R. Panta, R. Hall, J. Auzins, M. Fernandez","doi":"10.1109/ICNP.2011.6089032","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089032","url":null,"abstract":"An important but relatively less studied class of network layer protocol for sensor networks is geocast. It allows a sensor node to send messages to all nodes in a given geographical area without the sender node having any knowledge about which nodes are present in that area. Developing a robust geocast protocol for practical sensor networks poses several challenges. Geocast messages should be reliably delivered to the destination area in the presence of unreliable wireless links, a typical characteristic of practical sensor network deployments. The protocol should minimize the number of radio transmissions and avoid control traffic to save energy, which is a scarce resource in sensor networks. The protocol should be robust against a wide range of network densities. This paper presents the design, implementation, and evaluation of SGcast — a reliable, robust, and energy-efficient geocast protocol that achieves these goals. For a wide range of experiments conducted using networks of real sensor nodes and simulations, we show that compared to a recent geocast protocol, SGcast achieves up to 11.08x reduction in energy consumption and up to 2.17x improvement in successful delivery of geocast messages to the destination area, while being robust against a wide variability in network densities.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126577726","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 : 2011-10-17DOI: 10.1109/ICNP.2011.6089059
Dan Li, Mingwei Xu, Hongze Zhao, Xiaoming Fu
Data center containers are regarded as the basic units to build mega data centers. In practice, heterogeneity exists among data center containers, because of technical innovation and vendor diversity. In this paper, we propose uFix, a scalable, flexible and modularized network architecture to interconnect heterogeneous data center containers. The inter-container connection rule in uFix is designed in such a way that it can flexibly scale to a huge number of servers with stable server/switch hardware settings. uFix allows modularized and fault-tolerant routing by completely decoupling inter-container routing from intra-container routing. We implement a software-based uFix stack on the Linux platform. Simulation and experiment results show that uFix enjoys high network capacity, gracefully handles server/switch failures, and brings light-weight CPU overhead onto data center servers.
{"title":"Building mega data center from heterogeneous containers","authors":"Dan Li, Mingwei Xu, Hongze Zhao, Xiaoming Fu","doi":"10.1109/ICNP.2011.6089059","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089059","url":null,"abstract":"Data center containers are regarded as the basic units to build mega data centers. In practice, heterogeneity exists among data center containers, because of technical innovation and vendor diversity. In this paper, we propose uFix, a scalable, flexible and modularized network architecture to interconnect heterogeneous data center containers. The inter-container connection rule in uFix is designed in such a way that it can flexibly scale to a huge number of servers with stable server/switch hardware settings. uFix allows modularized and fault-tolerant routing by completely decoupling inter-container routing from intra-container routing. We implement a software-based uFix stack on the Linux platform. Simulation and experiment results show that uFix enjoys high network capacity, gracefully handles server/switch failures, and brings light-weight CPU overhead onto data center servers.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132691566","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 : 2011-10-17DOI: 10.1109/ICNP.2011.6089036
Yong Li, L. Su, Depeng Jin, Lieguang Zeng
We present TUNIE, a network platform for rapid concurrent experiment of network innovation on virtualized programmable infrastructure. TUNIE integrates both software-and hardware-based router virtualization technologies to provide a flexible approach to configure and customize both the control plane and data plane, and at the same time satisfied various experiment designing requirements. We implement TUNIE, and deploy it in Tsinghua University. Early experiment of algorithm evaluation verifies the efficiency TUNIE.
{"title":"TUNIE: A virtualized platform for network experiment on programmable infrastructure","authors":"Yong Li, L. Su, Depeng Jin, Lieguang Zeng","doi":"10.1109/ICNP.2011.6089036","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089036","url":null,"abstract":"We present TUNIE, a network platform for rapid concurrent experiment of network innovation on virtualized programmable infrastructure. TUNIE integrates both software-and hardware-based router virtualization technologies to provide a flexible approach to configure and customize both the control plane and data plane, and at the same time satisfied various experiment designing requirements. We implement TUNIE, and deploy it in Tsinghua University. Early experiment of algorithm evaluation verifies the efficiency TUNIE.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115519775","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 : 2011-10-17DOI: 10.1109/ICNP.2011.6089072
D. Nguyen, J. Garcia-Luna-Aceves
Multi-antenna systems can provide greater throughput and range coverage than traditional single antenna systems. A key aspect of exploiting this new physical layer (PHY) is rate adaptation, which consists of finding the best rate for sending data packets. Unlike rate adaptation in single antenna systems, nodes have many choices apart from adapting different modulation types, and these choices include using spatial multiplexing or transmit diversity, types of guard intervals, and channel width. We present an evaluation and implementation of a new rate adaptation scheme for multi-antenna systems applicable to off-the-shelf wireless cards. Our rate adaptation scheme, rate adaptation for multi-antenna systems (RAMAS), is simple and practical, and eliminates the complexity of the rate adaptation approaches proposed for IEEE 802.11n in the recent past. Extensive experimental evaluation is used to show that RAMAS performs consistently better than many current IEEE 802.11n rate adaptation schemes with much less complexity, and that RAMAS is especially efficient in multi-user and interference-laden environments.
{"title":"A practical approach to rate adaptation for multi-antenna systems","authors":"D. Nguyen, J. Garcia-Luna-Aceves","doi":"10.1109/ICNP.2011.6089072","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089072","url":null,"abstract":"Multi-antenna systems can provide greater throughput and range coverage than traditional single antenna systems. A key aspect of exploiting this new physical layer (PHY) is rate adaptation, which consists of finding the best rate for sending data packets. Unlike rate adaptation in single antenna systems, nodes have many choices apart from adapting different modulation types, and these choices include using spatial multiplexing or transmit diversity, types of guard intervals, and channel width. We present an evaluation and implementation of a new rate adaptation scheme for multi-antenna systems applicable to off-the-shelf wireless cards. Our rate adaptation scheme, rate adaptation for multi-antenna systems (RAMAS), is simple and practical, and eliminates the complexity of the rate adaptation approaches proposed for IEEE 802.11n in the recent past. Extensive experimental evaluation is used to show that RAMAS performs consistently better than many current IEEE 802.11n rate adaptation schemes with much less complexity, and that RAMAS is especially efficient in multi-user and interference-laden environments.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124431908","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 : 2011-10-17DOI: 10.1109/ICNP.2011.6089055
Jaehyuk Choi, K. Shin
Mobile WiFi hotspots have become increasingly popular as a new innovative wireless Internet access technology. Although it has received little attention, adaptive, dynamic (re)assignment of channels in a mobile hotspot router — typically, a smartphone or a laptop or a tablet equipped with heterogeneous network interfaces like 3G/4G, WiFi, Bluetooth or ZigBee — is key to mobile hotspot performance. To fill this important gap, we present a novel scheme, called Ex2R, that finds the best WiFi service-channel by harnessing secondary low-power ZigBee radios accompanied in mobile hotspot systems, enabling intelligent and seamless dynamic channel reconfiguration. Ex2R exploits the RSSI values and clear channel assessment (CCA) outputs from the ZigBee radio sampling interface to measure idle-time fractions on candidate WiFi channels, and determines the channel that can provide the highest hotspot capacity. Ex2R thus provides a mobile hotspot router accurate information necessary for the selection of the best channel. We have implemented and evaluated Ex2R, demonstrating its effectiveness; Ex2R accurately ranks WiFi channels for a mobile hotspot router to dynamically select and switch to the best channel available, thus improving hotspot performance significantly.
{"title":"Out-of-band sensing with ZigBee for dynamic channel assignment in on-the-move hotspots","authors":"Jaehyuk Choi, K. Shin","doi":"10.1109/ICNP.2011.6089055","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089055","url":null,"abstract":"Mobile WiFi hotspots have become increasingly popular as a new innovative wireless Internet access technology. Although it has received little attention, adaptive, dynamic (re)assignment of channels in a mobile hotspot router — typically, a smartphone or a laptop or a tablet equipped with heterogeneous network interfaces like 3G/4G, WiFi, Bluetooth or ZigBee — is key to mobile hotspot performance. To fill this important gap, we present a novel scheme, called Ex2R, that finds the best WiFi service-channel by harnessing secondary low-power ZigBee radios accompanied in mobile hotspot systems, enabling intelligent and seamless dynamic channel reconfiguration. Ex2R exploits the RSSI values and clear channel assessment (CCA) outputs from the ZigBee radio sampling interface to measure idle-time fractions on candidate WiFi channels, and determines the channel that can provide the highest hotspot capacity. Ex2R thus provides a mobile hotspot router accurate information necessary for the selection of the best channel. We have implemented and evaluated Ex2R, demonstrating its effectiveness; Ex2R accurately ranks WiFi channels for a mobile hotspot router to dynamically select and switch to the best channel available, thus improving hotspot performance significantly.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127354138","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 : 2011-10-17DOI: 10.1109/ICNP.2011.6089067
Onur Ascigil
Conventional wisdom says that a source-routed network architecture — that is, one in which packets carry explicit (partial) paths through the network, and nodes of the infrastructure simply forwards packets along those paths — is not scalable. Because of the significant benefits offered by such an architecture, its scalability merits a careful investigation. Using a combination of simulation and measurement, we propose to examine the limits of scalability of source routing architectures. We limit our focus to architectures that (i) separate routing from forwarding, (ii) separate routing from topology discovery, and (iii) use flat identifiers because these architectures are radically different than the current Internet architecture, whose scalability limits are known. We measure scalability along three dimensions: path discovery and computation; collection and maintenance of up-to-date topological information; and the latency cost of communicating with a path service.
{"title":"PhD Forum: On the scalability of source routing architectures","authors":"Onur Ascigil","doi":"10.1109/ICNP.2011.6089067","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089067","url":null,"abstract":"Conventional wisdom says that a source-routed network architecture — that is, one in which packets carry explicit (partial) paths through the network, and nodes of the infrastructure simply forwards packets along those paths — is not scalable. Because of the significant benefits offered by such an architecture, its scalability merits a careful investigation. Using a combination of simulation and measurement, we propose to examine the limits of scalability of source routing architectures. We limit our focus to architectures that (i) separate routing from forwarding, (ii) separate routing from topology discovery, and (iii) use flat identifiers because these architectures are radically different than the current Internet architecture, whose scalability limits are known. We measure scalability along three dimensions: path discovery and computation; collection and maintenance of up-to-date topological information; and the latency cost of communicating with a path service.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121714975","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 : 2011-10-17DOI: 10.1109/ICNP.2011.6089065
M. Ahmad, R. Guha
The Internet is a network of Autonomous Systems (ASes) comprising of a complex and complicated ecosystem of networks used for a wide variety of applications. ASes exhibit varied functionality and communicate according to predefined rules to maintain distinct business objectives; termed intra-AS relations. These relations are one of two types: customer-provider (hierarchical) or peering (flat). Recent studies of intra-AS relations indicate the gradual transition of the Internet ecosystem from the hierarchical structure to a flatter peering architecture [1]. This infrastructure level flattening is characterized by the constant growth, rewiring and deaths of inter-AS links. Primary driving forces behind these changes are economic; especially the meteoric rise in popularity of organizations such as Facebook, Google, Yahoo and Microsoft, who have lately deployed large, private WAN infrastructures [1]. The transition from the hierarchical Internet has also accelerated with the deployment of multiple Internet eXchange Points (IXPs) worldwide, the facilitator of peering. Numerous peering links (between ASes) at these IXPs have recently been uncovered but their effects on Internet topology and inter-domain routing performance not yet examined.
{"title":"Internet exchange points and Internet routing","authors":"M. Ahmad, R. Guha","doi":"10.1109/ICNP.2011.6089065","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089065","url":null,"abstract":"The Internet is a network of Autonomous Systems (ASes) comprising of a complex and complicated ecosystem of networks used for a wide variety of applications. ASes exhibit varied functionality and communicate according to predefined rules to maintain distinct business objectives; termed intra-AS relations. These relations are one of two types: customer-provider (hierarchical) or peering (flat). Recent studies of intra-AS relations indicate the gradual transition of the Internet ecosystem from the hierarchical structure to a flatter peering architecture [1]. This infrastructure level flattening is characterized by the constant growth, rewiring and deaths of inter-AS links. Primary driving forces behind these changes are economic; especially the meteoric rise in popularity of organizations such as Facebook, Google, Yahoo and Microsoft, who have lately deployed large, private WAN infrastructures [1]. The transition from the hierarchical Internet has also accelerated with the deployment of multiple Internet eXchange Points (IXPs) worldwide, the facilitator of peering. Numerous peering links (between ASes) at these IXPs have recently been uncovered but their effects on Internet topology and inter-domain routing performance not yet examined.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126872563","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 : 2011-10-17DOI: 10.1109/ICNP.2011.6089082
Ying Zhang, M. Tatipamula
The AS path prepending approach in BGP is commonly used to perform inter-domain traffic engineering, such as inbound traffic load-balancing for multi-homed ASes. It artificially increases the length of the AS level path in BGP announcements by inserting its local AS number multiple times into outgoing EBGP announcement messages. In this work, we first present a comprehensive study on the characterization of Internet routing AS path prepending. We further propose an algorithm for computing the optimal padding strategies given multiple neighboring links. Our method considers the impact of AS relationship based local policies on ASPP's effectiveness. The algorithm can be used for three objectives, i.e., traffic load balancing, backup route provisioning, and bypassing a specific AS for security purposes, e.g., avoiding information censorship. We demonstrate the accuracy and effectiveness of our approach using real BGP data and traffic data from Abilene networks.
{"title":"Characterization and design of effective BGP AS-path prepending","authors":"Ying Zhang, M. Tatipamula","doi":"10.1109/ICNP.2011.6089082","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089082","url":null,"abstract":"The AS path prepending approach in BGP is commonly used to perform inter-domain traffic engineering, such as inbound traffic load-balancing for multi-homed ASes. It artificially increases the length of the AS level path in BGP announcements by inserting its local AS number multiple times into outgoing EBGP announcement messages. In this work, we first present a comprehensive study on the characterization of Internet routing AS path prepending. We further propose an algorithm for computing the optimal padding strategies given multiple neighboring links. Our method considers the impact of AS relationship based local policies on ASPP's effectiveness. The algorithm can be used for three objectives, i.e., traffic load balancing, backup route provisioning, and bypassing a specific AS for security purposes, e.g., avoiding information censorship. We demonstrate the accuracy and effectiveness of our approach using real BGP data and traffic data from Abilene networks.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128653895","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 : 2011-10-17DOI: 10.1109/ICNP.2011.6089057
Xuejun Zhuo, Qinghua Li, Wei Gao, G. Cao, Yiqi Dai
The recent popularization of hand-held mobile devices, such as smartphones, enables the inter-connectivity among mobile users without the support of Internet infrastructure. When mobile users move and contact each other opportunistically, they form a Delay Tolerant Network (DTN), which can be exploited to share data among them. Data replication is one of the common techniques for such data sharing. However, the unstable network topology and limited contact duration in DTNs make it difficult to directly apply traditional data replication schemes. Although there are a few existing studies on data replication in DTNs, they generally ignore the contact duration limits. In this paper, we recognize the deficiency of existing data replication schemes which treat the complete data item as the replication unit, and propose to replicate data at the packet level. We analytically formulate the contact duration aware data replication problem and give a centralized solution to better utilize the limited storage buffers and the contact opportunities. We further propose a practical contact Duration Aware Replication Algorithm (DARA) which operates in a fully distributed manner and reduces the computational complexity. Extensive simulations on both synthetic and realistic traces show that our distributed scheme achieves close-to-optimal performance, and outperforms other existing replication schemes.
{"title":"Contact duration aware data replication in Delay Tolerant Networks","authors":"Xuejun Zhuo, Qinghua Li, Wei Gao, G. Cao, Yiqi Dai","doi":"10.1109/ICNP.2011.6089057","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089057","url":null,"abstract":"The recent popularization of hand-held mobile devices, such as smartphones, enables the inter-connectivity among mobile users without the support of Internet infrastructure. When mobile users move and contact each other opportunistically, they form a Delay Tolerant Network (DTN), which can be exploited to share data among them. Data replication is one of the common techniques for such data sharing. However, the unstable network topology and limited contact duration in DTNs make it difficult to directly apply traditional data replication schemes. Although there are a few existing studies on data replication in DTNs, they generally ignore the contact duration limits. In this paper, we recognize the deficiency of existing data replication schemes which treat the complete data item as the replication unit, and propose to replicate data at the packet level. We analytically formulate the contact duration aware data replication problem and give a centralized solution to better utilize the limited storage buffers and the contact opportunities. We further propose a practical contact Duration Aware Replication Algorithm (DARA) which operates in a fully distributed manner and reduces the computational complexity. Extensive simulations on both synthetic and realistic traces show that our distributed scheme achieves close-to-optimal performance, and outperforms other existing replication schemes.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122501136","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
扫码关注我们
求助内容：
应助结果提醒方式：