Notes on Scalability of Wireless Ad Hoc Networks
draft-irtf-ans-scalability-notes-01
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Onur Arpacioglu | ||
| Last updated | 2003-10-28 | ||
| RFC stream | Internet Research Task Force (IRTF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | IRTF state | (None) | |
| Consensus boilerplate | Unknown | ||
| Document shepherd | (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
This document provides a working definition of 'absolute scalability' and 'weak scalability' of a method of an ad hoc network, and also a way of comparing the scalability of two different methods. A method may be a protocol, an algorithm, or a scheme whose scalability needs to be evaluated. For example, it may be a routing protocol or a MAC protocol. 'Absolute scalability' emphasizes the asymptotic behavior of a set of metrics, which define the efficiency of the network as a network parameter tends to infinity. 'Weak scalability' refers to the comparison of the metrics over a given range. Finally, fairness in the comparison of these metrics is discussed.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)