GREEN + IDMaps: A practical soulution for ensuring fairness in a biased internet

Conference · Tue Jan 01 04:00:00 EST 2002

OSTI ID:976356

Kapadia, A C ^[1]; Thulasidasan, S ^[2]; Feng, W C ^[3]

---

1. Apu Chandrasen
2. Sunil
3. Wu-Chun

GREEN is a proactive queue-management (PQM) algorithm that removes TCP's bias against connections with longer round-trip times, while maintaining high link utilization and low packet-loss. GREEN applies knowledge of the steady-state behavior of TCP connections to proactively drop packets, thus preventing congestion from ever occurring. As a result, GREEN ensures much higher fairness between flows than other active queue management schemes like Flow Random Early Drop (FRED) and Stochastic Fair Blue (SFB), which suffer in topologies where a large number of flows have widely varying round-trip times. GREEN'S performance relies on its ability to gauge a flow's round-trip time (RTT). In previous work, we presented results for an ideal GREEN router which has accurate RTT information for a flow. In this paper, we present a practical solution based on IDMaps, an Internet distance-estimation service, and compare its performance to an ideal GREEN router. We show that a solution based on IDMaps is practical and maintains high fairness and link utilization, and low packet-loss rates.

• Research Organization: Los Alamos National Laboratory
• Sponsoring Organization: DOE
• OSTI ID: 976356
• Report Number(s): LA-UR-02-6126
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
ALGORITHMS
COMMUNICATIONS
INTERNET
MANAGEMENT
PERFORMANCE
QUEUES