Subspace Methods for Network Resource Reservation Coding Processes

This paper presents a mathematical framework for resource reservation in TCP/IP networks by invoking a dynamic system viewpoint on the congestion monitoring processes occurring along the network paths. The main issue is the modeling of a coding scheme of resource reservation where the resource tracking process is equivalently performing a congestion monitoring at each node so that we can distinguish a set of congestion regimes. In accounting for the congestion control responsiveness and robustness aspects, a Lyapunov theoretic argument is invoked. Subspace methods are used in modeling the resource monitoring and reservation along the network paths.