Download now Free registration required
The stability and the predictability of a computer network algorithm's performance are as important as the main functional purpose of networking software. However, asserting or deriving such properties from the finite state machine implementations of protocols is hard and, except for singular cases like TCP, is not done today. In this paper, the authors propose to design and study run-time environments for networking protocols which inherently enforce desirable, predictable global dynamics. To this end they merge two complementary design approaches: a design-time and bottom up approach that enables them to engineer algorithms based on an analyzable (reaction) flow model and a run-time and top-down approach based on an autonomous stack composition framework, which switches among implementation alternatives to find optimal operation configurations.
- Format: PDF
- Size: 491.13 KB