Research on the Synchronous Resource Selection Algorithm in Networks

JIANG Zong-li; XU Bin-bin

doi:10.3969/j.issn.0254-0037.2005.04.002

Journal of Beijing University of Technology > 2005 > 31(4): 342-347. > DOI: 10.3969/j.issn.0254-0037.2005.04.002

JIANG Zong-li, XU Bin-bin. Research on the Synchronous Resource Selection Algorithm in Networks[J]. Journal of Beijing University of Technology, 2005, 31(4): 342-347. DOI: 10.3969/j.issn.0254-0037.2005.04.002

Citation:

PDF (188 KB)

Research on the Synchronous Resource Selection Algorithm in Networks

College of Computer Science, Beijing University of Technology, Beijing 100022, China

More Information

Received Date: October 29, 2004
Available Online: November 21, 2022

Graphical Abstract

Abstract

Abstract

In the large scale network, a logical synchronous network should be setup automatically at running time in order to synchronize the clocks of the nodes. To put nodes into logical synchronous network properly, a efficient synchronous resource should be selected. The nodes' clocks precision, stability, capability, realtime loads, and the structure of the network are key aspects for selecting synchronous resources. Strategy Based Synchronous Resource Selection Algorithm (abbreviated as SS) makes its decision by measuring the real-time performance of the nodes and the given stratum. The experiments show that SS can select the proper resource providers from the intended candidates and has better porformance than the usual FIFS algorithm.
- network,
- synchronous resource,
- selection algorithm

FullText(HTML)

References (16)

References

[1]	包秀国,胡铭曾,张宏莉,等.一种自组织时间同步网[J].通信学报,2004,25(1):150-157. BAO Xiu-guo, HU Ming-zeng, ZHANG Hong-li, et al. A self-organizing timekeeping network[J]. Journal of China Institute of Communications, 2004, 25(1):150-157. (in Chinese)
[2]	JIANG Zong-li, XU Bin-bin. Automatic configuration in NTP[J]. High Technology Letter, 2003, 9(4):70-73.
[3]	ALBERT R, BARABASI A L. Statistical mechanics of complex networks[J]. Rev Mod Phys, 2002, 74:47-97.
[4]	DOROGOVTSEV S N, MENDESJ F F. Evolution of networks[J]. Advanced Phys, 2002, 51:1079-1187.
[5]	STROGATZ S H. Exploring complex networks[J]. Nature, 2001, 410:268-276.
[6]	RAMEZANPOUR A, KARIMIPOUR V. Simple models of small-world networks with directed links[J]. Phys Rev, 2002, E66 036128:1-15.
[7]	BARABASI A L, DEZSO Z, RAVASZ E, et al. Scale-free and Hierarchical Structures in Complex Net works[EB/OL]. http://www.nd.edu/-networks/papers.htm, 2002-11-25/2004-11-10.
[8]	HUBERMAN B A, ADAMIC L A. Growth dynamics of the world-wide web[J]. Nature, 1999, 406:450-457.
[9]	BROADER A Z, KUMAR S R, MAGHOUL F, et al. Graph structure in the web WWW9[J]. Computer Networks, 2000, 33(1-6):309-320.
[10]	YOOKSH, JEONGH, BARABASI A L. Modeling the internet's large-scale topology[J]. PNAS, 2002, 99:13382-13386.
[11]	FALOUTSOS M, FALOUTSOS P, FALOUTSOS C. On power-law relationships of the internet topology[J]. Comput Commun Rev, 1999, 29:251-260.
[12]	ALBERT R, JEONG H, BARABASI A L. Error and attack tolerance of complex networks[J]. Nature, 2000, 406:378-382.
[13]	HOLME P, KIMBJ, YOON C N, etal. Attack vulnerability of complex networks[J]. Phys Rev, 2002, E65 056109:1-14.
[14]	ADAMICL, LUKOSE R, PUNIYANI A, et al. Search in power-law networks[J]. Phys Rev, 2001, E64 46135:1-8.
[15]	YANG B, GARCIA-MOLINA H. Comparing hybrid peer-to-peer systems[A]. Proc of the 27th Intl Conf on Very Large Databases[C]. San Francisco:Morgan Kaufmann Publishers Inc, 2001. 561-570.
[16]	BAGRODIA R, MEYER R, TAKAI M, et al. Parsec:A parallel simulation environment for complex systems[J]. Computer, 1998, 31(10):77-85.

Cited By

Get Citation

PDF

XML

Article views (10) PDF downloads (5)

Turn off MathJax

Article Contents

Abstract

References

Research on the Synchronous Resource Selection Algorithm in Networks

Abstract

References

Catalog

Export File

Citation

Format

Content