usenix conference policies
You are here
Automatic and Reliable Elimination of E-mail Loops Based on Statistical Analysis
Website Maintenance Alert
Due to scheduled maintenance, the USENIX website may not be available on Monday, March 17, from 10:00 am–6:00 pm Pacific Daylight Time (UTC -7). We apologize for the inconvenience and thank you for your patience.
If you would like to register for NSDI '25, SREcon25 Americas, or PEPR '25, please complete your registration before or after this time period.
E. Solana, V. Baggiolini, M. Ramluckun, and J. Harms, University of Geneva (Switzerland)
One of the major threats to the E-mail service are message loops, mail messages which endlessly circulate between a number of E-mail relays and severely deteriorate or even interrupt the messaging service. Although the standards ruling E-mail communications include mechanisms to prevent message loops, these mechanisms are often unimplemented and, if they are, can fail to work reliably under certain circumstances. This paper describes a novel approach to the automatic and reliable elimination of looping messages. Statistical properties of the message traffic are analyzed to detect messages that might be looping. Such messages are earmarked, and if they are observed to actually be looping, they are eliminated. This method has been implemented and successfully applied in the multi-protocol E-mail environment of the University of Geneva.
author = {E. Solana and V. Baggiolini and M. Ramluckun and J. Harms},
title = {Automatic and Reliable Elimination of E-mail Loops Based on Statistical Analysis},
booktitle = {USENIX 10th Systems Administration Conference (LISA 96)},
year = {1996},
address = {Chicago, IL},
url = {https://www.usenix.org/conference/lisa-96/automatic-and-reliable-elimination-e-mail-loops-based-statistical-analysis},
publisher = {USENIX Association},
month = sep
}
connect with us