|
Student: Ngok Lam, Ph.D. student
Supervisor: Prof. Lorne G. Mason
Abstract: We studied a class of Service Overlay Network (SON)
capacity allocation problem. By analyzing the problem with two
different nonlinear optimization formulations, we show that the prices
of offering service guarantees are closely related to a set of Lagrange
multipliers. Moreover, if the Grade of service (GoS) constraints are
not hard requirements, the network design resulting from the set of
prices is on the Pareto frontier of a bi-objective optimization problem.
A scheme was developed to derive the prices for various classes of
customers by referring to the Lagrange multipliers. The major
contribution of the article is the use of the Lagrange multipliers to
provide a set of Pareto efficient prices in providing GoS guarantees.
[Full Description] [Paper (pdf format)]
|
Return to Service Overlay Networks Projects