A middleware for distributed system in heterogeneous wireless networks
20 Jul 2005-Vol. 2, pp 654-658
TL;DR: The proposed middleware satisfies the requirement of ubiquitous access of the resource in multilayer modular manner by hiding the platform heterogeneity.
Abstract: Ubiquitous access of the resource is the greatest challenge in the world of distributed mobile computing. This paper discusses the framework of agent based middleware to provide efficient, flexible and scalable system support for configuration and communication in heterogeneous wireless networks. The proposed middleware satisfies the requirement of ubiquitous access of the resource in multilayer modular manner by hiding the platform heterogeneity.
Citations
More filters
01 Dec 2007
TL;DR: A prediction based handover model for multiclass traffic in wireless mobile networks by using software agents, considering two cases, i.e., local handoff (between base station controllers connected to same mobile switching center (MSC) and global handoffs (between BSC's connected to different MSC).
Abstract: The critical period in cellular communication is the handoff execution, since data and connection may be lost if enough bandwidth is not available in the target cell Thus cellular wireless networks require an efficient handoff management scheme to cope up with frequent mobile node handoffs, connection breaks and rerouting This position paper proposes a prediction based handover model for multiclass traffic in wireless mobile networks by using software agents, considering two cases, ie, local handoff (between base station controllers (BSC's) connected to same mobile switching center (MSC)) and global handoff (between BSC's connected to different MSC) Local and global handoff decisions are made by agent in mobile node based on speed of mobile node, ie, for high speeds, global handoff is executed In local handoff, agents at a mobile node in cooperation with the agents in connected BSC predict the candidate set of BSC's for handoff within the same MSC coverage In global handoff, the candidate set of BSC's that belong to different MSC (neighbor MSC) are predicted The predictions are based upon the speed and moving direction of the mobile node The scheme predicts location and provides necessary information for advance bandwidth (resource) reservation and optimal route establishment
3 citations
Cites background from "A middleware for distributed system..."
...The middleware architecture and usage of agents to ease mobility aware service development is explained in [14] and [15]....
[...]
References
More filters
Book•
01 Jan 1988TL;DR: The fifth edition of this best-selling text continues to provide a comprehensive source of material on the principles and practice of distributed computer systems and the exciting new developments based on them, using a wealth of modern case studies to illustrate their design and development.
Abstract: Broad and up-to-date coverage of the principles and practice in the fast moving area of Distributed Systems. Distributed Systems provides students of computer science and engineering with the skills they will need to design and maintain software for distributed applications. It will also be invaluable to software engineers and systems designers wishing to understand new and future developments in the field. From mobile phones to the Internet, our lives depend increasingly on distributed systems linking computers and other devices together in a seamless and transparent way. The fifth edition of this best-selling text continues to provide a comprehensive source of material on the principles and practice of distributed computer systems and the exciting new developments based on them, using a wealth of modern case studies to illustrate their design and development. The depth of coverage will enable readers to evaluate existing distributed systems and design new ones.
2,406 citations
"A middleware for distributed system..." refers background in this paper
...The mobile computing is the best example of partially connected distributed computing....
[...]
[...]
01 Oct 1996
TL;DR: This document specifies protocol enhancements that allow transparent routing of IP datagrams to mobile nodes in the Internet.
Abstract: This document specifies protocol enhancements that allow transparent routing of IP datagrams to mobile nodes in the Internet. Each mobile node is always identified by its home address, regardless of its current point of attachment to the Internet. While situated away from its home, a mobile node is also associated with a care-of address, which provides information about its current point of attachment to the Internet. The protocol provides for registering the care-of address with a home agent. The home agent sends datagrams destined for the mobile node through a tunnel to the care- of address. After arriving at the end of the tunnel, each datagram is then delivered to the mobile node.
2,094 citations
TL;DR: This paper shows that disconnected operation is feasible, efficient and usable by describing its design and implementation in the Coda File System by showing that caching of data, now widely used for performance, can also be exploited to improve availability.
Abstract: Disconnected operation is a mode of operation that enables a client to continue accessing critical data during temporary failures of a shared data repository. An important, though not exclusive, application of disconnected operation is in supporting portable computers. In this paper, we show that disconnected operation is feasible, efficient and usable by describing its design and implementation in the Coda File System. The central idea behind our work is that caching of data, now widely used for performance, can also be exploited to improve availability.
1,214 citations
Proceedings Article•
01 May 1999
TL;DR: In this paper, the authors describe disconnected operation in the Coda File System and show that disconnected operation is feasible, efficient and usable by describing its design and implementation in Coda file system.
Abstract: Disconnected operation is a mode of operation that enables a client to continue accessing critical data during temporary failures of a shared data repository. An important, though not exclusive, application of disconnected operation is in supporting portable computers. In this paper, we show that disconnected operation is feasible, efficient and usable by describing its design and implementation in the Coda File System. The central idea behind our work is that caching of data, now widely used for performance, can also be exploited to improve availability.
1,144 citations
TL;DR: This work has implemented a vertical handoff system that allows users to roam between cells in wireless overlay networks and presents enhancements to the basic scheme that significantly reduce the discovery time without assuming any knowledge about specific channel characteristics.
Abstract: No single wireless network technology simultaneously provides a low latency, high bandwidth, wide area data service to a large number of mobile users. Wireless Overlay Networks – a hierarchical structure of room-size, building-size, and wide area data networks – solve the problem of providing network connectivity to a large number of mobile users in an efficient and scalable way. The specific topology of cells and the wide variety of network technologies that comprise wireless overlay networks present new problems that have not been encountered in previous cellular handoff systems. We have implemented a vertical handoff system that allows users to roam between cells in wireless overlay networks. Our goal is to provide a user with the best possible connectivity for as long as possible with a minimum of disruption during handoff. Results of our initial implementation show that the handoff latency is bounded by the discovery time, the amount of time before the mobile host discovers that it has moved into or out of a new wireless overlay. This discovery time is measured in seconds: large enough to disrupt reliable transport protocols such as TCP and introduce significant disruptions in continuous multimedia transmission. To efficiently support applications that cannot tolerate these disruptions, we present enhancements to the basic scheme that significantly reduce the discovery time without assuming any knowledge about specific channel characteristics. For handoffs between room-size and building-size overlays, these enhancements lead to a best-case handoff latency of approximately 170 ms with a 1.5% overhead in terms of network resources. For handoffs between building-size and wide-area data networks, the best-case handoff latency is approximately 800 ms with a similarly low overhead.
756 citations