Finite Automata for Evaluating Testbed Resource Contention

Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 44)


Next-generation Internet and wireless telecommunication networks compose a pervasive computing structure. Real large-scale tests, simulation and emulation are the major strategies to construct next generation testbed. Synchronization primitives are critical to ensure finite resource assesses. For performance load and utilization prediction, this research proposes a formal testbed abstraction and contention model grounded from automata theory. To conduct a configuration analysis, algorithm operations are exploited. In addition, an empirical testbed with self-organization, dynamic resource allocation, partition, virtualization, and scheduling is deliberated.


Finite Automaton User Land Contention State Dynamic Resource Allocation Interrupt Handler 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Canetti, et al. (2006). Time-bounded Task-PIOAs: A Framework for Analyzing Security Protocols. In the Proceedings of 20th International Symposium on Distributed ComputingGoogle Scholar
  2. 2.
    Cantrill, B.M., Shapiro, M.W., Leventhal, A.H. (2004). In the Proceedings of USENIX Annual Technical ConferenceGoogle Scholar
  3. 3.
    Ishizu, et al. (2006). Adaptive Wireless-network Testbed for Cognitive Radio Technology. In the Proceedings of the 1st international workshop on Wireless Network Testbeds, Experimental Evaluation & Characterization.Google Scholar
  4. 4.
    Law, A.M., Kelton, W.D. (2000). Simulation Modeling and Techniques. 3rd ed. McGraw-Hill, New York.Google Scholar
  5. 5.
    Liu, X., Chien, A.A. (2003). Traffic-based Load Balance for Scalable Network Emulation. In the Proceedings of the ACM/IEEE Conference on Supercomputing.Google Scholar
  6. 6.
    Lundgren, et al. (2002). A Large-scale Testbed for Reproducible Ad hoc Protocol Evaluations. In the Proceedings of Wireless Communications and Networking Conference.Google Scholar
  7. 7.
    Shannon, C.E., McCarthy, J. (1956). Automata Studies. Princeton University Press, NJ.MATHGoogle Scholar
  8. 8.
    Stonebrake, M. (1981). Operating System Support for Database Management. Communications of the ACM, 24(7), 412–418.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.CAUSA

Personalised recommendations