2,261 research outputs found

    Neural networks applied to traffic management in telephone networks

    Get PDF
    In this paper the application of neural networks to some of the network management tasks carried out in a regional Bell telephone company is described. Network managers monitor the telephone network for abnormal conditions and have the ability to place controls in the network to improve traffic flow. Conclusions are drawn regarding the utility and effectiveness of the neural networks in automating the network management tasks

    Dynamic routing in circuit-switched non-hierarchical networks

    Get PDF
    This thesis studies dynamic routing in circuit-switched non-hierarchical networks based on learning automata algorithms. The application of a mathematical model for a linear reward penalty algorithm is explained. Theoretical results for this scheme verified by simulations shows the accuracy of the model. Using simulation and analysis, learning automata algorithms are compared to several other strategies on different networks. The implemented test networks may be classified into two groups. The first group are designed for fixed routing and in such networks fixed routing performs better than any dynamic routing scheme. It will be shown that dynamic routing strategies perform as well as fixed routing when trunk reservation is employed. The second group of networks are designed for dynamic routing and trunk reservation deteriorates the performance. Comparison of different routing algorithms on small networks designed to force dynamic routing demonstrates the superiority of automata under both normal and failure conditions. The thesis also considers the instability problem in non-hierarchical circuit-switched networks when dynamic routing is implemented. It is shown that trunk reservation prevents instability and increases the carried load at overloads. Finally a set of experiments are performed on large networks with realistic capacity and traffic matrices. Simulation and analytic results show that dynamic routing outperforms fixed routing and trunk reservation deteriorates the performance at low values of overload. At high overloads, optimization of trunk reservation is necessary for this class of networks. Comparison results show the improved performance with automata schemes under both normal and abnormal traffic conditions. The thesis concludes with a discussion of proposed further work including expected developments in Integrated Service Digital Networks

    Improved learning automata applied to routing in multi-service networks

    Get PDF
    Multi-service communications networks are generally designed, provisioned and configured, based on source-destination user demands expected to occur over a recurring time period. However due to network users' actions being non-deterministic, actual user demands will vary from those expected, potentially causing some network resources to be under- provisioned, with others possibly over-provisioned. As actual user demands vary over the recurring time period from those expected, so the status of the various shared network resources may also vary. This high degree of uncertainty necessitates using adaptive resource allocation mechanisms to share the finite network resources more efficiently so that more of actual user demands may be accommodated onto the network. The overhead for these adaptive resource allocation mechanisms must be low in order to scale for use in large networks carrying many source-destination user demands. This thesis examines the use of stochastic learning automata for the adaptive routing problem (these being adaptive, distributed and simple in implementation and operation) and seeks to improve their weakness of slow convergence whilst maintaining their strength of subsequent near optimal performance. Firstly, current reinforcement algorithms (the part causing the automaton to learn) are examined for applicability, and contrary to the literature the discretised schemes are found in general to be unsuitable. Two algorithms are chosen (one with fast convergence, the other with good subsequent performance) and are improved through automatically adapting the learning rates and automatically switching between the two algorithms. Both novel methods use local entropy of action probabilities for determining convergence state. However when the convergence speed and blocking probability is compared to a bandwidth-based dynamic link-state shortest-path algorithm, the latter is found to be superior. A novel re-application of learning automata to the routing problem is therefore proposed: using link utilisation levels instead of call acceptance or packet delay. Learning automata now return a lower blocking probability than the dynamic shortest-path based scheme under realistic loading levels, but still suffer from a significant number of convergence iterations. Therefore the final improvement is to combine both learning automata and shortest-path concepts to form a hybrid algorithm. The resulting blocking probability of this novel routing algorithm is superior to either algorithm, even when using trend user demands

    Simulation and analysis of adaptive routing and flow control in wide area communication networks

    Get PDF
    This thesis presents the development of new simulation and analytic models for the performance analysis of wide area communication networks. The models are used to analyse adaptive routing and flow control in fully connected circuit switched and sparsely connected packet switched networks. In particular the performance of routing algorithms derived from the L(_R-I) linear learning automata model are assessed for both types of network. A novel architecture using the INMOS Transputer is constructed for simulation of both circuit and packet switched networks in a loosely coupled multi- microprocessor environment. The network topology is mapped onto an identically configured array of processing centres to overcome the processing bottleneck of conventional Von Neumann architecture machines. Previous analytic work in circuit switched work is extended to include both asymmetrical networks and adaptive routing policies. In the analysis of packet switched networks analytic models of adaptive routing and flow control are integrated to produce a powerful, integrated environment for performance analysis The work concludes that routing algorithms based on linear learning automata have significant potential in both fully connected circuit switched networks and sparsely connected packet switched networks

    Dynamic bandwidth allocation in multi-class IP networks using utility functions.

    Get PDF
    PhDAbstact not availableFujitsu Telecommunications Europe Lt

    Revenue Management of Reusable Resources with Advanced Reservations

    Full text link
    Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/137568/1/poms12672_am.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/137568/2/poms12672.pd

    Learning algorithms for the control of routing in integrated service communication networks

    Get PDF
    There is a high degree of uncertainty regarding the nature of traffic on future integrated service networks. This uncertainty motivates the use of adaptive resource allocation policies that can take advantage of the statistical fluctuations in the traffic demands. The adaptive control mechanisms must be 'lightweight', in terms of their overheads, and scale to potentially large networks with many traffic flows. Adaptive routing is one form of adaptive resource allocation, and this thesis considers the application of Stochastic Learning Automata (SLA) for distributed, lightweight adaptive routing in future integrated service communication networks. The thesis begins with a broad critical review of the use of Artificial Intelligence (AI) techniques applied to the control of communication networks. Detailed simulation models of integrated service networks are then constructed, and learning automata based routing is compared with traditional techniques on large scale networks. Learning automata are examined for the 'Quality-of-Service' (QoS) routing problem in realistic network topologies, where flows may be routed in the network subject to multiple QoS metrics, such as bandwidth and delay. It is found that learning automata based routing gives considerable blocking probability improvements over shortest path routing, despite only using local connectivity information and a simple probabilistic updating strategy. Furthermore, automata are considered for routing in more complex environments spanning issues such as multi-rate traffic, trunk reservation, routing over multiple domains, routing in high bandwidth-delay product networks and the use of learning automata as a background learning process. Automata are also examined for routing of both 'real-time' and 'non-real-time' traffics in an integrated traffic environment, where the non-real-time traffic has access to the bandwidth 'left over' by the real-time traffic. It is found that adopting learning automata for the routing of the real-time traffic may improve the performance to both real and non-real-time traffics under certain conditions. In addition, it is found that one set of learning automata may route both traffic types satisfactorily. Automata are considered for the routing of multicast connections in receiver-oriented, dynamic environments, where receivers may join and leave the multicast sessions dynamically. Automata are shown to be able to minimise the average delay or the total cost of the resulting trees using the appropriate feedback from the environment. Automata provide a distributed solution to the dynamic multicast problem, requiring purely local connectivity information and a simple updating strategy. Finally, automata are considered for the routing of multicast connections that require QoS guarantees, again in receiver-oriented dynamic environments. It is found that the distributed application of learning automata leads to considerably lower blocking probabilities than a shortest path tree approach, due to a combination of load balancing and minimum cost behaviour

    Neural networks applied to traffic management in telephone networks

    Get PDF
    In this paper the application of neural networks to some of the network management tasks carried out in a regional Bell telephone company is described. Network managers monitor the telephone network for abnormal conditions and have the ability to place controls in the network to improve traffic flow. Conclusions are drawn regarding the utility and effectiveness of the neural networks in automating the network management tasks
    • 

    corecore