Results 251 to 260 of about 36,991 (276)
Some of the next articles are maybe not open access.
A new dynamic distributed routing algorithm on telecommunication networks
WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420), 2002A new dynamic distributed routing scheme on connection-oriented telecommunication networks, which is called the ant colony routing (ACR) scheme, is proposed. It is inspired by the phenomena that ants are always able to find the shortest path between food source and nest.
null Lianyuan Li +2 more
openaire +1 more source
Distributed dynamic routing using ant algorithm for telecommunication networks
WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420), 2002In telecommunication networks, routing is an important issue. For this reason, we study a distributed dynamic routing (DDR) approach, and propose a novel distributed real-time dynamic routing (DRDR) approach which considers not only the utilization of resources but also the load balance in telecommunication networks.
null Lu Guoying +2 more
openaire +1 more source
Routing in telecommunications networks with ant-like agents
1998A simple mechanism is presented, based on ant-like agents, for routing and load balancing in telecommunications networks, following the initial works of Appleby and Stewart [1] and Schoonderwoerd et al. [32,33]. In the present work, agents are very similar to those proposed by Schoonderwoerd et al.
Eric Bonabeau +5 more
openaire +1 more source
The neuro-fuzzy controller for routing in telecommunication networks
2017 International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo), 2017The paper proposes using a neuro-fuzzy controller in telecommunication networks for improving the routing process. An architecture of the neuro-fuzzy controller was developed. Linguistic variables, terms and membership functions for input and output values were defined. A rules base was developed.
Olena Semenova, Andriy Semenov
openaire +1 more source
Price-directive decomposition applied to routing in telecommunication networks
European Journal of Operational Research, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ayllón, Fátima G. +3 more
openaire +1 more source
Centralized and decentralized stochastic routing models in telecommunication networks
Telecommunication Systems, 1993With the advent of non-hierarchical routing in circuit-switched telecommunication networks, on-line routing policies have been developed with the objective of optimizing some measure of gain or performance. These policies are decentralized. However, traditional planning models are centralized models.
Brunilde Sansó +2 more
openaire +1 more source
Multipath routing model of multicast flows in telecommunication networks
2017 4th International Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC S&T), 2017In order to ensure the optimal load balancing in telecommunications network, the multicast routing flow-based model has been improved in the direction of implementing the multipath packet transmission strategy. It is suggested to split the original multicast flow into a set of subflows, for each of which an optimal tree is built as a multicast route ...
Amal Mersni +2 more
openaire +1 more source
Strategic parameter-driven routing models for multidestination traffic in telecommunication networks
IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 2001We present mathematical models that determine the optimal parameters for strategically routing multidestination traffic in an end-to-end network setting. Multidestination traffic refers to a traffic type that can be routed to any one of a multiple number of destinations.
Y, Lee, J M, Tien
openaire +2 more sources
Optimal Double Route Search in a Telecommunication Network: A Telecontrol Network Application
IEEE Transactions on Reliability, 2011High availability communication networks with very low failure rates are often designed by using physical diversity, i.e., the traffic between a given pair of nodes is routed by using several physically disjoint paths. The selection of the pair of routes that maximizes the connectivity of a node is not an easy problem, because such connectivity cannot ...
Juan Ramón Feijoo +4 more
openaire +1 more source
A new proximal decomposition algorithm for routing in telecommunication networks
Networks, 1998Summary: We present a new and much more efficient implementation of the proximal decomposition algorithm for routing in congested telecommunication networks. The routing model that we analyze is a static one intended for use as a subproblem in a network design context.
Mahey, Philippe +3 more
openaire +3 more sources