A location transparent and cost effective routing algorithm for mobile componentware interaction and coordination
Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2002)
Phoenix, AZ, USA
Apr. 3, 2002 to Apr. 5, 2002
J.X. Ci , Comput. Sci. & Eng. Dept., Minnesota Univ., Minneapolis, MN, USA
As communication and computing entities such as computer hosts, componentware, network services, and software agents are becoming decentralized, peer-to-peer, dynamic and mobile, these entities ought to be treated as mobile and virtual, instead of physical only. This paper presents a location transparent and cost effective naming and routing algorithm for coordinating and interacting mobile componentware. With location transparency through this routing and naming method, any physical wiring, connections, and inevitable changes among hosts and network configurations are encapsulated. Location transparent routing reduces the burden on keeping track of mobile componentware entities' physical trail. The primitive test result affirms the algorithm's promise.
J. Ci and W. Tsai, "A location transparent and cost effective routing algorithm for mobile componentware interaction and coordination," Performance, Computing, and Communications Conference, 2002. 21st IEEE International(PCC), Phoenix, AZ, USA, 2002, pp. 347-351.