tailieunhanh - Mạng lưới giao thông và đánh giá hiệu suất P11

In early literature about the performance of telecommunication systems, traf®c was generally modeled as memoryless Poisson streams of packets. In these models the packet arrival processes show no time interdependence. Recent measurements on Web traf®c show that this hypothesis is wrong and that Web traf®c actually experiences what we now call long-term dependence. Long-term dependence is interesting not only because it contradicts Poisson's law, but also because it signi®cantly impacts the performance of networks | Self-Similar Network Traffic and Performance Evaluation Edited by Kihong Park and Walter Wi 1 linger Copyright 2000 by John Wiley Sons Inc. Print ISBN 0-471-31974-0 Electronic ISBN 0-471-20644-X 11 TRAFFIC AND QUEUEING FROM AN UNBOUNDED SET OF INDEPENDENT MEMORYLESS ON OFF SOURCES Philippe Jacquet INRIA 78153 Le Chesnay Cédex France INTRODUCTION Long-Term Dependence and Packet Loss in Telecommunication Traffic In early literature about the performance of telecommunication systems traffic was generally modeled as memoryless Poisson streams of packets. In these models the packet arrival processes show no time interdependence. Recent measurements on Web traffic show that this hypothesis is wrong and that Web traffic actually experiences what we now call long-term dependence. Long-term dependence is interesting not only because it contradicts Poisson s law but also because it significantly impacts the performance of networks. One effect is that it dramatically increases packet loss in data networks. For example let us focus on an Internet router. In a simple model the router can be seen as a buffer served by a single server. When the buffer overflows some packets are lost. The lost packets must be re-sent following TCP IP thus adding extra delay and traffic. If we simply model the router by a M M 1 queue with an infinite buffer input rate and service rate 1 then the probability pn that the queue length is greater than n is exactly 2 . In a first-order approximation quantity pn can be identified with the packet loss rate in a buffer of size n. Therefore to keep packet loss below some acceptable level it suffices to make the buffer capacity greater than log e log 2 269 270 TRAFFIC AND QUEUEING FROM AN UNBOUNDED SET that is a logarithmic function of 1 e. In general telecommunication designers work on e on the order of 10 and 2 . Long-term dependent traffic can make loss and retry rates pn x for some 0 1 . In other words the queue size distribution has a .

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.