A Call Admission Control for Service Differentiation and Fairness Management in WDM Grooming Networks[对服务差异化和公平管理WDM疏导网络中的呼叫接纳控制](PPT-53)精选.pptVIP

Matlab toolbox calculation * Heuristic decomposition algorithm Step 1: For each hop i, partition the set of available wavelengths into subsets, dedicated to each of o-d pairs using hop i. Step 2: Assume uniformly distributed among the Wm wavelengths, thus, the arrival rate of class ck for each of the Wm wavelengths is given by: λk/Wm. * Heuristic decomposition algorithm (2) Step 3: Compute the CAC policy with respect to λk/Wm. Step 4: Using the CAC policy computed in Step 3, we determine the optimal action for each of the Wm wavelengths, individually. * Performance comparison * Performance comparison * Performance comparison * Performance comparison * Relation to our work We can utilize MDP to model our bandwidth allocation problem in call admission control to achieve fairness; But in heterogeneous network the bandwidth granularity problem is still there; * Possible Constrains Under some conditions the optimal policy of an MDP exists. * * Backup Other MDP representations * Markov Assumption Markov Assumption: The next state’s conditional probability depends only on a finite history of previous states (RN) kth order Markov Process Andrei Markov (1913) The definitions are equivalent!!! Any algorithm that makes the 1st order Markov Assumption can be applied to any Markov Process Markov Assumption: The next state’s conditional probability depends only on its immediately previous state (JB) 1st order Markov Process Originate from David W. Kirsch’s slides * MDP A Markov Decision Process (MDP) model contains: A set of possible world states S A set of possible actions A A real valued reward function R(s,a) A description T(s,a) of each action’s effects in each state. * MDP differs DTMC A Markov Decision Process (MDP) is just like a Markov Chain, except the transition matrix depends on the action taken by the decision maker (agent) at each time step. Ps,a,s = P [S(t+1)=s | S(t)=s, A(t)=a] The agent receives a reward R(s,a), which depends on the action and the stat