In order to characterize wide-area network traffic, we have analyzed traces from four Internet sites. We identify characteristics common to all conversations of each major type of traffic, and find that these characteristics are stable across time and geographic site. Our results contradict many prevalent beliefs. For example, previous simulation models of wide-area traffic have assumed bulk transfers ranging from 80 Kilobytes to 2 Megabytes of data. In contrast, we find that up to 90% of all bulk transfers involve 10 Kilobytes or less.
We derive from our traces a new workload model for driving simulations of wide-area internetworks. It generates traffic for individual conversations of each major type of traffic. The model accurately and efficiently reproduces behavior specific to each traffic type by sampling measured probability distributions through the inverse transform method. Our model is valid for network conditions other than those prevalent during the measurements because it samples only network-independent traffic characteristics. We also describe a new wide-area internetwork simulator that includes both our workload model and realistic models of network components.
We then present a simulation study of policies for multiplexing datagrams over virtual circuits at the entrance to wide-area networks. We compare schemes for mapping conversations to virtual circuits and queueing disciplines for scheduling datagrams onto virtual circuits. We find that networks should establish one virtual circuit per type of traffic flowing between two network points of presence, and provide round-robin service to transmission resources shared by virtual circuits. This multiplexing policy exhibits good performance and consumes moderate amounts of resources at the expense of some fairness among traffic sources of the same type. In particular, it maintains interactive delay nearly constant and close to the possible minimum, and maintains bulk transfer throughput near the possible maximum, even as network load increases beyond saturation. Furthermore, it results in bottleneck buffer consumption that rises slowly with offered load.
Again using our traffic characterization, we evaluate mechanisms for multiplexing variable-sized datagrams onto small fixed-size cells. We find that cell-based networks using standard protocols are inefficient in carrying wide-area data traffic. Furthermore, we find that viable compression techniques can significantly improve efficiency. (Abstract shortened by UMI.)
Cited By
- Balakrishnan H, Stemm M, Seshan S and Katz R Analyzing stability in wide-area network performance Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (2-12)
- Balakrishnan H, Stemm M, Seshan S and Katz R (1997). Analyzing stability in wide-area network performance, ACM SIGMETRICS Performance Evaluation Review, 25:1, (2-12), Online publication date: 1-Jun-1997.
- Romanow A and Floyd S Dynamics of TCP traffic over ATM networks Proceedings of the conference on Communications architectures, protocols and applications, (79-88)
- Romanow A and Floyd S (1994). Dynamics of TCP traffic over ATM networks, ACM SIGCOMM Computer Communication Review, 24:4, (79-88), Online publication date: 1-Oct-1994.
Index Terms
- Multiplexing traffic at the entrance to wide-area networks
Recommendations
Wide-area traffic: the failure of Poisson modeling
SIGCOMM '94: Proceedings of the conference on Communications architectures, protocols and applicationsNetwork arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially distributed. We evaluate 21 wide-area traces, investigating a number of ...
Wide-area traffic: the failure of Poisson modeling
Network arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially distributed. We evaluate 21 wide-area traces, investigating a number of ...