On Optimal Single Link Allocation of Spare Capacity for Dynamic Traffic Grooming

@inproceedings{Huang2005OnOS,
  title={On Optimal Single Link Allocation of Spare Capacity for Dynamic Traffic Grooming},
  author={Shu Huang and Rudra Dutta},
  year={2005}
}
In optical networks, the problem of transporting subwavelength traffic over optical circuits to minimize network cost is known as traffic grooming. Recently the problem of grooming time-varying traffic flows has been considered. An attractive model of traffic variation involves increment and decrement requests from individual traffic components. A problem of utilizing spare capacity by overprovisioning each subwavelength traffic demand component has been considered in the literature. We… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…