A Performance Analysis of P2P Routing along a DAG in LLNs
draft-goyal-roll-p2p-performance-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Emmanuel Baccelli , Mukul Goyal , Ted Humpal , Yusuf Bashir | ||
| Last updated | 2010-03-02 | ||
| 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
In this draft, we analyze the point-to-point (P2P) routing performance of RPL by comparing the shortest P2P route costs in a sample network topology with the corresponding costs when routing along a tree built to minimize the routing costs to the tree's root.
Authors
Emmanuel Baccelli
Mukul Goyal
Ted Humpal
Yusuf Bashir
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)