Abstract
In this paper we propose a simple powerful method to increase communication performance in large networks such as the Internet. Our approach is based on the usage multiple disjunct paths for the transmitting data from one node to another one. The method exploits the dense connectivity of the Internet by making use of the different routes engaged in communications originating from different nodes to one target nodes. We show that depending on the bandwidth offered and the amount of data to be transfered, a linear speedup can be achieved. An experimentalimpl ementation of the method within the WOS framework confirms the theoretical analysis of the method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. R. Ash. Dynamic Routing in Telecommunications Networks. McGraw Hill, New York, 1998.
G. Babin, P. Kropf, and H. Unger. A Two-Level Communication Protocol for a Web Operating System (WOS). In IEEE 24th Euromicro Workshop on Network Computing, pages 934–944, Sweden, 1998.
D. Bertsekas and R. Gallagher. Data Networks. Prentice Hall, Englewood Cliffs, NJ, 2nd edition, 1991.
J. T. Brassil, A. K. Choudhury, and N. F. Maxemchuk. The Manhattan Street Network: A High Performance, Highly Reliable Metropolitan Area Network. Computer Networks and ISDN Systems, 1994.
R. Buyya. High Performance Cluster Computing Vol 1. Prentice Hall, Upper Saddle River, NJ, 1999.
G. Hipper and D. Tavangarian. Evaluating the Communication Performance of Beowulf-and FastCNA-workstation clusters through Low-Level Communication Benchmarks. In SCS A. Tentner, editor, High Performance Computing, pages 271–276, Boston, 1998.
G. Hommel. Quality of Communication-Based Systems. In International Workshop on Quality of Communication-Based Systems, TU Berlin, Germany, 1994. Kluwer Academic Publishers.
G. Hunt. TCP/IP Network Administration, Second Edition. O’Reilly, Cambridge, 1998.
P. Kropf. Overview of the WOS Project. In SCS A. Tentner, editor, ASTC High Performance Computing, pages 350–356, San Diego, CA, 1999.
S. B. Lamine, J. Plaice, and P. Kropf. Problems of computing on the Web. In SCS A. Tentner, editor, High Performance Computing, pages 296–301, Atlanta, 1997.
M. Lyubic and C. Cap. Enhancing Internet Security Through Multiple Paths. In Distributed Computing on the Web (DCW’98), pages 55–60, Rostock, Germany, 1998.
J. Plaice and P. Kropf. Intensional Communities. In World Scientific Press, editor, Intensional Programming II, Singapore, 2000.
Y. Rekhter and T. Li. A Border Gateway Protocol 4 (BGP-4). RFC 1771, Mar. 1995. http://www.info.internet.isi.edu/in-notes/rfc/files/rfc1771.txt.
H. Unger. The Adaptive Warehouse Concept for the Resource Management in the WOS. In Distributed Computing on the Web (DCW), pages 167–174, Rostock, Germany, 1999.
H. Unger, P. Kropf, G. Babin, and T. Böhme. Simulation of search and distribution methods for jobs in a Operating System (WOS). In SCS A. Tentner, editor, ASTC High Performance Computing, pages 253–259, Boston, 1998.
B. M. Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9):1617–1622, 1988.
M. Wulff and H. Unger. Message Chains as a new Form of Active Communication in the WOSNet. In SCS A. Tentner, editor, ASTC High Performance Computing, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wulff, M., Kropf, P., Unger, H. (2000). Message Chains and Disjunct Paths for Increasing Communication Performance in Large Networks. In: Kropf, P.G., Babin, G., Plaice, J., Unger, H. (eds) Distributed Communities on the Web. DCW 2000. Lecture Notes in Computer Science, vol 1830. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45111-0_14
Download citation
DOI: https://doi.org/10.1007/3-540-45111-0_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67647-8
Online ISBN: 978-3-540-45111-2
eBook Packages: Springer Book Archive