-
作者：TSENG, KH; HSIAO, MTT
摘要：The optimal control of arrivals to a two-station token ring network is analyzed in this paper. By adopting a maximum system throughput under a system time-delay constraint optimality criterion, we study a network optimality problem with the assumption that both stations have global information (i.e., the number of packers at each station). The controlled arrivals are assumed to be state-dependent Poisson streams and have exponentially distributed service time. The optimality problem will be fo...
-
作者：LEE, MJ; YEE, JR
作者单位：University of Hawaii System
摘要：A reconfigurable network is a circuit-switched network where the effective topology and capacities can be dynamically adapted to changes in the traffic requirements or to changes in the structure of the network due to failures. The application of reconfigurable networks considered in this paper is data communications. We formulated the joint topology, capacity and routing problem in a reconfigurable network as a nonlinear, mixed integer programming problem. To solve this problem, we present a ...
-
作者：CHANG, CS
作者单位：International Business Machines (IBM); IBM USA
摘要：Unlike the leaky-bucket scheme which regulates the input rare, the filters we study in this paper reduce the variability of interarrival times (subject to a maximum delay constraint for each customer). These filters are called smoothing filters for point processes. By considering the output processes of various queueing systems, we show that an infinite-server queue acts as a smoothing filter for a doubly stochastic Poisson process, and a single-server queue with deterministic service times ac...
-
作者：GOUVEIA, L
摘要：In this paper we present a new formulation for the Capacitated Minimal Spanning Tree (CMST) problem. One advantage of the new formulation is that ii is more compact (in the number of constraints) than a well-known formulation. Additionally, we show that the linear programming relaxation of both formulations produces optimal solutions with the same cost. We present a brief discussion concerning valid inequalities for the CMST which are directly derived from the new formulation. We show that som...
-
作者：MAGNANTI, TL; MIRCHANDANI, P; VACHANI, R
作者单位：Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh
摘要：This paper studies a topical and economically significant capacitated network design problem that arises in the telecommunications industry. in this problem, given point-to-point communication demand in a network must be met by installing (loading) capacitated facilities on the arcs: Loading a facility incurs an are specific and facility dependent cost. This paper develops modeling and solution approaches for loading facilities to satisfy the given demand at minimum cost. We consider two appro...
-
作者：MA, BNW; MARK, JW
作者单位：University of Waterloo
摘要：A relatively robust method for the approximate analysis of the mean queue length of an M/G/c queueing system is proposed. The approximation method is developed based on the following assumptions: the residual service time of one busy server is independent of those if the other busy servers, and the system in which all the servers are busy is treated in the same way as a single-server system with c times the service rate of one of the servers. The application of these Mo assumptions is coupled ...
-
作者：SMITH, DE
摘要：We study a multiserver queueing system in which delays influence service times. The system arises in a proposed application of speech compression technology to telephone directory assistance. Customers who must wait for service record their service requests and these are compressed and played to a server as soon as one becomes available (even if the customer is still talking). The longer the delay, the larger the portion of the request that may be compressed, and hence the larger the service t...
-
作者：HAREL, A; STULMAN, A
作者单位：St. John's University
摘要：Service in a loop-based polling system consists of a single server moving around a closed tour, stopping to perform services wherever requests are encountered. There are N stations (unit buffer queues) spaced one unit of distance apart, and the server moves at a unit speed. All queues are identical, and the service time is deterministic. We compare the two well known cyclic polling and greedy servers with a new control policy called the horizon server. The cyclic polling server moves in one di...
-
作者：SANIEE, I
摘要：The minimum cost multiperiod capacity expansion of one location in telecommunications network planning can be formulated as a time-dependent knapsack problem. The problem consists of meeting integral demands at distinct time periods at minimum total discounted cost through a selection of items (with integral costs and capacities) from a collection of N distinct types of objects. This note presents an efficient pseudopolynomial time solution to this time-dependent knapsack problem. The techniqu...
