Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Allocating bandwidth for bursty connections
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Throughput-competitive admission control for continuous media databases
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Patience is a virtue: the effect of slack on competitiveness for admission control
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Competitive on-line scheduling of continuous-media streams
Journal of Computer and System Sciences
Admission Control to Minimize Rejections
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Optimal Link Capacity Dimensioning in Proportionally Fair Networks
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Predictive routing to enhance QoS for stream-based flows sharing excess bandwidth
Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
A node simulation tool for bandwidth allocation and CAC in ATM networks
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Prompt partial path optimization in MPLS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Patience is a virtue: the effect of slack on competitiveness for admission control
Journal of Scheduling - Special issue: On-line algorithm part I
Admission control with immediate notification
Journal of Scheduling - Special issue: On-line scheduling
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Routing demands with time-varying bandwidth profiles on a MPLS network
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Granularity Metric for Fine-Grain Real-Time Scheduling
IEEE Transactions on Computers
Rate adaptive multimedia streams: optimization and admission control
IEEE/ACM Transactions on Networking (TON)
Fast network re-optimization schemes for MPLS and optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Load-Balanced Short-Path Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
ACM Transactions on Sensor Networks (TOSN)
Energy-aware routing in sensor networks: A large system approach
Ad Hoc Networks
IEEE/ACM Transactions on Networking (TON)
Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
International Journal of Parallel, Emergent and Distributed Systems
An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks
Computer Communications
Fast network re-optimization schemes for MPLS and optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing demands with time-varying bandwidth profiles on a MPLS network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast network re-optimization schemes for MPLS and optical networks
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Throughput-competitive advance reservation with bounded path dispersion
IEEE/ACM Transactions on Networking (TON)
Generalized secure routerless routing
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Research: A new distributed routing algorithm for supporting delay-sensitive applications
Computer Communications
A QoS-based routing algorithm for PNNI ATM networks
Computer Communications
Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing
Computer Communications
Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
Computer Communications
A virtual path routing algorithm for ATM networks based on the equivalent bandwidth concept
Computer Communications
| Hi-index | 0.08 |
Classical routing and admission control strategies achieve provably good performance by relying on an assumption that the virtual circuits arrival pattern can be described by some a priori known probabilistic model. A new on-line routing framework, based on the notion of competitive analysis, was proposed. This framework is geared toward design of strategies that have provably good performance even in the case where there are no statistical assumptions on the arrival pattern and parameters of the virtual circuits. The on-line strategies motivated by this framework are quite different from the min-hop and reservation-based strategies. This paper surveys the on-line routing framework, the proposed routing and admission control strategies, and discusses some of the implementation issues