Research on Reconfigurable Network Model with Finite State Analysis

Article Preview

Abstract:

The paper aims to develop an updated network system reconfigurable model based on the Finite State Automation. Firstly, the paper reviews the concept of reconfigurable network systems and reveals its robustness, evolution and the basic attributes of survivability.Then the system robust behavior, evolution behavior and survival behavior are described with a hierarchical model. Secondly, the study builds the quantitative reconfigurable metric with network topology reconfigurable measurement example. Finally, the result of experiments shows that the proposed reconfigurable quantitative indicator of reconfigurable resistance model suggests that the network is an efficient reconfigurable network topology, which can effectively adapt the dynamic changes in the environment.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3213-3217

Citation:

Online since:

August 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Zhang P, Zeng Z. A framework for personalized service website based on TAM[C]. Troyes, France: Inst. of Elec. and Elec. Eng. Computer Society, 2007, 1598-1603.

Google Scholar

[2] Liu J, Stolyar A L, Chiang M, et al. Queue back-pressure random access in multihop wireless networks: Optimality and stability[J]. IEEE Transactions on Information Theory, 2009, 55(9): 4087-4098.

DOI: 10.1109/tit.2009.2025563

Google Scholar

[3] Alghothami A, Kammuller F. Network information flow control: Proof of concept[C]. Manchester, United kingdom: IEEE Computer Society, 2013, 2957-2962.

DOI: 10.1109/smc.2013.504

Google Scholar

[4] Dostal M, Eichler Z. Fine-grained adaptive user interface for personalization of a word processor: Principles and a preliminary study[C]. Orlando, FL, United states: Springer Verlag, 2011, 496-500.

DOI: 10.1007/978-3-642-22098-2_99

Google Scholar

[5] Hu Y, Li F, Liu X. Network coding based link scheduling for QoS provisioning in multi-radio and multi-channel wireless mesh networks [J]. 2012, 7(12): 899-908.

DOI: 10.4304/jcm.7.12.899-908

Google Scholar

[6] Yang B, Yang C, Yu Y, et al. A secure scalar product protocol and its applications to computational geometry [J]. Journal of Computers, 2013, 8(8): 2018-(2026).

Google Scholar

[7] Ronasi K, Wong V W S, Gopalakrishnan S. Distributed scheduling in multihop wireless networks with maxmin fairness provisioning [J]. IEEE Transactions on Wireless Communications, 2012, 11(5): 1753-1763.

DOI: 10.1109/twc.2012.030812.110493

Google Scholar

[8] Zhou B, Zhu R, Zhang Y, et al. An efficient data fingerprint query algorithm based on two-leveled bloom filter [J]. Journal of Multimedia, 2013, 8(2): 73-81.

DOI: 10.4304/jmm.8.2.73-81

Google Scholar

[9] Ahlswede R, Cai N, Li S R, et al. Network information flow [J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1216.

DOI: 10.1109/18.850663

Google Scholar

[10] Matsuda T, Noguchi T, Takine T. Survey of network coding and its applications [J]. IEICE Transactions on Communications, 2011, E94-B(3): 698-717.

DOI: 10.1587/transcom.e94.b.698

Google Scholar