Skip to main content

An Efficient Loop Detection Algorithm for SIP Proxies

Document Type Expired Internet-Draft (individual)
Expired & archived
Author Byron Campen
Last updated 2006-03-02
RFC stream (None)
Intended RFC status (None)
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:


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 ''.


Byron Campen

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