LOSS AND DELAY ANALYSIS OF DYNAMIC FLOW SETUP IN ATM NETWORKS

In recent years, there has been a rapid growth in applications such as World Wide Web browsing, which are characterized by fairly short sess ions that transfer substantial amounts of data. Conventional connectio n-oriented and datagram services are not ideally engineered to handle this kind of traffic. We present a new ATM service, called Dynaflow se rvice, in which virtual circuits are created on a burst-by-burst basis and we evaluate key aspects of its performance. We compare Dynaflow t o the Fast reservation protocol (FRP) and show that Dynaflow can achie ve higher overall throughput due to the elimination of reservation del ays, and through the use of shared ''burst-stores.'' We study the queu eing performance of the dynaflow switch and quantify the relationship between the loss ratio and the buffer size.