Efficient Shortest Path Routing Algorithms for Distributed XML Processing

Ye Longjian, Hiroshi Koide, Dirceu Cavendish, Kouichi Sakurai

Abstract

This paper analyses the problem of efficiently routing XML documents on a network whose nodes are capable of distributed XML processing. The goal of our study is to find network paths for which XML documents’ transmission will result in high likelihood that a large portion of the documents be processed within the network, decreasing the amount of XML processing at documents arrival at the destination site. We propose several routing algorithms for single route and multipath routing and evaluate them on a distributed XML network simulation environment. We show the benefits of the proposed XML routing algorithms as compared with widespread minimum hop routing strategy of the Internet.

Download


Paper Citation