{"title":"A scalable location tracking and message delivery scheme for mobile agents","authors":"Sashi Lazar, I. Weerakoon, D. Sidhu","doi":"10.1109/ENABL.1998.725700","DOIUrl":null,"url":null,"abstract":"We present a novel scheme to implement reliable message delivery, agent migration, and agent location tracking for mobile agent based systems. This scheme requires that the agents and messages are transmitted through an imposed logical tree-shaped hierarchy of runtime servers. We present the procedures for building and maintaining the domain gateway hierarchy. Using this scheme, the cost of locating an agent is asymptotically bound by O(lg n) on the number of hops, while the agent registration is achieved at no additional cost.","PeriodicalId":321059,"journal":{"name":"Proceedings Seventh IEEE International Workshop on Enabling Technologies: Infrastucture for Collaborative Enterprises (WET ICE '98) (Cat. No.98TB100253)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Seventh IEEE International Workshop on Enabling Technologies: Infrastucture for Collaborative Enterprises (WET ICE '98) (Cat. No.98TB100253)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ENABL.1998.725700","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 41
Abstract
We present a novel scheme to implement reliable message delivery, agent migration, and agent location tracking for mobile agent based systems. This scheme requires that the agents and messages are transmitted through an imposed logical tree-shaped hierarchy of runtime servers. We present the procedures for building and maintaining the domain gateway hierarchy. Using this scheme, the cost of locating an agent is asymptotically bound by O(lg n) on the number of hops, while the agent registration is achieved at no additional cost.