Demand assigned capacity management (DACM) in IP over optical (IPO) networks

• Published in: IEEE/ACM transactions on networking Vol. 14; no. 4; pp. 900 - 913
• Main Authors: Awduche, D.O., Jabbari, B.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.08.2006; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: ASON; Bandwidth; bandwidth replenishment; Bandwidths; capacity management; Communication system traffic control; Computer networks; Costs; Demand; demand assigned capacity management; Fiber optic networks; GMPLS; integrated traffic engineering; Internet Protocol; Inventory; Inventory management; IP (Internet Protocol); IP networks; IP over optical networks; IPO; Marketing; Mathematical model; MPLS; network performance optimization; Networks; Optical fiber networks; Replenishment; Routing; Studies; Telecommunication traffic; Traffic control; Traffic engineering; Traffic flow
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2006.879700

The demand assigned capacity management (DACM) problem in IP over optical (IPO) network aims at devising efficient bandwidth replenishment schedules from the optical domain conditioned upon traffic evolution processes in the IP domain. A replenishment schedule specifies the location, sizing, and sequencing of link capacity expansions to support the growth of Internet traffic demand in the IP network subject to economic considerations. A major distinction in the approach presented in this paper is the focus of attention on the economics of "excess bandwidth" in the IP domain, which can be viewed as an inventory system that is endowed with fixed and variable costs and depletes with increase in IP traffic demand requiring replenishment from the optical domain. We develop mathematical models to address the DACM problem in IPO networks based on a class of inventory management replenishment methods. We apply the technique to IPO networks that implement capacity adaptive routing in the IP domain and networks without capacity adaptive routing. We analyze the performance characteristics under both scenarios, in terms of minimizing cumulative replenishment cost over an interval of time. For the non-capacity adaptive routing scenario, we consider a shortest path approach in the IP domain, specifically OSPF. For the capacity adaptive scenario, we use an online constraint-based routing scheme. This study represents an application of integrated traffic engineering which concerns collaborative decision making targeted towards network performance improvement that takes into consideration traffic demands, control capabilities, and network assets at different levels in the network hierarchy