Gabriel Sandulescu, A. Niruntasukrat, C. Charnsripinyo
{"title":"Resource-aware capacity evaluation for heterogeneous, disruption-tolerant networks","authors":"Gabriel Sandulescu, A. Niruntasukrat, C. Charnsripinyo","doi":"10.1145/2534142.2534150","DOIUrl":"https://doi.org/10.1145/2534142.2534150","url":null,"abstract":"Estimating end-to-end capacity is challenging in disruption-tolerant networks (DTNs) because reliable and timely feedback is usually unavailable. This paper proposes a resource-aware framework for estimating capacity between pairs of nodes. The proposed framework builds on information gathered autonomously by nodes so that results emerge from actual network properties. Achievable capacity is formulated as a linear programming problem. The objective function attempts to maximize delivered size when input data are quantized into messages at source and then injected in a single burst. Problem constraints emerge from conditioning intermediary nodes to avoid resource exhaustion. While the optimal solution remains challenging for most practical settings, the paper discusses alternatives that are less complex and more suitable for real implementation. We cover two scenarios: i) when network mobility is periodic or known in advance, and ii) when mobility is random but its spatial distribution remains stable in time. We claim that the proposed framework can be used to avoid resource exhaustion and network congestion in heterogeneous environments where no information about the system is known in advance. The results have been validated by simulations under various settings (number of flows, store-carry-forward protocols, homogeneous and heterogeneous resource distribution).","PeriodicalId":324285,"journal":{"name":"Asian Internet Engineering Conference","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116793919","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}
{"title":"An analytical model of a hybrid network of static and mobile sensors","authors":"Abrahale Tewelde, Wint Yi Poe, J. Schmitt","doi":"10.1145/2534142.2534148","DOIUrl":"https://doi.org/10.1145/2534142.2534148","url":null,"abstract":"There is a trend of conventional static WSNs towards hybrid static and mobile WSNs which can be seen in many recent protocols and designs. By enabling node mobility in conventional WSNs, the number of static sensors can be reduced effectively. Yet, what is still missing about a hybrid WSN is the optimal proportion of mobile and static sensors that can achieve the same network performance as a conventional WSN. In this paper, we propose an analytical model for hybrid WSNs, in particular, dealing with the area coverage issue while minimizing energy consumption. We first present the optimal proportion of mobile and static sensors in order to guarantee a full coverage with high probability under a uniform random node distribution. A mobility strategy is then developed which minimizes energy consumption due to node mobility. Finally, we evaluate the performance of the proposed model and mobility strategy using a discrete event network simulation framework based on OMNeT++. The simulation results validate the analytical solution.","PeriodicalId":324285,"journal":{"name":"Asian Internet Engineering Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128122985","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}
{"title":"Graceful node shutdown in wireless mesh networks","authors":"Christophe Melki, F. Benbadis, L. Iannone","doi":"10.1145/2534142.2534149","DOIUrl":"https://doi.org/10.1145/2534142.2534149","url":null,"abstract":"Thanks to the advances in wireless technology, Wireless Mesh Networks are becoming more and more widespread. Their application and deployment range from Internet access, e.g., Wireless Internet Service Providers using such a technology to provide Internet connectivity, up to crisis scenarios, e.g., public safety entities temporarily concentrated in small areas. So far, research work has focused mostly on routing and mobility management, resulting in a plethora of solutions able to cope with link instabilities and node movements. However, at the best of our knowledge, no research has been carried out in order to provide nodes with the possibility to gracefully leave a wireless mesh network without causing instabilities, routing loops, and packet drops. Common practice is to have a reactive approach, where the nodes leave the network by an abrupt shutdown, to which the network will then react. In this paper, we take a different angle, presenting a proactive technique, based on routing metric increments, to gracefully shutdown nodes before they actually leave the network. The results presented in the paper are encouraging and clearly show that such a technique helps in preventing routing loops and strongly reduces, sometimes even eliminating, packet loss, providing increased reliability.","PeriodicalId":324285,"journal":{"name":"Asian Internet Engineering Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132614318","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}
{"title":"A cache miss equation for partitioning an NDN content store","authors":"M. Rezazad, Y. Tay","doi":"10.1145/2534142.2534143","DOIUrl":"https://doi.org/10.1145/2534142.2534143","url":null,"abstract":"Named Data Networking (NDN) is becoming a prominent candidate for the next Internet architecture. One of the main features of the proposal lies in using in-network caching, which makes the performance of the storage in a router very crucial. As this storage capacity is very limited, to maintain its high functionality it is better to separate the contents of some applications (i.e., video, web, etc.) which can be reused by other clients and protect them from being replaced by non-cacheable content of other applications like emails, telephony app. etc., i.e. partitioning the content store. Partitioning might also provide means for ISPs to offer different level of quality for different applications based on service level agreements with the content producers. This paper considers dividing NDN traffi into classes, and examines how an NDN router's content store can be partitioned among these classes. It illustrates how this partitioning can be done dynamically by using the Buffer Miss Equation from previous work. This illustration considers two cases with different objectives: minimizing average (over all traffi classes) miss ratio and maintaining fairness (in miss ratios) among traffi classes.","PeriodicalId":324285,"journal":{"name":"Asian Internet Engineering Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130208473","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}
Preechai Mekbungwan, B. Devkota, Sarita Gurung, Apinun Tunpan, K. Kanchanasut
{"title":"Network coding based bulk data synchronization in mobile ad hoc networks","authors":"Preechai Mekbungwan, B. Devkota, Sarita Gurung, Apinun Tunpan, K. Kanchanasut","doi":"10.1145/2534142.2534145","DOIUrl":"https://doi.org/10.1145/2534142.2534145","url":null,"abstract":"In Mobile Ad hoc Network (MANET), Disruption Tolerant Networking (DTN) mechanisms can be used to cope with MANET disruptions as well as to improve the outcomes of bulk data dissemination in disrupted MANETs. We are interested in an emergency communication scenario where multiple OLSR-driven MANET partitions are deployed by different emergency responder teams to gather situational information. When two (or more) of such emergency responder teams reconvene for situational updates, there are strong demands to effectively disseminate and synchronize bulk data files (e.g. situational photos and revised maps) stored in the two previously separate MANET partitions in a newly joined MANET partition. Traditional multicast data dissemination in MANET is, however, very bandwidth consuming and does not suite our situation.\u0000 We have conducted our research in two parts. First, we devise a novel approach that identifies the best emerging link among the newly formed MANET links [16]. Second, which is this work, we adopt and test the Random Linear Network Coding (RLNC) technique to facilitate the synchronization of bulk data files from two previously separate MANET partitions via such best emerging link. We evaluate our system through a real-world test bed. We call our approach DTNC-CAST which reflects the many-to-many bulk data file dissemination in a Network-Coded DTN-like manner for OLSR MANETs.","PeriodicalId":324285,"journal":{"name":"Asian Internet Engineering Conference","volume":"29 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120894957","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}
{"title":"Towards classification of DNS erroneous queries","authors":"Yuta Kazato, K. Fukuda, T. Sugawara","doi":"10.1145/2534142.2534146","DOIUrl":"https://doi.org/10.1145/2534142.2534146","url":null,"abstract":"We analyze domain name system (DNS) errors (i.e., ServFail, Refused and NX Domain errors) in DNS traffic captured at an external connection link of an academic network in Japan and attempt to understand the causes of such errors. Because DNS errors that are responses to erroneous queries have a large impact on DNS traffic, we should reduce as many of them as possible. First, we show that ServFail and Refused errors are generated by queries from a small number of local resolvers and authoritative nameservers that do not relate to ordinary users. Second, we demonstrate that NX Domain errors have several query patterns due to mostly anti-virus/anti-spam systems as well as meaningless queries (i.e., mis-configuration). By analyzing erroneous queries leading to NX Domain errors with the proposed heuristic rules to identify the main causes of such errors, we successfully classify them into nine groups that cover approximately 90% of NX Domain errors with a low false positive rate. Furthermore, we find malicious domain names similar to Japanese SNS sites from the results. We discuss the main causes of these DNS errors and how to reduce them from the results of our analysis.","PeriodicalId":324285,"journal":{"name":"Asian Internet Engineering Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120977893","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}
{"title":"Towards passive DNS software fingerprinting","authors":"Ruetee Chitpranee, K. Fukuda","doi":"10.1145/2534142.2534144","DOIUrl":"https://doi.org/10.1145/2534142.2534144","url":null,"abstract":"This paper presents an alternative fingerprinting technique to identify DNS software running on caching resolvers in passively collected traffic traces. With this method, it is not required to send additional queries during the measurement, unlike existing techniques that rely on probing and may not be effective due to firewall filtering or refused responses.\u0000 We first carefully examine DNS query patterns upon specific emulation and extract 15 heuristic rules from the experiment to identify typical software (i.e., BIND, Unbound and Windows Server). We next demonstrate the effectiveness of the rules using real backbone traffic traces with ground truth data. The results show 99% accuracy compared to the ground truth. Furthermore, 78% of unknown hosts in the ground truth can be identified.","PeriodicalId":324285,"journal":{"name":"Asian Internet Engineering Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125099465","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}
Yu-Chuan Yen, C. Chu, Su-Ling Yeh, Hao-Hua Chu, Polly Huang
{"title":"Lab experiment vs. crowdsourcing: a comparative user study on Skype call quality","authors":"Yu-Chuan Yen, C. Chu, Su-Ling Yeh, Hao-Hua Chu, Polly Huang","doi":"10.1145/2534142.2534151","DOIUrl":"https://doi.org/10.1145/2534142.2534151","url":null,"abstract":"To deliver voice over the Internet in a cost-effective way, it is essential to quantify the quality of user experience (i.e., QoE) of a voice service at various provisioning levels. Conducting user studies is an inevitable step facilitating quantitative studies of QoE. The two experimental methods -- lab experiment vs. crowdsourcing via Amazon Mechanical Turk [1] -- are compared in this study. We find that, for the study of Skype call quality, the crowdsourcing approach stands out in terms of efficiency and user diversity, which in turn strengthens the robustness and the depth of the analysis.","PeriodicalId":324285,"journal":{"name":"Asian Internet Engineering Conference","volume":"41 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114008988","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}
{"title":"An efficient overhearing strategy for content distribution in wireless LAN","authors":"H. Yokose, S. Ohzahata, Toshihiko Kato","doi":"10.1145/2534142.2534147","DOIUrl":"https://doi.org/10.1145/2534142.2534147","url":null,"abstract":"When the same content is simultaneously downloaded by several terminals with unicast in a wireless LAN, the bandwidth must be divided among the terminals and download speed is reduced. With using broadcast nature of wireless media, we propose an efficient method that can achieve reliable content distribution by using overheard TCP flows of a specific content going to other terminals in a wireless LAN. In the proposed method a content is divided into pieces and the server distributes them according to the download status of the receivers in application level. To accelerate downloading, we propose a method for selecting the piece and the terminal for transmission taking the effect of network coding for efficient overhearing. We developed a testbed and confirmed that the proposed scheduling accelerates the download speed even where the communication speed of each terminal is different.","PeriodicalId":324285,"journal":{"name":"Asian Internet Engineering Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128921161","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}
{"title":"Performance bound for routing in urban scenarios","authors":"Raphaël Frank, E. Giordano, T. Engel, M. Gerla","doi":"10.1145/2089016.2089023","DOIUrl":"https://doi.org/10.1145/2089016.2089023","url":null,"abstract":"In this paper we present a novel evaluation methodology for the comparison of ad hoc routing protocols in urban scenarios applied to inter-vehicular communications. We introduce a new route evaluation metric that identifies the goodness of a given route. Through analysis of subsequent mobility snapshots of the network topology, we compute an optimal route between two communicating vehicles. We compare the properties of the obtained route to the most representative routing approaches namely reactive and proactive routing. Based on this evaluation we provide a detailed discussion on the pros and cons of the different schemes when applied to urban scenarios.","PeriodicalId":324285,"journal":{"name":"Asian Internet Engineering Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121819553","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}