O(n**2) Investigations
draft-hummel-mpls-n-square-investigations-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Heinrich K. Hummel , Bernd Hoffmann | ||
| Last updated | 2002-06-19 | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
The O(n**2) problem is a well-known problem which occurs when overlay network models are used, e.g. for building vpns. This draft compares four different methods as to accomplish an effective full mesh connectivity and shows precisely the amount of resource consumption in each case - i.e. the consumption of states and labels.
Authors
Heinrich K. Hummel
Bernd Hoffmann
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)