Izabela Moise, M. Hurfin, Linda Zeghache, N. Badache
Mobile devices are now equipped with multiple sensors and networking capabilities. They can gather information about their surrounding environment and interact both with nearby nodes, using a dynamic and self-configurable ad-hoc network, and with distant nodes via the Internet. While the concept of mobile agent is appropriate to explore the ad-hoc network and autonomously discover service providers, it is not suitable for the implementation of strong distributed synchronization mechanisms. Moreover, the termination of a task assigned to an agent may be compromised if the persistence of the agent itself is not ensured. In the case of a transactional mobile agent, we identify two services, Availability of the Source and Atomic Commit, that have to be supplied by more powerful entities located outside the ad-hoc network, in a remote network, called the support network. We propose a solution where the two services are successively provided by an active entity called the leader. In the support network, crash failures may also occur. To guarantee reliability, the main actions performed by the leader are the subject of a consensus with all the other potential leaders. The proposed solution relies on a single agreement protocol that orders continuously all the new actions.
{"title":"Remote Reliable Services to Support Transactional Mobile Agents","authors":"Izabela Moise, M. Hurfin, Linda Zeghache, N. Badache","doi":"10.1109/NCA.2010.51","DOIUrl":"https://doi.org/10.1109/NCA.2010.51","url":null,"abstract":"Mobile devices are now equipped with multiple sensors and networking capabilities. They can gather information about their surrounding environment and interact both with nearby nodes, using a dynamic and self-configurable ad-hoc network, and with distant nodes via the Internet. While the concept of mobile agent is appropriate to explore the ad-hoc network and autonomously discover service providers, it is not suitable for the implementation of strong distributed synchronization mechanisms. Moreover, the termination of a task assigned to an agent may be compromised if the persistence of the agent itself is not ensured. In the case of a transactional mobile agent, we identify two services, Availability of the Source and Atomic Commit, that have to be supplied by more powerful entities located outside the ad-hoc network, in a remote network, called the support network. We propose a solution where the two services are successively provided by an active entity called the leader. In the support network, crash failures may also occur. To guarantee reliability, the main actions performed by the leader are the subject of a consensus with all the other potential leaders. The proposed solution relies on a single agreement protocol that orders continuously all the new actions.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131134119","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 order to improve scalability and reduce maintenance overhead for Peer-to-Peer system, several architecture with constant degree and optimal diameter are proposed. However, the expected topology doesn’t effectively utilize the bandwidth capacity of peers. In this work, we propose K-overlay, an overlay scheme based on unbalanced Kautz graph with logdn diameter and constant in-degree. We define the degree of a digraph as the maximum number of arcs arriving at or leaving from any vertex. The diameter of a graph is the number of arc traversals that is sufficient to reach any vertex from any other vertex. K-overlay structure is based on two-fold mechanism. (1) Organization of peers in concentric circles to maximize the outgoing bandwidth of peers (2) Content delivery through parent as well as neighboring peers. Through formal analysis and comprehensive simulations, we show that our proposed architecture achieves optimal diameter and good connectivity as compared to existing overlay architecture like P2Cast.
{"title":"K-overlay: A Kautz Tree Structure for Video on Demand System","authors":"Ubaid Abbasi, T. Ahmed","doi":"10.1109/NCA.2010.45","DOIUrl":"https://doi.org/10.1109/NCA.2010.45","url":null,"abstract":"In order to improve scalability and reduce maintenance overhead for Peer-to-Peer system, several architecture with constant degree and optimal diameter are proposed. However, the expected topology doesn’t effectively utilize the bandwidth capacity of peers. In this work, we propose K-overlay, an overlay scheme based on unbalanced Kautz graph with logdn diameter and constant in-degree. We define the degree of a digraph as the maximum number of arcs arriving at or leaving from any vertex. The diameter of a graph is the number of arc traversals that is sufficient to reach any vertex from any other vertex. K-overlay structure is based on two-fold mechanism. (1) Organization of peers in concentric circles to maximize the outgoing bandwidth of peers (2) Content delivery through parent as well as neighboring peers. Through formal analysis and comprehensive simulations, we show that our proposed architecture achieves optimal diameter and good connectivity as compared to existing overlay architecture like P2Cast.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124006181","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}
Cloud computing is a highly dynamic environment where resources can be composed with other ones to provide many kinds of services to clients. In such scenario naming and resource location become critical issues and the existing Domain Name System (DNS), considered alone, is not able to address the new emerging problems. A cloud environment offers a variety of concrete and abstracted entities which need to be identified, whose states can frequently change: a virtual resource, could be allocated, deallocated or moved from a context to another. Moreover, a cloud entity could hold one or more names, identifiers, and representations in various cloud contexts where name alterations could frequently occur. In such environment, the management and integration of independent cloud name spaces is then becoming more compelling. This paper aims to propose a cloud naming system able to address such problems, providing an implementation practice in a cloud federation use case.
{"title":"Ecosystem of Cloud Naming Systems: An Approach for the Management and Integration of Independent Cloud Name Spaces","authors":"A. Celesti, M. Villari, A. Puliafito","doi":"10.1109/NCA.2010.16","DOIUrl":"https://doi.org/10.1109/NCA.2010.16","url":null,"abstract":"Cloud computing is a highly dynamic environment where resources can be composed with other ones to provide many kinds of services to clients. In such scenario naming and resource location become critical issues and the existing Domain Name System (DNS), considered alone, is not able to address the new emerging problems. A cloud environment offers a variety of concrete and abstracted entities which need to be identified, whose states can frequently change: a virtual resource, could be allocated, deallocated or moved from a context to another. Moreover, a cloud entity could hold one or more names, identifiers, and representations in various cloud contexts where name alterations could frequently occur. In such environment, the management and integration of independent cloud name spaces is then becoming more compelling. This paper aims to propose a cloud naming system able to address such problems, providing an implementation practice in a cloud federation use case.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129289022","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 six-shot multicast (6Shot), a location-aware multicast algorithm devised for mobile ad hoc networks. Multicast is a one-to-many communication scheme and has largely been studied in such networks. Indeed, this communication primitive can be used as a building block for popular services, such as data streaming or group communication. The particularity of 6Shot is the location- aware routing scheme of its implementation, which offers improved efficiency in terms of message overhead compared to existing algorithms, for a reasonable cost in terms of reliability.
{"title":"Six-Shot Multicast: A Location-Aware Strategy for Efficient Message Routing in MANETs","authors":"B. Garbinato, A. Holzer, F. Vessaz","doi":"10.1109/NCA.2010.8","DOIUrl":"https://doi.org/10.1109/NCA.2010.8","url":null,"abstract":"In this paper, we introduce six-shot multicast (6Shot), a location-aware multicast algorithm devised for mobile ad hoc networks. Multicast is a one-to-many communication scheme and has largely been studied in such networks. Indeed, this communication primitive can be used as a building block for popular services, such as data streaming or group communication. The particularity of 6Shot is the location- aware routing scheme of its implementation, which offers improved efficiency in terms of message overhead compared to existing algorithms, for a reasonable cost in terms of reliability.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"218 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127327107","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}
Hashing techniques have been widely adopted for general IP address lookup and specific network intrusion detection. In most current commonly used XOR-hashing algorithms, each of the hash key bits is usually explicitly XORed only at most once in the hash process, which may limit the amount of potential randomness that can be introduced by the hashing process. This paper further looks into various ways in duplicating and re-using key bits to maximize randomness needed in the hashing process so as to enhance the overall performance further.
{"title":"Advanced Hashing with Hybrid Key Duplication for IP Address Lookup","authors":"Rujiroj Tiengtavat, Wei-Ming Lin","doi":"10.1109/NCA.2010.48","DOIUrl":"https://doi.org/10.1109/NCA.2010.48","url":null,"abstract":"Hashing techniques have been widely adopted for general IP address lookup and specific network intrusion detection. In most current commonly used XOR-hashing algorithms, each of the hash key bits is usually explicitly XORed only at most once in the hash process, which may limit the amount of potential randomness that can be introduced by the hashing process. This paper further looks into various ways in duplicating and re-using key bits to maximize randomness needed in the hashing process so as to enhance the overall performance further.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128876788","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 aim of this study is to suggest two automated techniques able to help medical staff to detect earlier than usual some diseases using wireless sensor networks (WSNs). In this context, a patient is equipped with physical sensors which sense health parameters. This WSN will perform some computations and will run an alarm when a disease is suspected. The first technique uses a population protocol to handle data exchanged between motes and provides an efficient algorithm to suggest that a disease is diagnosed on a patient. The algorithm is distributed, i.e., the decision may be done by any sensor dealing with the disease detection. The second technique uses a token algorithm where, some motes are denoted as masters. Each of them is in charge of deciding if a specific disease occurs. This technique is not totally distributed but enhances the network efficiency regarding to the energy consumption, the time execution and the number of exchanged messages.
{"title":"Anomaly Detection with Wireless Sensor Networks","authors":"N. Dessart, H. Fouchal, P. Hunel, Nicolas Vidot","doi":"10.1109/NCA.2010.36","DOIUrl":"https://doi.org/10.1109/NCA.2010.36","url":null,"abstract":"The aim of this study is to suggest two automated techniques able to help medical staff to detect earlier than usual some diseases using wireless sensor networks (WSNs). In this context, a patient is equipped with physical sensors which sense health parameters. This WSN will perform some computations and will run an alarm when a disease is suspected. The first technique uses a population protocol to handle data exchanged between motes and provides an efficient algorithm to suggest that a disease is diagnosed on a patient. The algorithm is distributed, i.e., the decision may be done by any sensor dealing with the disease detection. The second technique uses a token algorithm where, some motes are denoted as masters. Each of them is in charge of deciding if a specific disease occurs. This technique is not totally distributed but enhances the network efficiency regarding to the energy consumption, the time execution and the number of exchanged messages.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133027159","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}
With the advent of multi- and many-core architectures, new opportunities in fault-tolerant computing have become available. In this paper we propose a novel process replication method that provides transparent failover of non-deterministic TCP services by utilizing spare CPU cores. Our method does not require any changes to the TCP protocol, does not require any changes to the client software, and unlike existing solutions, it does not require any changes to the server applications either. We measure performance overhead on two real-world applications, a multimedia streaming service and an Internet Relay Chat daemon and show that the imposed overhead is minimal as the price of seamless failover. Our prototype implementation consists of a kernel module for Linux 2.6 without any changes to the existing kernel code.
{"title":"A Multi-core Approach to Providing Fault Tolerance for Non-deterministic Services","authors":"Balazs Gerofi, Y. Ishikawa","doi":"10.1109/NCA.2010.42","DOIUrl":"https://doi.org/10.1109/NCA.2010.42","url":null,"abstract":"With the advent of multi- and many-core architectures, new opportunities in fault-tolerant computing have become available. In this paper we propose a novel process replication method that provides transparent failover of non-deterministic TCP services by utilizing spare CPU cores. Our method does not require any changes to the TCP protocol, does not require any changes to the client software, and unlike existing solutions, it does not require any changes to the server applications either. We measure performance overhead on two real-world applications, a multimedia streaming service and an Internet Relay Chat daemon and show that the imposed overhead is minimal as the price of seamless failover. Our prototype implementation consists of a kernel module for Linux 2.6 without any changes to the existing kernel code.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133454679","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 consider the problem of propagating an update to nodes in a distributed system using two gossiping protocols. The first is an idealized algorithm with static and dynamic knowledge of the system, and the second is a simple randomized algorithm. We construct a theoretical model that allows us to derive work and completion time statistics under varying transmission delay distributions. Numerical results are obtained for both exponential and nonexponential transmission times using linear-algebraic queueing theory techniques. Additionally, we present the results of simulation experiments showing that under node churn assumptions, the randomized algorithm's performance is qualitatively different than in a fault-free system.
{"title":"A Performance Model of Gossip-Based Update Propagation","authors":"Imad Antonios, R. Dhar, Feng Zhang, L. Lipsky","doi":"10.1109/NCA.2010.23","DOIUrl":"https://doi.org/10.1109/NCA.2010.23","url":null,"abstract":"We consider the problem of propagating an update to nodes in a distributed system using two gossiping protocols. The first is an idealized algorithm with static and dynamic knowledge of the system, and the second is a simple randomized algorithm. We construct a theoretical model that allows us to derive work and completion time statistics under varying transmission delay distributions. Numerical results are obtained for both exponential and nonexponential transmission times using linear-algebraic queueing theory techniques. Additionally, we present the results of simulation experiments showing that under node churn assumptions, the randomized algorithm's performance is qualitatively different than in a fault-free system.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114227347","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}
Recent experimental studies have revealed that a large percentage of wireless links are lossy and unreliable for data delivery in wireless sensor networks (WSNs). Such findings raise new challenges for the design of clustering algorithms in WSNs in terms of data reliability and energy efficiency. In this paper, we propose distributed clustering algorithms for WSNs by taking into account of the lossy nature of wireless links. We first formulate the one-hop clustering problem that maintains reliability as well as saves energy into an integer program and prove its NP-hardness. We then propose a metricbased distributed clustering algorithm to solve the problem. We adopt a metric called selection weight for each sensor node that can indicate both link qualities around the node and its capability of being a cluster head. We further extend the algorithm to multi-hop clustering to achieve better scalability. Extensive simulations have been conducted under a realistic link model and the results demonstrate that the proposed clustering algorithm can reduce the total energy consumption in the network and prolong network lifetime significantly compared to a typical distributed clustering algorithm, HEED, that does not consider lossy links.
{"title":"Distributed Clustering Algorithms for Lossy Wireless Sensor Networks","authors":"Zhexi Pan, Yuanyuan Yang, Dawei Gong","doi":"10.1109/NCA.2010.12","DOIUrl":"https://doi.org/10.1109/NCA.2010.12","url":null,"abstract":"Recent experimental studies have revealed that a large percentage of wireless links are lossy and unreliable for data delivery in wireless sensor networks (WSNs). Such findings raise new challenges for the design of clustering algorithms in WSNs in terms of data reliability and energy efficiency. In this paper, we propose distributed clustering algorithms for WSNs by taking into account of the lossy nature of wireless links. We first formulate the one-hop clustering problem that maintains reliability as well as saves energy into an integer program and prove its NP-hardness. We then propose a metricbased distributed clustering algorithm to solve the problem. We adopt a metric called selection weight for each sensor node that can indicate both link qualities around the node and its capability of being a cluster head. We further extend the algorithm to multi-hop clustering to achieve better scalability. Extensive simulations have been conducted under a realistic link model and the results demonstrate that the proposed clustering algorithm can reduce the total energy consumption in the network and prolong network lifetime significantly compared to a typical distributed clustering algorithm, HEED, that does not consider lossy links.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114882111","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}
Transfering the paradigm of service-oriented architecture (SOA) to sensor networks became an important research area in the last years. Amongst others, a couple of approaches deal with the flexible and robust service discovery and usage of services which takes the unsteady nature of WSNs into account. However, the approaches do not consider the case that services may get unavailable during their activity phase because of node failures. In this case, already collected or computed data will get lost and the service request of the service consumer remains unanswered. In this paper, we propose a redundancy infrastructure for service-oriented WSNs which deals with this special problem. The framework consists of an adaptive data replication technique and a service recovery solution. Whereas the replication technique ensures the survival beyond node failures, the recovery protocol restarts a failed service using the replicated data and enables the service to continue its functionality.
{"title":"Redundancy Infrastructure for Service-Oriented Wireless Sensor Networks","authors":"Jana Neumann, N. Hoeller, C. Reinke, V. Linnemann","doi":"10.1109/NCA.2010.50","DOIUrl":"https://doi.org/10.1109/NCA.2010.50","url":null,"abstract":"Transfering the paradigm of service-oriented architecture (SOA) to sensor networks became an important research area in the last years. Amongst others, a couple of approaches deal with the flexible and robust service discovery and usage of services which takes the unsteady nature of WSNs into account. However, the approaches do not consider the case that services may get unavailable during their activity phase because of node failures. In this case, already collected or computed data will get lost and the service request of the service consumer remains unanswered. In this paper, we propose a redundancy infrastructure for service-oriented WSNs which deals with this special problem. The framework consists of an adaptive data replication technique and a service recovery solution. Whereas the replication technique ensures the survival beyond node failures, the recovery protocol restarts a failed service using the replicated data and enables the service to continue its functionality.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116004378","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
扫码关注我们
求助内容：
应助结果提醒方式：