The Experts below are selected from a list of 11460 Experts worldwide ranked by ideXlab platform
Zhi-li Zhang - One of the best experts on this subject based on the ideXlab platform.
-
distributed algorithm for Service replication in Service Overlay network
Lecture Notes in Computer Science, 2004Co-Authors: K.y.k. Liu, John C.s. Lui, Zhi-li ZhangAbstract:The Service Overlay network (SON) is an effective mean to deploy end-to-end QoS guaranteed content delivery Services on the current Internet. We model the content delivery Service on a SON as a Service delivery tree (SDT). Previous studies have addressed the optimal distribution tree formulation issues. In this paper, we focus on the problem of maximizing the total operation profit of the SON. In [1], authors introduced a cost model for optimal bandwidth provisioning in SON. In this paper, we extended this concept and propose an alternative approach to maximize the total effective throughput of SDT as well as to minimize the QoS violation penalty of the SON by Service replication. We present both centralized and distributed algorithms for the placement of replicated servers on the SDT. Experiments are carried to quantify the merit, effectiveness and the scalability of the proposed Service replication algorithm. In particular, the performance gain is very close to the exhaustive search. The algorithm performs well when we scale up the Service Overlay networks. Finally, we show that one only needs to perform a small number of replications to attain the optimal gain.
-
On Service replication strategy for Service Overlay networks
2004 IEEE IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507), 2004Co-Authors: K.y.k. Liu, John C.s. Lui, Zhi-li ZhangAbstract:The Service Overlay network (SON) is an effective means to deliver end-to-end QoS guaranteed applications on the current Internet. Duan et al. (2002) address the bandwidth provisioning problem on a SON, specifically, in determining the appropriate amount of bandwidth capacity to purchase from various autonomous systems so as to satisfy the QoS requirements of the SON's end users and at the same time maximize the total revenue of operating the Overlay network. In this paper, we extend the concept of the Service Overlay network. Since traffic demands are time varying and there may be some unexpected events which can cause a traffic surge, these will significantly increase the probability of QoS violation and will reduce the profit margin of a SON. To overcome these problems, we propose to replicate Services on the Service gateways so as to dynamically adapt to these traffic surges. We show that the Service replication problem, in general, is intractable. We propose an efficient Service replication algorithm which replicates Services for a subset of traffic flows. Under our replication strategy, one does not need to increase the bandwidth capacity of underlying links and at the same time, be able to increase the average profit for the Overlay network. Experiments are carried out to illustrate that replication algorithm provides higher flexibility during traffic fluctuations and can quickly find a near-optimal solution.
-
NETWORKING - Distributed algorithm for Service replication in Service Overlay network
Lecture Notes in Computer Science, 2004Co-Authors: K.y.k. Liu, John C.s. Lui, Zhi-li ZhangAbstract:The Service Overlay network (SON) is an effective mean to deploy end-to-end QoS guaranteed content delivery Services on the current Internet. We model the content delivery Service on a SON as a Service delivery tree (SDT). Previous studies have addressed the optimal distribution tree formulation issues. In this paper, we focus on the problem of maximizing the total operation profit of the SON. In [1], authors introduced a cost model for optimal bandwidth provisioning in SON. In this paper, we extended this concept and propose an alternative approach to maximize the total effective throughput of SDT as well as to minimize the QoS violation penalty of the SON by Service replication. We present both centralized and distributed algorithms for the placement of replicated servers on the SDT. Experiments are carried to quantify the merit, effectiveness and the scalability of the proposed Service replication algorithm. In particular, the performance gain is very close to the exhaustive search. The algorithm performs well when we scale up the Service Overlay networks. Finally, we show that one only needs to perform a small number of replications to attain the optimal gain.
-
Service Overlay networks slas qos and bandwidth provisioning
IEEE ACM Transactions on Networking, 2003Co-Authors: Zhenhai Dua, Zhi-li Zhang, Y T HouAbstract:We advocate the notion of Service Overlay network (SON) as an effective means to address some of the issues, in particular, end-to-end quality of Service (QoS), plaguing the current Internet, and to facilitate the creation and deployment of value-added Internet Services such as VoIP, Video-on-Demand, and other emerging QoS-sensitive Services. The SON purchases bandwidth with certain QoS guarantees from the individual network domains via bilateral Service level agreement (SLA) to build a logical end-to-end Service delivery infrastructure on top of the existing data transport networks. Via a Service contract, users directly pay the SON for using the value-added Services provided by the SON. In this paper, we study the bandwidth provisioning problem for a SON which buys bandwidth from the underlying network domains to provide end-to-end value-added QoS sensitive Services such as VoIP and Video-on-Demand. A key problem in the SON deployment is the problem of bandwidth provisioning, which is critical to cost recovery in deploying and operating the value-added Services over the SON. The paper is devoted to the study of this problem. We formulate the bandwidth provisioning problem mathematically, taking various factors such as SLA, Service QoS, traffic demand distributions, and bandwidth costs. Analytical models and approximate solutions are developed for both static and dynamic bandwidth provisioning. Numerical studies are also performed to illustrate the properties of the proposed solutions and demonstrate the effect of traffic demand distributions and bandwidth costs on SON bandwidth provisioning.
-
Service Overlay networks slas qos and bandwidth provisioning
International Conference on Network Protocols, 2002Co-Authors: Zhenhai Dua, Zhi-li Zhang, Y T HouAbstract:We advocate the notion of Service Overlay network (SON) as an effective means to address some of the issues, in particular end-to-end QoS, plaguing the current Internet, and to facilitate the creation and deployment of value-added Internet Services such as VoIP, video-on-demand, and other emerging QoS-sensitive Services. A SON purchases bandwidth with certain QoS guarantees from individual network domains via a bilateral Service level agreement (SLA) to build a logical end-to-end Service delivery infrastructure on top of existing data transport networks. Via a Service contract, users directly pay the SON provider for using the value-added Services provided by the SON. We study the bandwidth provisioning problem for a Service Overlay network which is critical to the cost recovery in deploying and operating value-added Services over the SON. We mathematically formulate the bandwidth provisioning problem, taking into account various factors such as SLA, Service QoS, traffic demand distributions, and bandwidth costs. Analytical models and approximate solutions are developed for both static and dynamic bandwidth provisioning. Numerical studies are also performed to illustrate the properties of the proposed solutions and demonstrate the effect of traffic demand distributions and bandwidth costs on the bandwidth provisioning of a SON.
K.y.k. Liu - One of the best experts on this subject based on the ideXlab platform.
-
distributed algorithm for Service replication in Service Overlay network
Lecture Notes in Computer Science, 2004Co-Authors: K.y.k. Liu, John C.s. Lui, Zhi-li ZhangAbstract:The Service Overlay network (SON) is an effective mean to deploy end-to-end QoS guaranteed content delivery Services on the current Internet. We model the content delivery Service on a SON as a Service delivery tree (SDT). Previous studies have addressed the optimal distribution tree formulation issues. In this paper, we focus on the problem of maximizing the total operation profit of the SON. In [1], authors introduced a cost model for optimal bandwidth provisioning in SON. In this paper, we extended this concept and propose an alternative approach to maximize the total effective throughput of SDT as well as to minimize the QoS violation penalty of the SON by Service replication. We present both centralized and distributed algorithms for the placement of replicated servers on the SDT. Experiments are carried to quantify the merit, effectiveness and the scalability of the proposed Service replication algorithm. In particular, the performance gain is very close to the exhaustive search. The algorithm performs well when we scale up the Service Overlay networks. Finally, we show that one only needs to perform a small number of replications to attain the optimal gain.
-
On Service replication strategy for Service Overlay networks
2004 IEEE IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507), 2004Co-Authors: K.y.k. Liu, John C.s. Lui, Zhi-li ZhangAbstract:The Service Overlay network (SON) is an effective means to deliver end-to-end QoS guaranteed applications on the current Internet. Duan et al. (2002) address the bandwidth provisioning problem on a SON, specifically, in determining the appropriate amount of bandwidth capacity to purchase from various autonomous systems so as to satisfy the QoS requirements of the SON's end users and at the same time maximize the total revenue of operating the Overlay network. In this paper, we extend the concept of the Service Overlay network. Since traffic demands are time varying and there may be some unexpected events which can cause a traffic surge, these will significantly increase the probability of QoS violation and will reduce the profit margin of a SON. To overcome these problems, we propose to replicate Services on the Service gateways so as to dynamically adapt to these traffic surges. We show that the Service replication problem, in general, is intractable. We propose an efficient Service replication algorithm which replicates Services for a subset of traffic flows. Under our replication strategy, one does not need to increase the bandwidth capacity of underlying links and at the same time, be able to increase the average profit for the Overlay network. Experiments are carried out to illustrate that replication algorithm provides higher flexibility during traffic fluctuations and can quickly find a near-optimal solution.
-
NETWORKING - Distributed algorithm for Service replication in Service Overlay network
Lecture Notes in Computer Science, 2004Co-Authors: K.y.k. Liu, John C.s. Lui, Zhi-li ZhangAbstract:The Service Overlay network (SON) is an effective mean to deploy end-to-end QoS guaranteed content delivery Services on the current Internet. We model the content delivery Service on a SON as a Service delivery tree (SDT). Previous studies have addressed the optimal distribution tree formulation issues. In this paper, we focus on the problem of maximizing the total operation profit of the SON. In [1], authors introduced a cost model for optimal bandwidth provisioning in SON. In this paper, we extended this concept and propose an alternative approach to maximize the total effective throughput of SDT as well as to minimize the QoS violation penalty of the SON by Service replication. We present both centralized and distributed algorithms for the placement of replicated servers on the SDT. Experiments are carried to quantify the merit, effectiveness and the scalability of the proposed Service replication algorithm. In particular, the performance gain is very close to the exhaustive search. The algorithm performs well when we scale up the Service Overlay networks. Finally, we show that one only needs to perform a small number of replications to attain the optimal gain.
-
NOMS (1) - On Service replication strategy for Service Overlay networks
2004 IEEE IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507), 1Co-Authors: K.y.k. Liu, John C.s. Lui, Zhi-li ZhangAbstract:The Service Overlay network (SON) is an effective means to deliver end-to-end QoS guaranteed applications on the current Internet. Duan et al. (2002) address the bandwidth provisioning problem on a SON, specifically, in determining the appropriate amount of bandwidth capacity to purchase from various autonomous systems so as to satisfy the QoS requirements of the SON's end users and at the same time maximize the total revenue of operating the Overlay network. In this paper, we extend the concept of the Service Overlay network. Since traffic demands are time varying and there may be some unexpected events which can cause a traffic surge, these will significantly increase the probability of QoS violation and will reduce the profit margin of a SON. To overcome these problems, we propose to replicate Services on the Service gateways so as to dynamically adapt to these traffic surges. We show that the Service replication problem, in general, is intractable. We propose an efficient Service replication algorithm which replicates Services for a subset of traffic flows. Under our replication strategy, one does not need to increase the bandwidth capacity of underlying links and at the same time, be able to increase the average profit for the Overlay network. Experiments are carried out to illustrate that replication algorithm provides higher flexibility during traffic fluctuations and can quickly find a near-optimal solution.
Y T Hou - One of the best experts on this subject based on the ideXlab platform.
-
Service Overlay networks slas qos and bandwidth provisioning
IEEE ACM Transactions on Networking, 2003Co-Authors: Zhenhai Dua, Zhi-li Zhang, Y T HouAbstract:We advocate the notion of Service Overlay network (SON) as an effective means to address some of the issues, in particular, end-to-end quality of Service (QoS), plaguing the current Internet, and to facilitate the creation and deployment of value-added Internet Services such as VoIP, Video-on-Demand, and other emerging QoS-sensitive Services. The SON purchases bandwidth with certain QoS guarantees from the individual network domains via bilateral Service level agreement (SLA) to build a logical end-to-end Service delivery infrastructure on top of the existing data transport networks. Via a Service contract, users directly pay the SON for using the value-added Services provided by the SON. In this paper, we study the bandwidth provisioning problem for a SON which buys bandwidth from the underlying network domains to provide end-to-end value-added QoS sensitive Services such as VoIP and Video-on-Demand. A key problem in the SON deployment is the problem of bandwidth provisioning, which is critical to cost recovery in deploying and operating the value-added Services over the SON. The paper is devoted to the study of this problem. We formulate the bandwidth provisioning problem mathematically, taking various factors such as SLA, Service QoS, traffic demand distributions, and bandwidth costs. Analytical models and approximate solutions are developed for both static and dynamic bandwidth provisioning. Numerical studies are also performed to illustrate the properties of the proposed solutions and demonstrate the effect of traffic demand distributions and bandwidth costs on SON bandwidth provisioning.
-
Service Overlay networks slas qos and bandwidth provisioning
International Conference on Network Protocols, 2002Co-Authors: Zhenhai Dua, Zhi-li Zhang, Y T HouAbstract:We advocate the notion of Service Overlay network (SON) as an effective means to address some of the issues, in particular end-to-end QoS, plaguing the current Internet, and to facilitate the creation and deployment of value-added Internet Services such as VoIP, video-on-demand, and other emerging QoS-sensitive Services. A SON purchases bandwidth with certain QoS guarantees from individual network domains via a bilateral Service level agreement (SLA) to build a logical end-to-end Service delivery infrastructure on top of existing data transport networks. Via a Service contract, users directly pay the SON provider for using the value-added Services provided by the SON. We study the bandwidth provisioning problem for a Service Overlay network which is critical to the cost recovery in deploying and operating value-added Services over the SON. We mathematically formulate the bandwidth provisioning problem, taking into account various factors such as SLA, Service QoS, traffic demand distributions, and bandwidth costs. Analytical models and approximate solutions are developed for both static and dynamic bandwidth provisioning. Numerical studies are also performed to illustrate the properties of the proposed solutions and demonstrate the effect of traffic demand distributions and bandwidth costs on the bandwidth provisioning of a SON.
-
Bandwidth provisioning for Service Overlay networks
Scalability and Traffic Control in IP Networks II, 2002Co-Authors: Zhenhai Duan, Zhi-li Zhang, Y T HouAbstract:In this paper we study the bandwidth provisioning problem for a Service Overlay network which buys bandwidth from the underlying network domains to provide end-to-end value-added QoS sensitive Services such as VoIP and Video-on-Demand. A key problem in the SON deployment is the problem of bandwidth provisioning, which is critical to the cost recovery in deploying and operating value-added Services over the SON. In this paper, we mathematically formulate the bandwidth provisioning problem, taking into account various factors such as SLA, Service QoS, traffic demand distributions, and bandwidth costs. Analytical models and approximate solutions are developed for long-term static bandwidth provisioning. Numerical studies are also performed to illustrate the properties of the proposed solution and demonstrate the effect of traffic demand distributions and bandwidth costs on the bandwidth provisioning of a SON.
-
ICNP - Service Overlay networks: SLAs, QoS and bandwidth provisioning
10th IEEE International Conference on Network Protocols 2002. Proceedings., 1Co-Authors: Zhenhai Duan, Zhi-li Zhang, Y T HouAbstract:We advocate the notion of Service Overlay network (SON) as an effective means to address some of the issues, in particular end-to-end QoS, plaguing the current Internet, and to facilitate the creation and deployment of value-added Internet Services such as VoIP, video-on-demand, and other emerging QoS-sensitive Services. A SON purchases bandwidth with certain QoS guarantees from individual network domains via a bilateral Service level agreement (SLA) to build a logical end-to-end Service delivery infrastructure on top of existing data transport networks. Via a Service contract, users directly pay the SON provider for using the value-added Services provided by the SON. We study the bandwidth provisioning problem for a Service Overlay network which is critical to the cost recovery in deploying and operating value-added Services over the SON. We mathematically formulate the bandwidth provisioning problem, taking into account various factors such as SLA, Service QoS, traffic demand distributions, and bandwidth costs. Analytical models and approximate solutions are developed for both static and dynamic bandwidth provisioning. Numerical studies are also performed to illustrate the properties of the proposed solutions and demonstrate the effect of traffic demand distributions and bandwidth costs on the bandwidth provisioning of a SON.
John C.s. Lui - One of the best experts on this subject based on the ideXlab platform.
-
distributed algorithm for Service replication in Service Overlay network
Lecture Notes in Computer Science, 2004Co-Authors: K.y.k. Liu, John C.s. Lui, Zhi-li ZhangAbstract:The Service Overlay network (SON) is an effective mean to deploy end-to-end QoS guaranteed content delivery Services on the current Internet. We model the content delivery Service on a SON as a Service delivery tree (SDT). Previous studies have addressed the optimal distribution tree formulation issues. In this paper, we focus on the problem of maximizing the total operation profit of the SON. In [1], authors introduced a cost model for optimal bandwidth provisioning in SON. In this paper, we extended this concept and propose an alternative approach to maximize the total effective throughput of SDT as well as to minimize the QoS violation penalty of the SON by Service replication. We present both centralized and distributed algorithms for the placement of replicated servers on the SDT. Experiments are carried to quantify the merit, effectiveness and the scalability of the proposed Service replication algorithm. In particular, the performance gain is very close to the exhaustive search. The algorithm performs well when we scale up the Service Overlay networks. Finally, we show that one only needs to perform a small number of replications to attain the optimal gain.
-
On Service replication strategy for Service Overlay networks
2004 IEEE IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507), 2004Co-Authors: K.y.k. Liu, John C.s. Lui, Zhi-li ZhangAbstract:The Service Overlay network (SON) is an effective means to deliver end-to-end QoS guaranteed applications on the current Internet. Duan et al. (2002) address the bandwidth provisioning problem on a SON, specifically, in determining the appropriate amount of bandwidth capacity to purchase from various autonomous systems so as to satisfy the QoS requirements of the SON's end users and at the same time maximize the total revenue of operating the Overlay network. In this paper, we extend the concept of the Service Overlay network. Since traffic demands are time varying and there may be some unexpected events which can cause a traffic surge, these will significantly increase the probability of QoS violation and will reduce the profit margin of a SON. To overcome these problems, we propose to replicate Services on the Service gateways so as to dynamically adapt to these traffic surges. We show that the Service replication problem, in general, is intractable. We propose an efficient Service replication algorithm which replicates Services for a subset of traffic flows. Under our replication strategy, one does not need to increase the bandwidth capacity of underlying links and at the same time, be able to increase the average profit for the Overlay network. Experiments are carried out to illustrate that replication algorithm provides higher flexibility during traffic fluctuations and can quickly find a near-optimal solution.
-
NETWORKING - Distributed algorithm for Service replication in Service Overlay network
Lecture Notes in Computer Science, 2004Co-Authors: K.y.k. Liu, John C.s. Lui, Zhi-li ZhangAbstract:The Service Overlay network (SON) is an effective mean to deploy end-to-end QoS guaranteed content delivery Services on the current Internet. We model the content delivery Service on a SON as a Service delivery tree (SDT). Previous studies have addressed the optimal distribution tree formulation issues. In this paper, we focus on the problem of maximizing the total operation profit of the SON. In [1], authors introduced a cost model for optimal bandwidth provisioning in SON. In this paper, we extended this concept and propose an alternative approach to maximize the total effective throughput of SDT as well as to minimize the QoS violation penalty of the SON by Service replication. We present both centralized and distributed algorithms for the placement of replicated servers on the SDT. Experiments are carried to quantify the merit, effectiveness and the scalability of the proposed Service replication algorithm. In particular, the performance gain is very close to the exhaustive search. The algorithm performs well when we scale up the Service Overlay networks. Finally, we show that one only needs to perform a small number of replications to attain the optimal gain.
-
NOMS (1) - On Service replication strategy for Service Overlay networks
2004 IEEE IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507), 1Co-Authors: K.y.k. Liu, John C.s. Lui, Zhi-li ZhangAbstract:The Service Overlay network (SON) is an effective means to deliver end-to-end QoS guaranteed applications on the current Internet. Duan et al. (2002) address the bandwidth provisioning problem on a SON, specifically, in determining the appropriate amount of bandwidth capacity to purchase from various autonomous systems so as to satisfy the QoS requirements of the SON's end users and at the same time maximize the total revenue of operating the Overlay network. In this paper, we extend the concept of the Service Overlay network. Since traffic demands are time varying and there may be some unexpected events which can cause a traffic surge, these will significantly increase the probability of QoS violation and will reduce the profit margin of a SON. To overcome these problems, we propose to replicate Services on the Service gateways so as to dynamically adapt to these traffic surges. We show that the Service replication problem, in general, is intractable. We propose an efficient Service replication algorithm which replicates Services for a subset of traffic flows. Under our replication strategy, one does not need to increase the bandwidth capacity of underlying links and at the same time, be able to increase the average profit for the Overlay network. Experiments are carried out to illustrate that replication algorithm provides higher flexibility during traffic fluctuations and can quickly find a near-optimal solution.
Zbigniew Dziong - One of the best experts on this subject based on the ideXlab platform.
-
Traffic Trend Estimation for Profit Oriented Capacity Adaptation in Service Overlay Networks
IEEE Transactions on Network and Service Management, 2011Co-Authors: Con Tran, Zbigniew DziongAbstract:Service Overlay Networks (SON) can offer end to end Quality of Service by leasing bandwidth from Internet Autonomous Systems. To maximize profit, the SON can continually adapt its leased bandwidth to traffic demand dynamics based on online traffic trend estimation. In this paper, we propose novel approaches for online traffic trend estimation that fits the SON capacity adaptation. In the first approach, the smoothing parameter of the exponential smoothing (ES) model is adapted to traffic trend. Here, the trend is estimated using measured connection arrival rate autocorrelation or cumulative distribution functions. The second approach applies Kalman filter whose model is built from historical traffic data. In this case, availability of the estimation error distribution allows for better control of the network Grade of Service. Numerical study shows that the proposed autocorrelation based ES approach gives the best combined estimation response-stability performance when compared to known ES methods. The proposed Kalman filter based approach improves further the capacity adaptation performance by limiting the increase of connection blocking when traffic level is increasing.
-
Service Overlay Network Capacity Adaptation for
2010Co-Authors: Zbigniew DziongAbstract:The considered Service Overlay Networks (SON) lease bandwidth with Quality of Service (QoS) guarantees from a multitude of Internet Autonomous Systems, through Service level agreements (SLA) with Internet Service Providers (ISP). This bandwidth is used to establish SON links and deliver end-to- end QoS for real time Service connections. The leased bandwidth amount influences both the admitted traffic and network cost, affecting the network profit. This gives the network operator the opportunity to optimize the profit by adapting the network resources to changing traffic and SLA costs conditions. We pro- pose a novel approach that maximizes the network profi tb ased on traffic measurements and SLA cost changes. The approach uses an economic model that integrates the network routing policy with the adaptation of the SON link capacities. While performing the adaptation of leased bandwidth, the connection blocking constraints are also maintained. The proposed adaptive optimization approach is based on a reward maximizing routing policy derived from the Markov Decision Process theory although it can be applied to other routing policies. Analytical models as well as simulation of a measurement based implementation of the proposed models are used to evaluate the performance of the proposed approach.
-
Service Overlay network capacity adaptation for profit maximization
IEEE Transactions on Network and Service Management, 2010Co-Authors: Con Tran, Zbigniew DziongAbstract:The considered Service Overlay Networks (SON) lease bandwidth with Quality of Service (QoS) guarantees from a multitude of Internet Autonomous Systems, through Service level agreements (SLA) with Internet Service Providers (ISP). This bandwidth is used to establish SON links and deliver end-to-end QoS for real time Service connections. The leased bandwidth amount influences both the admitted traffic and network cost, affecting the network profit. This gives the network operator the opportunity to optimize the profit by adapting the network resources to changing traffic and SLA costs conditions. We propose a novel approach that maximizes the network profit based on traffic measurements and SLA cost changes. The approach uses an economic model that integrates the network routing policy with the adaptation of the SON link capacities. While performing the adaptation of leased bandwidth, the connection blocking constraints are also maintained. The proposed adaptive optimization approach is based on a reward maximizing routing policy derived from the Markov Decision Process theory although it can be applied to other routing policies. Analytical models as well as simulation of a measurement based implementation of the proposed models are used to evaluate the performance of the proposed approach.
-
Service Overlay network design with reliability constraints
2009 7th International Workshop on Design of Reliable Communication Networks, 2009Co-Authors: Ngok Lam, Lorne G. Mason, Zbigniew DziongAbstract:We studied a class of Service Overlay Network (SON) design problem with reliability constraints. It is assumed that a SON network could enter an inadmissible status for two reasons; first when there is insufficient resource to accommodate new connections, second when some hardware devices malfunction. The design problem is usually formulated as either a Maximum Profit (MP) constrained optimization problem or a Minimum Cost (MC) constrained optimization problem. In this article we investigate the relationship between the two formulations in the context of ensuring system operability. By using the set of Lagrange multipliers from the MC formulation as a tool, we show the general condition that MP and MC give exactly the same network designs. The key contribution of this paper is the provision of insight into the solution nature of the MP and the MC formulations in designing a reliable Overlay network, thereby giving guidelines to the proper formulation the network designers may consider in designing a reliable yet economically optimal SON network.
-
The pricing of the Grade of Service guarantees in the Service Overlay networks
2009 7th International Conference on Information Communications and Signal Processing (ICICS), 2009Co-Authors: Ngok Lam, Lorne G. Mason, Zbigniew DziongAbstract: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 multi-criteria 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.
