An Efficient Loop Detection Algorithm for SIP Proxies
draft-campen-sipping-stack-loop-detect-00

Document Type Expired Internet-Draft (individual)
Author Byron Campen 
Last updated 2006-03-02
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-campen-sipping-stack-loop-detect-00.txt

Abstract

This document defines a loop-detection algorithm with a cumulative O(n) complexity (O(1) average complexity for each proxy) and average O(log n) state-space, where n is the number of proxies that the message passes through. Also, the backwards-compatibility and security of this algorithm are discussed. Comments are solicited, and should be directed to the SIPPING working group list at 'sipping@ietf.org'.

Authors

Byron Campen (bcampen@estacado.net)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)