Scalable Integrated Services Architecture For Computer Networks
University of California System: University of California, Santa Cruz
posted on 09/16/2011
Real-time multimedia applications require strict delay and bandwidth guarantees. A network can provide such deterministic guarantees to an application only if it reserves the required bandwidth and other resources. Based on this reservation paradigm, the Internet Engineering Task Force (IETF) proposed the Intserv architecture and the RSVP signaling protocol. A major concern with Intserv/RSVP architecture is that the soft-state mechanism it uses to maintain consistency of reservation state may not be scalable to high-speed backbone networks. The refresh messages (apart from consuming memory, processing power, and bandwidth) can experience significant queuing delays and prevent correct functioning of the soft-state mechanism because of the large number of flows. For the refresh mechanism to scale, the reservation state size must be eliminated or drastically reduced.
Suggested Uses
REFER ALSO TO UC CASES 2000-311, 2000-314, 2000-349 THROUGH 356, 2000-360, 2000-380, 2000-383 THROUGH 385
Advantages
The new University of California architecture acts as a middle ground between the stateful Intserv and a recently published stateless architecture (SCORE). The novel architecture is scalable while providing delays similar to the Intserv architecture.
Detailed Description
Scientists at the University of California have developed a new scalable services architecture for computer networks where the per-flow reservation state in the routers is replaced with a small, bounded aggregate state. The size of the aggregate state and the complexity of the refresh mechanism are determined by network parameters, such as size and class, rather than number of end-user flows. The new architecture incorporates a “shaper-battery” (a set of token-buckets arranged in the form of a tree) for aggregating flows into classes, which are defined using the newly developed notion of “burst-drain-time” or “burst ratio”. The consistency of aggregate reservations is maintained using AGRE, the first reservation protocol to use diffusing computations for this purpose.
File Number: 10180
| Patent Number(s): | 7027449 |
|---|---|
| Copyright: | ©2009-2011, The Regents of the University of California |
This innovation currently is not available for online licensing. Please contact University of California, Santa Cruz Office for Management of Intellectual Property at University of California System: University of California, Santa Cruz for more information.
Find more innovations
