Load Balancing in a Network using Ant Colony Optimization Technique

This thesis describes a method of achieving load balancing in telecommunications networks. A simulated network models a typical distribution of calls between nodes; nodes carrying an excess of traffic can become congested, causing calls to be lost. In addition to calls, the network also supports a population of simple mobile agents with behaviours modelled on the trail laying abilities of ants. The ants move across the network between randomly chosen pairs of nodes; as they move they deposit simulated pheromones as a function of their distance from their source node, and the congestion encountered on their journey. They select their path at each intermediate node according the distribution of simulated pheromones at each node. Calls between nodes are routed as a function of the pheromone distributions at each intermediate node. The performance of the network is measured by the average no of hops taken to complete the calls. In this thesis ,the results of using the antbased control (ABC) are compared with those achieved by using fixed shortestpath routes,(dijkstra’s algorithm) used in network management. The ABC system is shown to result in fewer call failures than the other methods, while exhibiting many attractive features of distributed control

The Methods to Improve Quality of Service by Accounting Secure Parameters

A solution to the problem of ensuring quality of service, providing a greater number of services with higher efficiency taking into account network security is proposed. In this paper, experiments were conducted to analyze the effect of self-similarity and attacks on the quality of service parameters. Method of buffering and control of channel capacity and calculating of routing cost method in the network, which take into account the parameters of traffic multifractality and the probability of detecting attacks in telecommunications networks were proposed. The both proposed methods accounting the given restrictions on the delay time and the number of lost packets for every type quality of service traffic. During simulation the parameters of transmitted traffic (self-similarity, intensity) and the parameters of network (current channel load, node buffer size) were changed and the maximum allowable load of network was determined. The results of analysis show that occurrence of overload when transmitting traffic over a switched channel associated with multifractal traffic characteristics and presence of attack. It was shown that proposed methods can reduce the lost data and improve the efficiency of network resources.Comment: 10 pages, 1 figure, 1 equation, 1 table. arXiv admin note: text overlap with arXiv:1904.0520

Simulation of a distributed CORBA-based SCP

This paper examines load balancing issues relating to a distributed CORBA-based Service Control Point. Two types of load balancing strategies are explored through simulation studies: (i) a novel ant-based load balancing algorithm, which has been devised specically for this type of system. This algorithm is compared to more traditional algorithms, (ii) a method for optimal distribution of the computational objects composing the service programs. This is based on mathematically minimising the expected communication ows between network nodes and message-level processing costs. The simulation model has been based on the recently adopted OMG IN/CORBA Interworking specication and the TINA Service Session computational object model

Performance of distributed information systems

There is an increasing use of distributed computer systems to provide services in both traditional telephony as well as in the Internet. Two main technologies are Distributed Object Computing (DOC) and Web based services. One common DOC architecture investigated in this thesis is the Common Object Request Broker Architecture (CORBA), specified by the Object Management Group. CORBA applications consist of interacting software components called objects. Two other DOC architectures investigated are the Telecommunications Information Net- working Architecture (TINA) and a CORBA based Intelligent Network (IN/CORBA) system. In a DOC environment, the objects of an application are distributed on mul- tiple nodes. A middleware layer makes the distribution transparent to the application. However, the distributed nature creates a number of potential performance problems. Three problems in DOC systems are examined in this thesis: object distribution, load balancing and overload protection. An object distribution describes how objects are distributed in the network. The objective is to distribute the objects on the physical nodes in such a way that intern-node communication overhead is as small as possible. One way to solve the object distribution problem is to use linear programming. The constraints for the problem are then given by both ease of management of the system and performance concerns. Load balancing is used when there are multiple objects that can be used at a particular time. The objective of load balancing is to distribute the load e±ciently on the available nodes. This thesis investigates a number of de- centralized load balancing mechanisms, including one based on the use of intelligent agents. Finally, overload protection mechanisms for DOC systems are investigated. While overload protection is well-researched for telecom networks, only little work has been performed previously concerning DOC and overload protection. Also, this thesis examines the use of overload protection in e-commerce web servers. Two schemes are compared, one which handles admission to the e-commerce site on request basis, and another which handles admission on session basis. The session based mechanism is shown to be better in terms of user-experienced performance

Quality of service aware ant colony optimization routing algorithm

The demand for Internet connectivity has grown exponentially in the past few years. Moreover, the advent of new services such as Voice over IP (VoIP), Video on Demand (VOD) and Videoconferencing applications have caused a sever increase in traffic, which makes it extremely hard to ensure an acceptable level of quality. This is mainly attributed to current routing strategies, such as Link State (LS) and Distance Vector (DV), which are not optimal in terms of Quality of Service (QoS). This paper presents a QoS-Aware routing strategy based on the Ant Colony Optimization (ACO) concept, where a set of artificial ants are used to determine the optimal path. The proposed method was compared to other state of the art ACO procedures and traditional routing schemes like LS and DV. Simulation results clearly demonstrate that the proposed scheme outperforms all the methods considered in this paper where throughput gains of 8% and a reduction in delay of 38% for time critical applications were achieved.peer-reviewe