Keyword: networks

Found 1865 papers in total
On the location of a tree-shaped facility
On the location of a tree-shaped facility
1996,
This paper considers the problem of locating a central facility on a tree network. The...
Optimal routings in communications networks with linearly bounded forwarding index
Optimal routings in communications networks with linearly bounded forwarding index
1996,
In a given graph with n vertices, a routing is defined as a set of n ( n – 1)...
Power network design
Power network design
1996,
An electrical power network design problem is presented, formulated as a Capacitated...
A class of bottleneck expansion problems
A class of bottleneck expansion problems
2001,
In this paper we consider how to increase the capacities of the elements in a set E...
Assignment of add–drop multiplexer rings and digital cross-connect system mesh in telecommunication networks
Assignment of add–drop multiplexer rings and digital cross-connect system mesh in telecommunication networks
2001,
This paper discusses a design of a hybrid ring–mesh network in a survivable...
Capacitated facility location/network design problems
Capacitated facility location/network design problems
2001,
We introduce a combined facility location/network design problem in which facilities...
Topological network design of pedestrian networks
Topological network design of pedestrian networks
2001,
The design and analysis of series, merge, and splitting topologies of pedestrian...
An overview of nontraditional formulations of static and dynamic equilibrium network design
An overview of nontraditional formulations of static and dynamic equilibrium network design
2001,
This paper reviews two classes of nontraditional models for the (dis)equilibrium...
An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem
An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem
2001,
The continuous network design problem (CNDP) is characterized by a bilevel programming...
Note on the computational complexity of least core concepts for min-costs spanning tree games
Note on the computational complexity of least core concepts for min-costs spanning tree games
2000,
Various least core concepts including the classical least core of cooperative games...
Solving graph bisection problems with semidefinite programming
Solving graph bisection problems with semidefinite programming
2000,
An exact solution method for the graph bisection problem is presented. We describe a...
Queueing networks with instantaneous movements: A unified approach by quasi-reversibility
Queueing networks with instantaneous movements: A unified approach by quasi-reversibility
2000,
In this paper we extend the notion of quasi-reversibility and apply it to the study of...
General open and closed queueing networks with blocking: A unified framework for approximation
General open and closed queueing networks with blocking: A unified framework for approximation
2000,
In this paper, we develop a unified framework for approximating open and closed...
Modelling congestion in closed queueing networks
Modelling congestion in closed queueing networks
2000,
We will consider the problem of identifying regions of congestion in closed queueing...
Large deviations analysis of the generalized processor sharing policy
Large deviations analysis of the generalized processor sharing policy
1999,
In this paper we consider a stochastic server (modeling a multiclass communication...
Individual customer's behaviour in networks with state-dependent arrival rates
Individual customer's behaviour in networks with state-dependent arrival rates
1999,
We consider Jackson networks with state-dependent arrival and service rates which show...
A note on the stability of the many-queue head-of-the line processor-sharing system with permanent customers
A note on the stability of the many-queue head-of-the line processor-sharing system with permanent customers
1999,
We consider a single server system consisting of n queues with different types of...
The output of a switch, or, effective bandwidths for networks
The output of a switch, or, effective bandwidths for networks
1999,
Consider a switch which queues traffic from many independent input flows. We show that...
Telecommunication traffic, queueing models, and subexponential distributions
Telecommunication traffic, queueing models, and subexponential distributions
1999,
This article reviews various models within the queueing framework which have been...
Asymptotics of stochastic networks with subexponential service times
Asymptotics of stochastic networks with subexponential service times
1999,
We analyse the tail behaviour of stationary response times in the class of open...
Steady-state asymptotics for tandem, split-match and other feedforward queues with heavy tailed service
Steady-state asymptotics for tandem, split-match and other feedforward queues with heavy tailed service
1999,
Consider a stable FIFO GI/GI/1→/GI/1 tandem queue in which the equilibrium...
Three management policies for a resource with partition constraints
Three management policies for a resource with partition constraints
1999,
Management of a bufferless resource is considered under non-homogeneous demand...
Performance analysis and design of supply chains: A Petri net approach
Performance analysis and design of supply chains: A Petri net approach
2000,
In this paper, we investigated a dynamic modelling technique for analysing supply...
Optimal design of a two-level transportation network with a different unit cost for each secondary link
Optimal design of a two-level transportation network with a different unit cost for each secondary link
1998,
The objective of this paper is to further develop Singhal's framework for designing a...
Papers per page: