Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Scalable message routing for mobile software assistants

Authors

[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] employee

Year of publication

2006

Chapter type

paper

Publication language

english

Keywords
EN
  • mobile agents
  • distributed computing
  • protocols
  • middleware
  • P2P
Abstract

EN In this paper we define an algorithm for location-independent communication of mobile software Personal Assistants (PAs). The algorithm extends the Query Server with Caching algorithm that we proposed earlier, with support of message routing in the wide-area networks. Our algorithm is suitable for two kinds of PAs collaboration: (1) within a local group of mobile individuals, who can communicate frequently using different computers connected to a local-area network (possibly via a wireless medium), and (2) some individuals may also communicate via the global network and move to other groups.

Pages (from - to)

355 - 364

DOI

10.1007/11802167_37

URL

https://link.springer.com/chapter/10.1007/11802167_37

Book

Embedded and Ubiquitous Computing. International Conference, EUC 2006, Seoul, Korea, August 1-4, 2006. Proceedings

Presented on

International Conference on Embedded and Ubiquitous Computing, EUC 2006, 1-4.08.2006, Seoul, Republic of Korea

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.