Finite automata for evaluating testbed resource contention

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, virtual- ization and scheduling is deliberated.