@article{huang_dutta_2007, title={Spare capacity provisioning for quasi-static traffic}, volume={51}, ISSN={["1872-7069"]}, DOI={10.1016/j.comnet.2007.08.006}, abstractNote={Resource provisioning has for long been an important area of research in network design. The traffic grooming problem in optical networks is a design problem of aggregating sub-wavelength traffic demands onto lightpaths and lightpaths onto fiber links such that the required electronic switching capability, hence network cost, can be minimized. Because of the reconfiguration cost in optical grooming networks, a reactive resource provisioning approach may become inefficient, and result in revenue loss. In this paper, we propose an over-provisioning scheme, which pre-allocates the spare capacity of lightpaths to dynamic sub-wavelength traffic demands such that the network can be more agile in responding to traffic increment requests. For the single-link case, we formulate the problem as a non-linear programming problem, and for under reasonable assumptions, we prove the objective function is convex. We provide an exact algorithm to find the optimal solution. The problem with general topologies is then studied. We prove the NP-hardness in this case, and propose heuristics. Numerical results show our heuristics perform well.}, number={18}, journal={COMPUTER NETWORKS}, author={Huang, Shu and Dutta, Rudra}, year={2007}, month={Dec}, pages={5011–5035} }
@article{huang_dutta_rouskas_2006, title={Traffic grooming in path, star, and tree networks: Complexity, bounds, and algorithms}, volume={24}, ISSN={["1558-0008"]}, DOI={10.1109/jsac-ocn.2006.04006}, number={4}, journal={IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS}, author={Huang, Shu and Dutta, Rudra and Rouskas, George N.}, year={2006}, month={Apr}, pages={66–82} }