Learn More
This paper addresses the problem of dimensioning IP access networks for elastic traffic, which is carried by the TCP protocol. The M/G/R Processor Sharing model (M/G/R PS) is used as the basis for capacity computations. The model is extended to take into account TCP specific properties, thus, giving more accurate values, especially for increasing round-trip(More)
In this paper, a new genetic algorithm is introduced which is used as a versatile tool for solving different types of optimization problems arising in the field of network planning. The genetic algorithm is applied to the minimum Steiner tree problem which plays an important role in the design of tree-structured passive optical networks in the access area.(More)
In this paper, the application of individual scenario-based traffic models in identifying the traffic carrying needs of networks in patient monitoring environments is presented. Since the total number of traffic sources is small for a central limit theorem-like approximation, a simple traffic matrix for each scenario can be used to identify the capacity(More)
Routing optimization is an important issue of IP traffic engineering. Depending on the routing protocol used in the network, various approaches are possible. In this paper, we discuss the different concepts of IP routing and their implications for routing optimization. Specifically, we focus on destination-based routing protocols that compute routes based(More)
This paper discusses different approaches of providing multicast traffic for mobile hosts. Mobile IPv6 is used for mobility support. The network employs Protocol Independent Multicast Dense Mode (PIM–DM) for multicast routing and Multicast Listener Discovery (MLD) to collect multicast group membership information. We identify and analyze interoperation(More)
Routing optimization provides network operators with a powerful method for traffic engineering. Its general objective is to distribute traffic flows evenly across available network resources in order to avoid network congestion and quality of service degradation. In this paper we consider routing optimization based on conventional routing protocols where(More)
1 3 4 5 2 SRP Node Node Submodel Fig. 1. The model of an RPR ring with five nodes. Abstract— Based on queuing theory we develop analytical approximations for the average packet transfer time of a store-and-forward and a cut-through buffer insertion ring with two client traffic priorities. These types of rings are architectural alternatives for resilient(More)