Efficient shortest path routing algorithms for distributed XML processing

Ye Longjian, Hiroshi Koide, Dirceu Cavendish, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationWEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies
EditorsAlessandro Bozzon, Francisco Jose Dominguez Mayo, Joaquim Filipe
PublisherSciTePress
Pages265-272
Number of pages8
ISBN (Electronic)9789897583865
Publication statusPublished - Jan 1 2019
Event15th International Conference on Web Information Systems and Technologies, WEBIST 2019 - Vienna, Austria
Duration: Sep 18 2019Sep 20 2019

Publication series

NameWEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies

Conference

Conference15th International Conference on Web Information Systems and Technologies, WEBIST 2019
CountryAustria
CityVienna
Period9/18/199/20/19

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Efficient shortest path routing algorithms for distributed XML processing'. Together they form a unique fingerprint.

Cite this