Circuit allocation in all optical networks with average packet delay cost criterion

An optimal circuit allocation problem for all-optical circuit-switched backbone networks with average packet delay cost criterion is considered. Multiple classes of traffic flows arrive at the network edge routers, where they can be queued until an end-to-end optical circuit can be allocated. Assumi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2006-05, Vol.51 (5), p.862-867
Main Author: Rosberg, Z.
Format: Article
Language:English
Subjects:
Adaptive control
All-optical networks
Allocations
Applied sciences
Automatic control
Circuit switching
Circuits
Computer science
control theory
systems
Control systems
Control theory. Systems
Cost function
Criteria
Delay
Exact sciences and technology
golden ratio
High speed optical techniques
Intelligent networks
Lower bounds
Markov decision processes
Networks
Optical feedback
optical networks
packet delay
Policies
Sliding mode control
Switching circuits
TDM
Traffic flow
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An optimal circuit allocation problem for all-optical circuit-switched backbone networks with average packet delay cost criterion is considered. Multiple classes of traffic flows arrive at the network edge routers, where they can be queued until an end-to-end optical circuit can be allocated. Assuming fluid traffic and circuit allocation of fixed periods, a lower bound on the optimal average packet delay is derived and the cost of two allocation policies are evaluated exactly. The cost of both policies are demonstrated for a variety of deterministic and random networks and are compared with the lower bound.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2006.875004