The Experts below are selected from a list of 14196 Experts worldwide ranked by ideXlab platform
Demosthenis Teneketzis - One of the best experts on this subject based on the ideXlab platform.
-
Correction to "An Efficient Game Form for Multi-Rate Multicast Service Provisioning"
IEEE Journal on Selected Areas in Communications, 2013Co-Authors: Ali Kakhbod, Demosthenis TeneketzisAbstract:This note corrects an error in the paper, "An Efficient Game Form for Multi-Rate Multicast Service Provisioning" (ibid., vol. 30, no. 11,pp. 2093-2104, December 2012) which presents a rate allocation mechanism for multi-rate Multicast Service provisioning in networks with arbitrary topology and strategic users.
-
an efficient game form for multi rate Multicast Service provisioning
IEEE Journal on Selected Areas in Communications, 2012Co-Authors: Ali Kakhbod, Demosthenis TeneketzisAbstract:We consider the decentralized bandwidth/rate allocation problem in multi-rate Multicast Service provisioning with strategic users. We demonstrate that such a situation is the combination of a market problem and a public goods problem. We present a mechanism/game form which possesses the following properties when the users' utilities are concave: (1) It implements in Nash equilibria the solution of the corresponding centralized rate allocation problem in multi-rate Multicast Service provisioning. (2) It is individually rational. (3) It is budget-balanced at all Nash equilibria of the game induced by the mechanism/game form as well as at all off equilibrium messages/strategies that result in feasible allocations.
-
an efficient game form for multi rate Multicast Service provisioning
arXiv: Optimization and Control, 2011Co-Authors: Ali Kakhbod, Demosthenis TeneketzisAbstract:We consider the decentralized bandwidth/rate allocation problem in multi-rate Multicast Service provisioning with strategic users. We demonstrate that such a situation is the combination of a market problem and a public good problem. We present a mechanism/game form which possesses the following properties when the users' utilities are concave: (1) It implements in Nash equilibria the solution of the corresponding centralized rate allocation problem in multi-rate Multicast Service provisioning. (2) It is individually rational. (3) It is budget-balanced at all Nash equilibria of the game induced by the mechanism/game form as well as off equilibrium.
-
Correction to "An Efficient Game Form for Multi-rate Multicast Service Provisioning"
arXiv: Optimization and Control, 2011Co-Authors: Ali Kakhbod, Demosthenis TeneketzisAbstract:A correction to the specification of the mechanism proposed in "An Efficient Game Form for Multi-rate Multicast Service Provisioning" is given.
-
Multirate Multicast Service provisioning II: a tâtonnement process for rate allocation
Mathematical Methods of Operations Research, 2007Co-Authors: Tudor Mihai Stoenescu, Demosthenis TeneketzisAbstract:In multirate Multicast different users in the same Multicast group can receive Services at different rates depending on their own requirements and the congestion level of the network. In this two-part paper we present a general framework for addressing the optimal rate control problem in multirate Multicast where the objective is the maximization of a social welfare function expressed by the sum of the users’ utility functions. In Part II we present a market based mechanism and an adjustment process that have the following features. They satisfy the informational constraints imposed by the nature of multirate Multicast; and when they are combined with the results of Part I they result in an optimal solution of the corresponding centralized multirate Multicast problem.
Ali Kakhbod - One of the best experts on this subject based on the ideXlab platform.
-
Correction to "An Efficient Game Form for Multi-Rate Multicast Service Provisioning"
IEEE Journal on Selected Areas in Communications, 2013Co-Authors: Ali Kakhbod, Demosthenis TeneketzisAbstract:This note corrects an error in the paper, "An Efficient Game Form for Multi-Rate Multicast Service Provisioning" (ibid., vol. 30, no. 11,pp. 2093-2104, December 2012) which presents a rate allocation mechanism for multi-rate Multicast Service provisioning in networks with arbitrary topology and strategic users.
-
an efficient game form for multi rate Multicast Service provisioning
IEEE Journal on Selected Areas in Communications, 2012Co-Authors: Ali Kakhbod, Demosthenis TeneketzisAbstract:We consider the decentralized bandwidth/rate allocation problem in multi-rate Multicast Service provisioning with strategic users. We demonstrate that such a situation is the combination of a market problem and a public goods problem. We present a mechanism/game form which possesses the following properties when the users' utilities are concave: (1) It implements in Nash equilibria the solution of the corresponding centralized rate allocation problem in multi-rate Multicast Service provisioning. (2) It is individually rational. (3) It is budget-balanced at all Nash equilibria of the game induced by the mechanism/game form as well as at all off equilibrium messages/strategies that result in feasible allocations.
-
an efficient game form for multi rate Multicast Service provisioning
arXiv: Optimization and Control, 2011Co-Authors: Ali Kakhbod, Demosthenis TeneketzisAbstract:We consider the decentralized bandwidth/rate allocation problem in multi-rate Multicast Service provisioning with strategic users. We demonstrate that such a situation is the combination of a market problem and a public good problem. We present a mechanism/game form which possesses the following properties when the users' utilities are concave: (1) It implements in Nash equilibria the solution of the corresponding centralized rate allocation problem in multi-rate Multicast Service provisioning. (2) It is individually rational. (3) It is budget-balanced at all Nash equilibria of the game induced by the mechanism/game form as well as off equilibrium.
-
Correction to "An Efficient Game Form for Multi-rate Multicast Service Provisioning"
arXiv: Optimization and Control, 2011Co-Authors: Ali Kakhbod, Demosthenis TeneketzisAbstract:A correction to the specification of the mechanism proposed in "An Efficient Game Form for Multi-rate Multicast Service Provisioning" is given.
Weinong Wang - One of the best experts on this subject based on the ideXlab platform.
-
Multihomed routing in Multicast Service overlay network
Lecture Notes in Computer Science, 2006Co-Authors: Xiao Chen, Weinong WangAbstract:Most existing overlay Multicast approaches assume a singlehomed model, where each overlay node has a unique access link in the physical network. This assumption is usually not applicable to the routing problem in Multicast Service overlay network, which may comprise multihomed Multicast Service nodes(MSN). We address this issue by proposing not only a multihomed proxy model but also a two-phase solution to the routing problem under this model. First we choose a proper physical path for each overlay link based on the current network status and the routing policy. Then the routing process calculates the Multicast tree according to the previous selection. Through simulations, we prove that our approach makes the overlay Multicast routing more efficient in a multihomed environment.
-
ISPA - Multihomed routing in Multicast Service overlay network
Parallel and Distributed Processing and Applications, 2006Co-Authors: Xiao Chen, Weinong WangAbstract:Most existing overlay Multicast approaches assume a singlehomed model, where each overlay node has a unique access link in the physical network. This assumption is usually not applicable to the routing problem in Multicast Service overlay network, which may comprise multihomed Multicast Service nodes(MSN). We address this issue by proposing not only a multihomed proxy model but also a two-phase solution to the routing problem under this model. First we choose a proper physical path for each overlay link based on the current network status and the routing policy. Then the routing process calculates the Multicast tree according to the previous selection. Through simulations, we prove that our approach makes the overlay Multicast routing more efficient in a multihomed environment.
Shanguo Huang - One of the best experts on this subject based on the ideXlab platform.
-
OFC - Distributed Sub-Tree Based Multi-Class Multicast Service Aggregation in Elastic Optical Data Center Networks
Optical Fiber Communication Conference (OFC) 2019, 2019Co-Authors: Ying Tang, Tao Gao, Lu Zhang, Yongjun Zhang, Shanguo HuangAbstract:We propose a distributed sub-tree based Multicast Service aggregation scheme considering the class of each Multicast Service including public and secure types. It achieves low spectrum and transceiver consumptions and has a wide application scope.
-
On-demand routing, modulation level and spectrum allocation (OD-RMSA) for Multicast Service aggregation in elastic optical networks.
Optics express, 2018Co-Authors: Lu Zhang, Ying Tang, Tao Gao, Yongjun Zhang, Shanguo HuangAbstract:The light-tree based Multicast Service aggregation (LT-MSA) scheme provides a cost-efficient method to accommodate a large number of finer-grained Multicast Services in optical networks. However, when multiple Multicast Services that do not have exactly the same requesters are aggregated together, some fiber links will be allocated with redundant spectrum. This shortcoming causes high spectrum consumption and narrow application range. In elastic optical networks (EONs), leveraging node architecture that supports both optical Multicasting and bandwidth-variable spectrum selection, we consider on-demand routing, modulation level and spectrum allocation (OD-RMSA) for the LT-MSA scheme. It improves resource utilization by allocating spectrum on each link according to the desired Multicast Services of downstream destination users of this link. We also define the maximum aggregating group (MAG) to eliminate node adjacent redundancy on each link. An Integer Linear Programing (ILP) model and a heuristic approach are developed to realize the OD-RMSA strategy. Simulations show that the OD-RMSA strategy can eliminate spectrum redundancy and greatly reduces transceiver consumption than the light-tree scheme. Moreover, it can also greatly reduce spectrum consumption than the conventional consistent routing, modulation level and spectrum allocation (C-RMSA) strategy.
Seong-choon Lee - One of the best experts on this subject based on the ideXlab platform.
-
Efficient Use of Multicast and Unicast Channels for Multicast Service Transmission
IEEE Transactions on Communications, 2011Co-Authors: Seung Joon Lee, Yongjoo Tcha, Sang-yong Seo, Seong-choon LeeAbstract:To overcome the problem that the transmission rate of a Multicast channel is limited by the user with the worst channel quality, which causes the total system throughput to be low, the use of both Multicast and unicast channels for Multicast Service is considered in this letter. Unicast channels, in addition to a Multicast channel, are allocated to users with signal-to-noise ratios (SNRs) lower than a predefined threshold in order to enable the increase of the transmission rate of the Multicast channel. The used unicast channels consume additional radio resource. It is examined whether use of such unicast channels can raise the spectral efficiency defined as the total system throughput normalized by the total consumed bandwidth. The optimal value of the threshold SNR is derived by maximizing the spectral efficiency. When a unicast channel is additionally allocated for Multicast Service, two decoding schemes are considered: one is to use only the signal of a unicast channel, and the other is to use and combine both the signals of Multicast and unicast channels. Numerical examples are presented to show the performance gains obtained by using unicast channels in addition to a Multicast channel.
