Results 121 to 130 of about 1,002 (166)
Some of the next articles are maybe not open access.
Routing in telecommunication network with controlled ant population
2003 International Symposium on VLSI Technology, Systems and Applications. Proceedings of Technical Papers. (IEEE Cat. No.03TH8672), 2004Swarm intelligence based algorithms for routing in telecommunication networks have gained considerable amount of attention in recent years. Swarm intelligence, demonstrated by natural biological swarms, exhibits numerous powerful features that are desirable in communication systems. Mobile agents having swarm intelligence similar to real life ants have
Mohammad Mursalin Akon +2 more
openaire +1 more source
Routing Through Virtual Paths in Layered Telecommunication Networks
Operations Research, 1999We study a network configuration problem in telecommunications where one wants to set up paths in a capacitated network to accommodate given point-to-point traffic demand. The problem is formulated as an integer linear programming model where 0–1 variables represent different paths.
Geir Dahl +2 more
openaire +1 more source
Finding Disjoint Routes in Telecommunications Networks with Two Technologies
Operations Research, 1999We consider networks in which a cost is associated with each arc or edge and a transition cost is associated with each node. This last cost is related to the presence of two technologies on the network and is incurred only when a flow enters and leaves the corresponding node on arcs of different types.
Anne de Jongh +2 more
openaire +4 more sources
Lexicographical Minimization of Routing Hops in Telecommunication Networks
2011Consider a telecommunications network with given link capacities and a set of commodities with known demands that must be routed over the network. We aim to determine a single routing path for each commodity such that the whole set of paths does not violate the link capacities and the number of routing hops is minimized in a lexicographical sense, i.e.,
Luis Eduardo Neves Gouveia +2 more
openaire +2 more sources
Automated call routing in a telecommunications network
Proceedings of 2nd IEEE Workshop on Interactive Voice Technology for Telecommunications Applications, 2002Considers the task of automated call routing in a telecommunications network. When a customer desires some service, they should proceed by dialing a single universal number, which prompts them with "Hello, how may I help you.?" The person then responds to this prompt via unconstrained fluent speech, on which basis the call is automatically routed to an
A.L. Gorin, H. Hanek, R. Rose, L. Miller
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
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
On the evaluation of telecommunications network reliability using routing models
IEEE Transactions on Communications, 1991A reliability measure that takes into account routing and rerouting policies after failures as well as the capacity of the network to satisfy its demand is proposed. The measure, based on the evaluation of the lost call traffic, needs resolution of a routing model for the states of perfect functioning as well as the most probable failure states. A type
Brunilde Sansò +2 more
openaire +2 more sources
A Virtual Clustering Approach for Routing Problems in Telecommunication Networks
INFORMS Journal on Computing, 1998We propose an adaptable routing scheme for telecommunication networks based on the notion of virtual clustering. Virtual clustering logically reconfigures the network topology in a periodic basis according to the traffic requirements in the network.
Michael R. Bartolacci, S. David Wu
openaire +1 more source
Optimal diverse routing in telecommunication fiber networks
Proceedings of INFOCOM '94 Conference on Computer Communications, 2002Telecommunication fiber networks can be more complicated than the traditional graph-theoretic networks of nodes and links. This is due to practical and economic considerations. The paper considers two major types of deviations from the traditional graph-theoretic network, and provide an algorithm for the shortest pair of physically-disjoint paths ...
openaire +1 more source