Lor, SS; Landa, R; Rio, M; (2010) Packet re-cycling: eliminating packet losses due to network failures. In: Xie, GG and Beverly, R and Morris, R and Davie, B, (eds.) Proceedings of the Ninth ACM SIGCOMM Workshop on Hot Topics in Networks. ACM: New York, US.
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or node failures. The technique employs only one bit in the packet header to cover any single link failures, and in the order of log2(d) bits to cover all non-disconnecting failure combinations, where d is the diameter of the network. We show that our routing strategy is effective and that its path length stretch is acceptable for realistic topologies. The packet header overhead incurred by PR is very small, and the extra memory and packet processing time required to implement it at each router are insignificant. This makes PR suitable for loss-sensitive, mission-critical network applications.
|Title:||Packet re-cycling: eliminating packet losses due to network failures.|
|Open access status:||An open access version is available from UCL Discovery|
|Additional information:||© ACM, 2010. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the Ninth ACM SIGCOMM Workshop on Hot Topics in Networks (2010) http://dx.doi.org/10.1145/1868447.1868449. Article No. 2.|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Electronic and Electrical Engineering|
View download statistics for this item
Activity - last month
Activity - last 12 months
Archive Staff Only: edit this record