Results 1 
7 of
7
Routing and Admission Control in General Topology Networks with Poisson Arrivals
 7th ACMSIAM Symposium on Discrete Algorithms
, 1996
"... Emerging high speed networks will carry traffic for services such as videoondemand and video teleconferencing  that require resource reservation along the path on which the traffic is sent. High bandwidthdelay product of these networks prevents circuit rerouting, i.e. once a circuit is routed o ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
Emerging high speed networks will carry traffic for services such as videoondemand and video teleconferencing  that require resource reservation along the path on which the traffic is sent. High bandwidthdelay product of these networks prevents circuit rerouting, i.e. once a circuit is routed on a certain path, the bandwidth taken by this circuit remains unavailable for the duration (holding time) of this circuit. As a result, such networks will need effective routing and admission control strategies. Recently developed online routing and admission control strategies have logarithmic competitive ratios with respect to the admission ratio (the fraction of admitted circuits). Such guarantees on performance are rather weak in the most interesting case where the rejection ratio of the optimum algorithm is very small or even 0. Unfortunately, these guarantees can not be improved in the context of the considered models, making it impossible to use these models to identify algorithms th...
Controlling Alternate Routing in GeneralMesh Packet Flow Networks
 In Proc. ACM SIGCOMM '94
, 1994
"... Highspeed packet networks will begin to support services that need QualityofService (QoS) guarantees. Guaranteeing QoS typically translates to reserving resources for the duration of a call. We propose a statedependent routing scheme that builds on any base stateindependent routing scheme, by rou ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
Highspeed packet networks will begin to support services that need QualityofService (QoS) guarantees. Guaranteeing QoS typically translates to reserving resources for the duration of a call. We propose a statedependent routing scheme that builds on any base stateindependent routing scheme, by routing flows which are blocked on their primary paths (as selected by the stateindependent scheme) onto alternate paths in a manner that is guaranteedunder certain Poisson assumptionsto improve on the performance of the base stateindependent scheme. Our scheme only requires each node to have state information of those links that are incident on it. Such a scheme is of value when either the base stateindependent scheme is already in place and a complete overhaul of the routing algorithm is undesirable, or when the state (reserved flows) of a link changes fast enough that the timely update of state information is infeasible to all possible calloriginators. The performance improvements ...
Routing and Admission Control of Virtual Circuits in General Topology Networks
 In preparation
, 1994
"... Emerging high speed Broadband Integrated Services Digital Networks (BISDN) are expected to carry traffic for services like videoondemand and video teleconferencing which will require resource reservation along the path on which the traffic is sent. As a result, such networks will need efficient r ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
Emerging high speed Broadband Integrated Services Digital Networks (BISDN) are expected to carry traffic for services like videoondemand and video teleconferencing which will require resource reservation along the path on which the traffic is sent. As a result, such networks will need efficient routing and admission control algorithms. The simplest approach is to use fixed paths and no admission control. More sophisticated approaches which use state dependent routing and a form of admission control called trunk reservation can be found in the circuit switching literature. However, the circuit switching literature has generally focused on fully connected (complete) networks. This paper suggests a new routing and admission control algorithm for general topology networks. Our algorithm is an adaptation of a recently discovered theoretical algorithm that is asymptotically best possible with respect to the worst case performance. The main idea behind our algorithm was to improve the per...
HopbyHop Routing with NodeDependent Topology Information
 in IEEE INFOCOM'99
, 1999
"... This paper is focused on the problem of hopbyhop routing in a network where different nodes have different views of the network topology. In particular, each node may be aware of just a subset of the network links, perceiving the rest as if their cost was infinite. We formalize the idea of node's ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper is focused on the problem of hopbyhop routing in a network where different nodes have different views of the network topology. In particular, each node may be aware of just a subset of the network links, perceiving the rest as if their cost was infinite. We formalize the idea of node's individual view of the network with the concept of visibility sets and introduce a routing approach based on the notion of a feasible path, i.e., such path in the node's visibility set that satisfies certain specified restrictions. It is shown that, in a network with general visibility sets, forwarding the packet along an optimal feasible path is necessaryand sufficient to guarantee its eventual delivery to destination without being dropped or routed to the same node twice. Based on the proposed approach, we derive the precise routing policy and formulate an efficient algorithm to search for a family of onetoall optimal feasible paths in a network with embedded visibility sets. We then proceed to prove the correctness of the algorithm.
Efficient Continuous Algorithms For Combinatorial Optimization
, 1995
"... The thesis concentrates on design, analysis, and implementation of efficient algorithms for large scale optimization problems with special emphasis on problems related to network flows and routing in highspeed networks. The main focus is on using continuous techniques for solving large combinatoria ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The thesis concentrates on design, analysis, and implementation of efficient algorithms for large scale optimization problems with special emphasis on problems related to network flows and routing in highspeed networks. The main focus is on using continuous techniques for solving large combinatorial optimization problems in offline and online settings. Some of the major areas of work include: ffl Developing and implementing new interiorpoint techniques for efficiently solving large scale multicommodity network flow problems. These algorithms are based on solving linear and quadratic programming formulations of the problem. ffl Designing fast algorithms based on continuous methods for approximate solution of minimum cost multicommodity flow problem. These techniques are geared towards distributed implementation. ffl Application of multicommodity flow techniques for design and implementation of centralized and distributed algorithms for online routing of Virtual Circuits in AT...
Dynamic Routing of Telephone Traffic Using . . .
, 1996
"... In this thesis, the consequences of automating network management of telephone networks are examined. The role of network managers is to monitor the network for exceptional conditions and place controls into the network if necessary to deal with these network exceptions. One potential consequence ..."
Abstract
 Add to MetaCart
In this thesis, the consequences of automating network management of telephone networks are examined. The role of network managers is to monitor the network for exceptional conditions and place controls into the network if necessary to deal with these network exceptions. One potential consequence of automating network management is a network which is capable of adjusting itself quickly to changing tra c conditions, also known as a network with dynamic routing. Simulations are used to show that there are bene ts to be gained from implementing dynamic routing by automating the actions of the network managers. In this thesis, the application of learning techniques such as neural networks and linear predictors to the tasks of network tra c management is also examined. Three network management tasks considered are: (i) recognition of tra c patterns in the network (ii) learning suitable thresholds for network congestion control and (iii) time series prediction of trunk group occupancy. It is found that nonlinear learning techniques such as neural networks can give small gains over the more standard technique of linear predictors.