Abstract
For network service, it is obvious that “PUSH” method is more efficient than “PULL” method for bandwidth consuming. One problem for “PUSH” method is that the client is difficult to keep track with the status of server. Traditional polling method is bandwidth consuming and put much burden on server. Active link is an active network based service which builds a tree structure between clients and server. Different clients and service can share link information if they have the same middle nodes in the link path. This mechanism can reduce bandwidth consumption and burden of server.
This paper is supported by the Nation Science Foundation of China (No.60173059).
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
Tennenhouse, D.L., Smith, J.M., Sincoskie, W.D., et al.: A Survey of Active Network Research. IEEE Communication Magazine 35(1), 80–86 (1997)
Wetheral, D.: Active Network Vision and Reality: Lesson from a capsule-based system. In: Proceedings of 17th ACM Symposium on Operating Systems Principles (SOSP 1999) (December 1999)
Wetheral, D.: Service Introduction in Active Networks. PhD Thesis, Massachusetts Institute of Technology (April 1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tao, Z., Xingshe, Z., Zhigang, L., Yan, C. (2005). Active Link: Status Detection Mechanism for Distributed Service Based on Active Networks. In: Hobbs, M., Goscinski, A.M., Zhou, W. (eds) Distributed and Parallel Computing. ICA3PP 2005. Lecture Notes in Computer Science, vol 3719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564621_39
Download citation
DOI: https://doi.org/10.1007/11564621_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29235-7
Online ISBN: 978-3-540-32071-5
eBook Packages: Computer ScienceComputer Science (R0)