PerSON: a framework for service overlay network in pervasive environments
17 Dec 2007-pp 671-682
TL;DR: A lightweight framework, PerSON (Service Overlay Network for Pervasive Environments), to abstract the details of service provision and utilization in a pervasive environment and provides the overlay network for the earlier developed middleware for pervasive computing.
Abstract: With the increase in the number of mobile devices and their network capabilities, users expect transparent access to available services in their pervasive environment. However, heterogeneity and interoperability issues persist in existing mechanisms. In this paper, we present a lightweight framework, PerSON (Service Overlay Network for Pervasive Environments), to abstract the details of service provision and utilization in a pervasive environment. PerSON constructs an ad hoc service overlay network in the pervasive environment based on service requests. PerSON achieves high efficiency by combining service discovery with route discovery. PerSON is especially suitable for resource constrained devices as minimal information about discovered services and the neighboring devices is maintained. In particular, the proposed framework provides the overlay network for the earlier developed middleware for pervasive computing. We also describe the implementation of a prototype for emergency response system (ERS).
Citations
More filters
22 Jun 2011
TL;DR: This work considers potential local and remote content sources and destination devices, with similarity, user preferences and environment capabilities to determine fitness, to determine the best possible media services considering all instances.
Abstract: The motivation for the virtual device is to facilitate the seamless use of application services residing on different devices in the vicinity of the user. Due to heterogeneity of devices in the user’s pervasive environment, multiple potential combinations to support a required task may exist. This work aims to determine the best possible media services considering all instances. The best services are selected and composed to satisfy a user task. Recent works propose using user preferences, environment capabilities and similarity between requested and available services to determine service fitness. We consider potential local and remote content sources and destination devices, with similarity, user preferences and environment capabilities to determine fitness. Services are selected for composition based on fitness. We model and simulate this issue and explain the results of our experimentation. Optimal multimedia service composition from varying devices provides the user with the best possible multimedia consumption and production experience.
2 citations
Cites background from "PerSON: a framework for service ove..."
...[22][23][24] propose different approaches for connecting devices in pervasive environments....
[...]
05 Sep 2011
TL;DR: The end-to-end delay of a service instance is important to consider as it directly affects the interactivity of the system and this work model and simulate this issue and explain the results of the experimentation.
Abstract: The virtual device enables seamless use of application services residing on different devices in the vicinity of the user In a pervasive environment, numerous service combinations can be selected to undertake a task Current works aim to determine the best possible media services for composition by considering user preferences, environment capabilities and similarity between requested and available services Previously, the authors considered all of above as well as potential local and remote content sources and destination devices Here this is extended by considering end-to-end service latency to determine service fitness The end-to-end delay of a service instance is important to consider as it directly affects the interactivity of the system Services are selected for composition based on our fitness model We model and simulate this issue and explain the results of our experimentation
17 Sep 2007
Cites background or methods from "PerSON: a framework for service ove..."
...SeSCo is implemented over an existing implementation of PICO over a lightweight framework, Service Overlay Network for Pervasive Environments (PerSON) [14]....
[...]
...2 Some service discovery mechanisms, for example the discovery mechanism used in Bluetooth [5, 14, 18] try to find an exact match for the required service, but there might not always be an exact match in the environment....
[...]
...PerSON constructs an overlay network based on service provisioning [14]....
[...]
...2 Some service discovery mechanisms, for example the discovery mechanism used in Bluetooth [5, 14, 18] try to find an exact match for the required service, but there might not always be an exact match in the environment....
[...]
...11 Some wireless service discovery schemes are limited by the range in which they can operate; for instance, Bluetooth has a range of 10m....
[...]
References
More filters
27 Aug 2001
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Abstract: A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data item pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
10,286 citations
TL;DR: Consider writing, perhaps the first information technology: The ability to capture a symbolic representation of spoken language for long-term storage freed information from the limits of individual memory.
Abstract: Specialized elements of hardware and software, connected by wires, radio waves and infrared, will soon be so ubiquitous that no-one will notice their presence.
9,073 citations
TL;DR: Pastry as mentioned in this paper is a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications, which performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet.
Abstract: This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications. Pastry performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet. It can be used to support a variety of peer-to-peer applications, including global data storage, data sharing, group communication and naming. Each node in the Pastry network has a unique identifier (nodeId). When presented with a message and a key, a Pastry node efficiently routes the message to the node with a nodeId that is numerically closest to the key, among all currently live Pastry nodes. Each Pastry node keeps track of its immediate neighbors in the nodeId space, and notifies applications of new node arrivals, node failures and recoveries. Pastry takes into account network locality; it seeks to minimize the distance messages travel, according to a to scalar proximity metric like the number of IP routing hops. Pastry is completely decentralized, scalable, and self-organizing; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.
7,423 citations
27 Aug 2001
TL;DR: The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
Abstract: Hash tables - which map "keys" onto "values" - are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales. The CAN is scalable, fault-tolerant and completely self-organizing, and we demonstrate its scalability, robustness and low-latency properties through simulation.
6,703 citations
TL;DR: Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
Abstract: A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
3,518 citations
"PerSON: a framework for service ove..." refers methods in this paper
...Content Addressable Network (CAN) [10], Chord [11] and Pastry [12] organize the overlay network based on the content attributes to optimize the search....
[...]