Results 241 to 250 of about 36,991 (276)

Routing Through Virtual Paths in Layered Telecommunication Networks

Operations Research, 1999
We 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.
Dahl, Geir, Martin, Alexander, Stoer, Mechthild   +2 more
openaire   +1 more source

Automated call routing in a telecommunications network

Proceedings of 2nd IEEE Workshop on Interactive Voice Technology for Telecommunications Applications, 2002
Considers 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

Finding Disjoint Routes in Telecommunications Networks with Two Technologies

Operations Research, 1999
We 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.
De Jongh, Anne, Gendreau, Michel, Labbé, Martine   +2 more
openaire   +3 more sources

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), 2004
Swarm 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
M.M. Akon, D. Goswami, S.A. Jyoti
openaire   +1 more source

Lexicographical Minimization of Routing Hops in Telecommunication Networks

2011
Consider 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.,
Gouveia, Luís, Patrício, Pedro, Sousa, Amaro Fernandes de   +2 more
openaire   +2 more sources

Design of dynamic routing scheme in telecommunication networks

The Experience of Designing and Application of CAD Systems in Microelectronics, 2015
In this paper the dynamic routing model of TCN is proposed. The novelty is that it is presented as a system of linear differential equations to describe the process of redistribution capacities of links and nonlinear algebraic equations to describe the routing of flows and congestion control.
Hailan, Ahmad M., Tariki, N., Vavenko, T.V.   +2 more
openaire   +1 more source

Packet Routing in Telecommunication Networks with Path and Flow Restrictions

INFORMS Journal on Computing, 1999
We address packet-switched telecommunication networks, including ATM, SMDS, and X.25 services. We analyze important extensions of routing models by imposing restrictions on paths and flows. We then study how these modifications affect the computational requirements for solution.
Leblanc, Larry, Chifflet, Jerome, Mahey, Philippe   +2 more
openaire   +2 more sources

AD HOC TELECOMMUNICATIONS NETWORK MANAGEMENT AND ROUTING

2002
An ad hoc telecommunications network comprises a plurality of mobile devices, cached data being distributed amongst the devices. A manager device is elected for example based on highest compared received signal strength amongst the devices to manage the distributed data.
MOTOROLA INC, TAIB RONNIE BERNARD FRANCIS, BENSON MAYA   +2 more
openaire   +2 more sources

Optimal diverse routing in telecommunication fiber networks

Proceedings of INFOCOM '94 Conference on Computer Communications, 2002
Telecommunication 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

Hybrid Genetic Algorithms for Telecommunications Network Back-Up Routeing

BT Technology Journal, 2000
Telecommunications networks are interconnected by routers, and network protocols must find a path to connect them. Each router has a routeing table, which specifies the next node in a route to a specified destination. Routeing tables are defined by the routeing algorithms employed.
L He, N Mort
openaire   +1 more source