1-2hit |
Yukio TSUKISHIMA Michiaki HAYASHI Tomohiro KUDOH Akira HIRANO Takahiro MIYAMOTO Atsuko TAKEFUSA Atsushi TANIGUCHI Shuichi OKAMOTO Hidemoto NAKADA Yasunori SAMESHIMA Hideaki TANAKA Fumihiro OKAZAKI Masahiko JINNO
Platforms of hosting services are expected to provide a virtual private computing infrastructure with guaranteed levels of performance to support each reservation request sent by a client. To enhance the performance of the computing infrastructure in responding to reservation requests, the platforms are required to reserve, coordinate, and control globally distributed computing and network resources across multiple domains. This paper proposes Grid Network Service -- Web Services Interface version 2 (GNS-WSI2). GNS-WSI2 is a resource-reservation messaging protocol that establishes a client-server relationship. A server is a kind of management system in the management plane, and it allocates available network resources within its own domain in response to each reservation request from a client. GNS-WSI2 has the ability to reserve network resources rapidly and reliably over multiple network domains. This paper also presents the results of feasibility tests on a transpacific testbed that validate GNS-WSI2 in terms of the scalable reservation of network resources over multiple network domains. In the tests, two computing infrastructures over multiple network domains are dynamically provided for scientific computing and remote-visualization applications. The applications are successfully executed on the provided infrastructures.
Atsushi TANIGUCHI Takeru INOUE Kohei MIZUNO Takashi KURIMOTO Atsuko TAKEFUSA Shigeo URUSHIDANI
Communication networks are now an essential infrastructure of society. Many services are constructed across multiple network domains. Therefore, the reliability of multi-domain networks should be evaluated to assess the sustainability of our society, but there is no known method for evaluating it. One reason is the high computation complexity; i.e., network reliability evaluation is known to be #P-complete, which has prevented the reliability evaluation of multi-domain networks. The other reason is intra-domain privacy; i.e., network providers never disclose the internal data required for reliability evaluation. This paper proposes a novel method that computes the lower and upper bounds of reliability in a distributed manner without requiring privacy disclosure. Our method is solidly based on graph theory, and is supported by a simple protocol that secures intra-domain privacy. Experiments on real datasets show that our method can successfully compute the reliability for 14-domain networks in one second. The reliability is bounded with reasonable errors; e.g., bound gaps are less than 0.1% for reliable networks.