Optimal resource allocation and fairness control in all-optical WDM networks

Abstract

Abstract-This paper investigates the problem of optimal wavelength allocation and fairness control in all-optical wavelengthdivision-multiplexing networks. A fundamental network topology, consisting of a two-hop path network, is studied for three classes of traffic. Each class corresponds to a source-destination pair. For each class, call interarrival and holding times are exponentially distributed. The objective is to determine a wavelength allocation policy in order to maximize the weighted sum of users of all classes (i.e., class-based utilization). This method is able to provide differentiated services and fairness management in the network. The problem can be formulated as a Markov decision process (MDP) to compute the optimal allocation policy. The policy iteration algorithm is employed to numerically compute the optimal allocation policy. It has been analytically and numerically shown that the optimal policy has the form of a monotonic nondecreasing switching curve for each class. Since the implementation of an MDP-based allocation scheme is practically infeasible for realistic networks, we develop approximations and derive a heuristic algorithm for ring networks. Simulation results compare the performance of the optimal policy and the heuristic algorithm, with those of complete sharing and complete partitioning policies.Index Terms-Dynamic wavelength allocation, Markov decision process (MDP), monotonic optimal policy, wavelength-division multiplexing (WDM).

Fair admission control scheme based on conditional preemption in traffic-groomed optical networks

“…Mosharaf et al [14] proposed a dynamic partitioning CAC mechanism which adjusted the bandwidth reservation for different classes of request in accordance with the status of the network system. The adjustment process was triggered each time the system finished servicing a connection request, and prompted the CAC mechanism to decide whether or not the released bandwidth should still be reserved for the same class of requests.…”

“…The adjustment process was triggered each time the system finished servicing a connection request, and prompted the CAC mechanism to decide whether or not the released bandwidth should still be reserved for the same class of requests. In [14], the class of each connection request is defined in accordance with the routing path length, i.e. each class is assumed to have the same bandwidth requirement.…”

Optimally solving Markov decision processes with total expected discounted reward function: Linear programming revisited

“…al. [18] 2008 LP Bello et al [9] 2006 LP Le Ny et al [34] 2006 LP Sun [12] 2011 PIA Sandikci et al [39] 2008 PIA Alagoz et al [5] 2007 PIA Alagoz et al [6] 2007 PIA Idoumghar et al [24] 2006 PIA Kuppuswamy et al [27] 2005 PIA Chang et al [13] 2005 PIA Mosharaf et al [33] 2005 PIA Flapper et. al.…”

A recursive algorithm for bandwidth partitioning

“…This classical problem also appears in a wavelength division multiplexed network, see e.g. [3]. The two simplest admission control policies are complete sharing (in which all connections share the entire link bandwidth and a connection is admitted if there is sufficient free bandwidth on the link) and complete partitioning (in which the link bandwidth is partitioned among classes and a connection is admitted if there is sufficient free bandwidth in that class's allocation).…”