Keyword: communications

Found 323 papers in total
Fine-tuning a tabu search algorithm with statistical tests
Fine-tuning a tabu search algorithm with statistical tests
1998,
Tabu Search is a metaheuristic that has proven to be very effective for solving...
Fast heuristics for protection networks for dynamic routing
Fast heuristics for protection networks for dynamic routing
1999,
Traffic volatility and network reliability are important issues in the provision of...
Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty
Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty
1998,
The problem of expanding the capacity of a single facility in telecommunications...
Introducing system dynamics to the BBC World Service: An insider perspective
Introducing system dynamics to the BBC World Service: An insider perspective
1999,
The paper relates the story of the encounter between system dynamics modelling and the...
Queueing analysis of CDMA unslotted ALOHA systems with finite buffers
Queueing analysis of CDMA unslotted ALOHA systems with finite buffers
1998,
CDMA unslotted ALOHA system with finite size of queueing buffers is discussed in this...
Optimisation problems in mobile networks planning
Optimisation problems in mobile networks planning
1998,
In this paper we present three planning problems in the field of Radio Mobile Systems,...
Goal programming regression with serial correlation: Policy implications for Japanese telecommunications infrastructure development
Goal programming regression with serial correlation: Policy implications for Japanese telecommunications infrastructure development
1998,
This study proposes a new use of Goal Programming (GP) for time-series regression,...
Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
1998,
We study a problem that has arisen recently in the design of telecommunications...
An explicit solution for an M/GI/1/N queue with vacation time and exhaustive service discipline
An explicit solution for an M/GI/1/N queue with vacation time and exhaustive service discipline
1998,
We consider an M/GI/1/N queue with vacation time and exhaustive service discipline. We...
Theory of maximum packing and related channel assignment strategies for cellular radio networks
Theory of maximum packing and related channel assignment strategies for cellular radio networks
1998,
The maximum packing (MP) policy for dynamic channel assignment in cellular radio...
Least possible time paths in stochastic, time-varying networks
Least possible time paths in stochastic, time-varying networks
1998,
In this paper, two computationally efficient algorithms are presented for determining...
Structural optimization in limited access trunk groups
Structural optimization in limited access trunk groups
1998,
The limited-access trunk group is a class of service system in which an arriving call...
Analysis of a multi-server queueing model of Available Bit Rate
Analysis of a multi-server queueing model of Available Bit Rate
1998,
In this paper we present a queueing model for the performance analysis of Available...
Some reflections on the renewal-theory paradox in queueing theory
Some reflections on the renewal-theory paradox in queueing theory
1998,
The classical renewal-theory (waiting time, or inspection) paradox states that the...
Performance evaluation of SVC-based IP-over-ATM networks
Performance evaluation of SVC-based IP-over-ATM networks
1998,
We propose a finite-capacity single-vacation model, with close-down/setup times and a...
Application of smoothed perturbation analysis to a discrete-time stationary queue
Application of smoothed perturbation analysis to a discrete-time stationary queue
1998,
We investigate the sensitivity analysis for a discrete-time queueing system using...
Network competition and the timing of commercials
Network competition and the timing of commercials
1998,
In a market with a small number of networks, the timing of the commercial breaks is a...
A cutting plane algorithm for multicommodity survivable network design problems
A cutting plane algorithm for multicommodity survivable network design problems
1998,
We present a cutting plane algorithm for solving the following telecommunications...
Interconnecting LANs and a FDDI backbone using transparent bridges: A model and solution algorithms
Interconnecting LANs and a FDDI backbone using transparent bridges: A model and solution algorithms
1998,
In this article, we construct a mathematical model to design the topology of a network...
A dual ascent procedure with valid inequalities for designing hierarchical network topologies
A dual ascent procedure with valid inequalities for designing hierarchical network topologies
1998,
Topological design of communication networks has been well examined in the literature....
Stability of p-persistent CSMA/CD
Stability of p-persistent CSMA/CD
1995,
A semi-Markovian model is developed for slotted p -persistent CSMA/CD with a finite...
Development of clustering algorithm for the design of telecommunication network considering cost–traffic tradeoff
Development of clustering algorithm for the design of telecommunication network considering cost–traffic tradeoff
1997,
In the design of telecommunication network, the network configuration using hubbing...
A polling model with retrial customers
A polling model with retrial customers
1997,
A polling model with n stations and switchover times is considered. The customers are...
Measuring efficiencies and Returns to Scale of Nippon Telegraph & Telephone in production and cost analyses
Measuring efficiencies and Returns to Scale of Nippon Telegraph & Telephone in production and cost analyses
1997,
This article provides a theoretical framework related to Data Envelopment Analysis...
Papers per page: