@techreport{campen-sipping-stack-loop-detect-00,
    number =    {draft-campen-sipping-stack-loop-detect-00},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-campen-sipping-stack-loop-detect/00/},
    author =    {Byron Campen},
    title =     {{An Efficient Loop Detection Algorithm for SIP Proxies}},
    pagetotal = 11,
    year =      2006,
    month =     mar,
    day =       2,
    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'.},
}