- Full text PDF available (65)
Network Virtualization is claimed to be a key component of the Future Internet, providing the dynamic support of different networks with different paradigms and mechanisms in the same physical infrastructure. A major challenge in the dynamic provision of virtual networks is the efficient embedding of virtual resources into physical ones. Since this problem… (More)
Conventional routing management approaches, which are based on given and often " worst case " traffic matrices, are not sufficient anymore to deal with the increasing growth of the number of endpoints and diverse applications in IP networks. Traffic variations are becoming a more and more important issue, especially when making long-term network planning… (More)
We present a way to calculate mobility parameters of a location based mobility model in order to achieve a predefined stationary user distribution. The problem is formulated as a linear programming problem and the solution is verified in simulations. Deviations from the target distribution are measured in several simulation scenarios.
The inclusion of Transmission Control Protocol (TCP) is necessary for the realistic simulation of data networks. However, the operation of HTTP-TCP sources puts a heavy tax on the simulations leading to two major scalability problems: the computing resources required by each source put a limit on the total number of sources that can be simulated, and the… (More)
In this paper we present a new mobility model for mobile network simulations and evaluate user distributions in a real topology using different parameters.
— The first Peer-to-Peer (P2P) networks were based mainly on the altruistic behaviour of the peers. Although newer implementations incorporate some kind of incentive mechanism to award sharing peers, no P2P network assures any quality of service. This paper is meant as a first step towards the development of P2P networks with quality of service. We propose… (More)
In this paper, a method based on hybrid genetic algorithm (GA), is presented to optimize administrative weights for OSPF routing. This method can be seen as an alternative to the local-search method in  or another GA-based method in [8,10]. However, the GA as well as the objective function we use are different. Instead of minimizing a convex cost… (More)