Efficient Shortest Path Routing Algorithms for Distributed XML Processing

Ye Longjian, Hiroshi Koide, Dirceu Cavendish, Kouichi Sakurai

2019

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.

Paper Citation

in Harvard Style

Longjian Y., Koide H., Cavendish D. and Sakurai K. (2019). Efficient Shortest Path Routing Algorithms for Distributed XML Processing.In Proceedings of the 15th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-989-758-386-5, pages 265-272. DOI: 10.5220/0008162002650272

in Bibtex Style

@conference{webist19,
author={Ye Longjian and Hiroshi Koide and Dirceu Cavendish and Kouichi Sakurai},
title={Efficient Shortest Path Routing Algorithms for Distributed XML Processing},
booktitle={Proceedings of the 15th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2019},
pages={265-272},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0008162002650272},
isbn={978-989-758-386-5},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 15th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - Efficient Shortest Path Routing Algorithms for Distributed XML Processing
SN - 978-989-758-386-5
AU - Longjian Y.
AU - Koide H.
AU - Cavendish D.
AU - Sakurai K.
PY - 2019
SP - 265
EP - 272
DO - 10.5220/0008162002650272