János Harmatos

Learn More
Building new UMTS (Universal Mobile Telecommunication Systems) based networks seems to be on time. Nowadays the UMTS network design related problems are moving to the interconnection of Radio Network Controllers (RNC), placement of Media Gateways (MGw) and planning of the core network topology. This new area of UMTS network design is studied in the paper. A(More)
The Universal Mobile Telecommunication System (UMTS) will play a very important role in the telecommunication market of the near future. The wide range of services and the increased transmission capacity provide the UMTS become one of the most important type of access networks. The proposed topology of UMTS terrestrial access network is the tree, however(More)
In this paper we propose a heuristic planning algorithm for optimizing tree-topology access networks. Our suggested method is able to plan a multiconstrained and capacitated subnetwork tree with a previously dedicated root node. The algorithm is a combination of an adaptive version of the Simulated Annealing meta-heuristic and a local improvement strategy.(More)
The paper addresses the classical network optimization problem consisting in realizing the assumed set of demands in a given network with a given list of potential nodes’ and links’ locations and with the objective function reflecting the cost of the actual links’ capacities as well as the fixed cost of installing nodes and links. We assume that the network(More)
Multiprotocol Label Switching technology provides efficient means for controlling the traffic of IP backbone networks and thus, offers performance superior to that of traditional Interior Gateway Protocol (IGP) based packet forwarding. However, computation of explicit paths yielding optimal network performance is a difficult task; several different(More)
The paper addresses the IP/MPLS network cost optimization problem of selecting localizations of nodes and links, combined with links’ dimensioning. As MPLS is flexible in routing demands’ flows through the network, the considered problem is similar to the classical NP-hard topological design problems dealt with in the past, mostly in the context of the road(More)
The paper deals with flow allocation problems in IP networks using OSPF routing. The main considered issue is the adjustment of the OSPF link weight system in order to achieve near-optimal network throughput for the actual (estimated) traffic demand pattern. In this way, a significantly better network performance can be achieved as compared with the weight(More)