Country: Switzerland

Found 927 papers in total
State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design
State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design
1992,
The authors investigate a distributed, state-dependent, dynamic routing strategy for...
Computational algorithms for blocking probabilities in circuit-switched networks
Computational algorithms for blocking probabilities in circuit-switched networks
1992,
In this paper, the authors develop two new general purpose recursive algorithms for...
Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
1992,
Separable routing is the first of a number of routing schemes for circuit switched...
On product form approximations for communication networks with losses: Error bounds
On product form approximations for communication networks with losses: Error bounds
1992,
This paper studies communication networks with packet or message losses due to...
Performance modeling of heterogeneous data networks
Performance modeling of heterogeneous data networks
1992,
A heterogeneous data network consists of Local Area Networks (LANs) interconnected...
Performance evaluation of polling systems by means of the power-series algorithm
Performance evaluation of polling systems by means of the power-series algorithm
1992,
Polling systems are widely used to model communication networks with several classes...
Stochastic models of space priority mechanisms with Markovian arrival processes
Stochastic models of space priority mechanisms with Markovian arrival processes
1992,
In this paper, the authors study a single-server queue with finite capacity in which...
Performance analysis of virtual circuit connections for bursty data sources in ATM networks
Performance analysis of virtual circuit connections for bursty data sources in ATM networks
1992,
ATM is a packet-like transmission mode that has been proposed for BISDN. It is...
Time-average and asymptotically optimal flow control policies in networks with multiple transmitters
Time-average and asymptotically optimal flow control policies in networks with multiple transmitters
1992,
The authors consider M transmitting stations sending packets to a single receiver over...
Price caps
Price caps
1992,
Price-cap regulation of AT&T, which became effective on July 1, 1989, is an...
Topological design of telecommunications networks-Local access design methods
Topological design of telecommunications networks-Local access design methods
1991,
Computer communication networks and telecommunication systems are growing at an...
Alternatives for reliable and quality telecommunication network design
Alternatives for reliable and quality telecommunication network design
1991,
In today’s highly competitive telecommunication market, customers expect and...
Models for planning capacity expansion in local access telecommunications networks
Models for planning capacity expansion in local access telecommunications networks
1991,
The rapid progress of communications technology has created new opportunities for...
Dynamic programming based heuristics for the topological design of local access networks
Dynamic programming based heuristics for the topological design of local access networks
1991,
This paper deals with the terminal layout problem, which is a problem arising in data...
Algorithms for recognition of regular properties and decomposition of recursive graph families
Algorithms for recognition of regular properties and decomposition of recursive graph families
1991,
This paper focuses on two themes within the broad context of recursively definable...
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
1991,
Given a graph G , the maximum cut problem consists of finding the subset S of vertices...
Some properties of graph centroids
Some properties of graph centroids
1991,
The concept of a branch weight centroid has been extended in [12] so that it can be...
Finding minimum cost directed trees with demands and capacities
Finding minimum cost directed trees with demands and capacities
1991,
Given a directed graph, the authors consider the problem of finding a rooted directed...
On Steiner ratio conjectures
On Steiner ratio conjectures
1991,
Let M be a metric space and P a finite set of points in M. The Steiner ratio in M is...
Multiterminal xcut problems
Multiterminal xcut problems
1991,
An xcut of a set is defined to be a partition of V into two disjoint nonempty subsets...
The multi-weighted Steiner tree problem
The multi-weighted Steiner tree problem
1991,
The authors formulate and investigate the Multi-Weighted Steiner Problem (MWS), a...
An approach for the Steiner problem in directed graphs
An approach for the Steiner problem in directed graphs
1991,
The authors present a scheme to solve the Steiner problem in directed graphs using a...
A variational approach to the Steiner network problem
A variational approach to the Steiner network problem
1991,
Suppose n points are given in the plane. Their coordinates form a 2n -vector X . To...
The Steiner ratio for five points
The Steiner ratio for five points
1991,
It was conjectured by Gilbert and Pollak that for any finite set of points in the...
Papers per page: