Characterization of the departure process from an

In this paper we propose a family of finite approximations for the departure process of an ME/ME/1 queue indexed by a parameter k defined as the system size of the finite approximation. The approximations capture the interdeparture times from an ME/ME/1 queue exactly and preserve the lag correlations of inter-event times of the departures from an ME/ME/1 queue up to lag (k - 1)

Controlling Performance in the Congested Parts of an Asymmetric Network using Controls and Routing

In this paper, we attempt to improve the performance in congested parts (CP) of an asymmetric network with network controls and routing mechanisms. Typically, an asymmetric network is characterized by nonuniform link capacities or uneven traffic load or both. In such a network, certain service classes can experience poor performance in parts of the network, even when the average performance is very close to the expected performance level. We studied a network derived from an actual service provider network with asymmetric concentration of traffic. We have developed two metrics in order to capture the congested part behavior in a network. In order to understand the generality of our conclusions, we used three variations of our network and show that controls like Service class based Multi-link Dynamic Capacity Reservation (SMDCR) with a properly chosen reservation factor, significantly reduce variability in the performance over all parts of the network

Benefits of Traffic Engineering using QoS Routing Schemes and Network Controls

We demonstrate the benefits of traffic engineering by studying three realistic network models derived from an actual service provider network. We evaluate traffic engineering in the presence of QoS-based routing schemes compared with the destination-based routing, the default routing behavior for the Internet. We also simulate prioritization of important traffic flows by implementing priority in one or more of the path caching, path ordering, and actual route selection phases of the constraint-based routing framework. We observe that traffic engineering can provide 20% to 50 % network capacity savings. We also observe that prioritization in more than one phase of constraint-based routing can provide even more significant benefits. Key words: Traffic engineering, constraint-based routing, quality of service routing.