Efficient shortest path routing algorithms for distributed XML processing

Ye Longjian, Hiroshi Koide, Dirceu Cavendish, Kouichi Sakurai

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

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.

元の言語英語
ホスト出版物のタイトルWEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies
編集者Alessandro Bozzon, Francisco Jose Dominguez Mayo, Joaquim Filipe
出版者SciTePress
ページ265-272
ページ数8
ISBN(電子版)9789897583865
出版物ステータス出版済み - 1 1 2019
イベント15th International Conference on Web Information Systems and Technologies, WEBIST 2019 - Vienna, オーストリア
継続期間: 9 18 20199 20 2019

出版物シリーズ

名前WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies

会議

会議15th International Conference on Web Information Systems and Technologies, WEBIST 2019
オーストリア
Vienna
期間9/18/199/20/19

Fingerprint

Routing algorithms
XML
Processing
Internet

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications

これを引用

Longjian, Y., Koide, H., Cavendish, D., & Sakurai, K. (2019). Efficient shortest path routing algorithms for distributed XML processing. : A. Bozzon, F. J. D. Mayo, & J. Filipe (版), WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies (pp. 265-272). (WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies). SciTePress.

Efficient shortest path routing algorithms for distributed XML processing. / Longjian, Ye; Koide, Hiroshi; Cavendish, Dirceu; Sakurai, Kouichi.

WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies. 版 / Alessandro Bozzon; Francisco Jose Dominguez Mayo; Joaquim Filipe. SciTePress, 2019. p. 265-272 (WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies).

研究成果: 著書/レポートタイプへの貢献会議での発言

Longjian, Y, Koide, H, Cavendish, D & Sakurai, K 2019, Efficient shortest path routing algorithms for distributed XML processing. : A Bozzon, FJD Mayo & J Filipe (版), WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies. WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies, SciTePress, pp. 265-272, 15th International Conference on Web Information Systems and Technologies, WEBIST 2019, Vienna, オーストリア, 9/18/19.
Longjian Y, Koide H, Cavendish D, Sakurai K. Efficient shortest path routing algorithms for distributed XML processing. : Bozzon A, Mayo FJD, Filipe J, 編集者, WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies. SciTePress. 2019. p. 265-272. (WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies).
Longjian, Ye ; Koide, Hiroshi ; Cavendish, Dirceu ; Sakurai, Kouichi. / Efficient shortest path routing algorithms for distributed XML processing. WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies. 編集者 / Alessandro Bozzon ; Francisco Jose Dominguez Mayo ; Joaquim Filipe. SciTePress, 2019. pp. 265-272 (WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies).
@inproceedings{188e6a37f9ed4748b01d6ec9d79ad7d8,
title = "Efficient shortest path routing algorithms for distributed XML processing",
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.",
author = "Ye Longjian and Hiroshi Koide and Dirceu Cavendish and Kouichi Sakurai",
year = "2019",
month = "1",
day = "1",
language = "English",
series = "WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies",
publisher = "SciTePress",
pages = "265--272",
editor = "Alessandro Bozzon and Mayo, {Francisco Jose Dominguez} and Joaquim Filipe",
booktitle = "WEBIST 2019 - Proceedings of the 15th International Conference on Web Information Systems and Technologies",

}

TY - GEN

T1 - Efficient shortest path routing algorithms for distributed XML processing

AU - Longjian, Ye

AU - Koide, Hiroshi

AU - Cavendish, Dirceu

AU - Sakurai, Kouichi

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85074250735&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85074250735&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85074250735

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

SP - 265

EP - 272

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

A2 - Bozzon, Alessandro

A2 - Mayo, Francisco Jose Dominguez

A2 - Filipe, Joaquim

PB - SciTePress

ER -