Efficient policies for carrying Web traffic over flow-switched networks

• Published in: IEEE/ACM transactions on networking Vol. 6; no. 6; pp. 673 - 685
• Main Authors: Feldmann, A., Rexford, J., Caceres, R.
• Format: Journal Article
• Language: English
• Published: IEEE 01.12.1998
• Subjects: Hardware; Internet; IP networks; Network servers; Packet switching; Probability distribution; Protocols; Switches; Telecommunication traffic; Web server
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/90.748081

To efficiently transfer diverse traffic over high-speed links, modern integrated networks require more efficient packet-switching techniques that can capitalize on the advances in switch hardware. Several promising approaches attempt to improve the performance by creating dedicated "shortcut" connections for long-lived traffic flows, at the expense of the network overhead for establishing and maintaining these shortcuts. The network can balance these cost-performance tradeoffs through three tunable parameters: the granularity of flow end-point addresses, the timeout for grouping related packets into flows, and the trigger for migrating a long-lived flow to a shortcut connection. Drawing on a continuous one-week trace of Internet traffic, we evaluate the processor and switch overheads for transferring HTTP server traffic through a flow-switched network. In contrast to previous work, we focus on the full probability distributions of flow sizes and cost-performance metrics to highlight the subtle influence of the HTTP protocol and user behavior on the performance of flow switching. We find that moderate levels of aggregation and triggering yield significant reductions in overhead with a negligible reduction in performance. The traffic characterization results further suggest schemes for limiting shortcut overhead by temporarily delaying the creation of shortcuts during peak load and by aggregating related packets that share a portion of their routes through the network.