TY - GEN
T1 - Self-routing in pervasive computing environments using smart messages
AU - Borcea, Cristian
AU - Intanagonwiwat, Chalermek
AU - Saxena, Akhilesh
AU - Iftode, Liviu
PY - 2003
Y1 - 2003
N2 - Smart Messages (SMs) are dynamic collections of code and data that migrate to nodes of interest in the network and execute on these nodes. A key challenge in programming pervasive computing environments using SMs is the ability to route SMs to nodes named by content. This paper describes the SM self-routing mechanism, which allows SMs to route themselves at each hop in the path toward a node of interest. SM applicationscan choose among multiple content-based routing algorithms, switch dynamically the routing algorithm in use, or even implement the best suited routing algorithm for their needs. The main benefits provided by self-routing are high flexibility and resilience to adverse network conditions. To demonstrate these benefits, we present proof-of-concept implementation, simulation results, and analysis for the SM self-routing mechanism using several content-based routing algorithms. We also show preliminary results for SM routing algorithms executed over our SM prototype implementation.
AB - Smart Messages (SMs) are dynamic collections of code and data that migrate to nodes of interest in the network and execute on these nodes. A key challenge in programming pervasive computing environments using SMs is the ability to route SMs to nodes named by content. This paper describes the SM self-routing mechanism, which allows SMs to route themselves at each hop in the path toward a node of interest. SM applicationscan choose among multiple content-based routing algorithms, switch dynamically the routing algorithm in use, or even implement the best suited routing algorithm for their needs. The main benefits provided by self-routing are high flexibility and resilience to adverse network conditions. To demonstrate these benefits, we present proof-of-concept implementation, simulation results, and analysis for the SM self-routing mechanism using several content-based routing algorithms. We also show preliminary results for SM routing algorithms executed over our SM prototype implementation.
UR - https://www.scopus.com/pages/publications/2442620464
UR - https://www.scopus.com/pages/publications/2442620464#tab=citedBy
U2 - 10.1109/PERCOM.2003.1192730
DO - 10.1109/PERCOM.2003.1192730
M3 - Conference contribution
AN - SCOPUS:2442620464
SN - 0769518931
T3 - Proceedings of the 1st IEEE International Conference on Pervasive Computing and Communications, PerCom 2003
SP - 87
EP - 96
BT - Proceedings of the 1st IEEE International Conference on Pervasive Computing and Communications, PerCom 2003
PB - IEEE Computer Society
T2 - 1st IEEE International Conference on Pervasive Computing and Communications, PerCom 2003
Y2 - 23 March 2003 through 26 March 2003
ER -