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)
—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)
— We present a way to calculate mobility parameters of a location based mobility model in order to achieve a pre-defined 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.
This paper deals with the statistical characterization of a stochastic process which is a product of a Rice process and a lognormal process. Thereby, we consider the more general case where the two Gaussian noise processes describing the Rice process are correlated. The resulting process will be named as extended Suzuki process, which can be used as… (More)
— 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)
— In resource marking theory, users adapt their rates according to their utility functions and congestion signals from the network. Using a special type of utility functions, this will lead to a proportionally fair rate allocation among the users. In this paper, we examine the ability of two proposed resource marking implementations to yield a… (More)