The Experts below are selected from a list of 10785 Experts worldwide ranked by ideXlab platform
Yuanyuan Yang - One of the best experts on this subject based on the ideXlab platform.
-
Bandwidth guaranteed Multicast scheduling for virtual output queued packet switches
Journal of Parallel and Distributed Computing, 2009Co-Authors: Deng Pan, Yuanyuan YangAbstract:Multicast enables efficient data transmission from one source to multiple destinations, and has been playing an important role in Internet multimedia applications. Although several Multicast scheduling schemes for packet switches have been proposed in the literature, they usually aim to achieve only short Multicast latency and high throughput without considering bandwidth guarantees. However, fair bandwidth allocation is critical for the quality of service (QoS) of the network, and is necessary to Support Multicast applications requiring guaranteed performance services, such as online audio and video streaming. This paper addresses the issue of bandwidth guaranteed Multicast scheduling on virtual output queued (VOQ) switches. We propose the Credit based Multicast Fair scheduling (CMF) algorithm, which aims at achieving not only short Multicast latency but also fair bandwidth allocation. CMF uses a credit based strategy to guarantee the reserved bandwidth of an input port on each output port of the switch. It keeps track of the difference between the reserved bandwidth and actually received bandwidth, and minimizes the difference to ensure fairness. Moreover, in order to fully utilize the Multicast capability provided by the switch, CMF lets a Multicast packet simultaneously send transmission requests to multiple output ports. In this way, a Multicast packet has more chances to be delivered to multiple destination output ports in the same time slot and thus to achieve short Multicast latency. Extensive simulations are conducted to evaluate the performance of CMF, and the results demonstrate that CMF achieves the two design goals: fair bandwidth allocation and short Multicast latency.
-
bandwidth guaranteed Multicast scheduling for virtual output queued packet switches
Broadband Communications Networks and Systems, 2005Co-Authors: Deng Pan, Yuanyuan YangAbstract:Multicast enables efficient data transmission from one source to multiple destinations, and has been playing an important role in Internet multimedia applications. Although several Multicast scheduling schemes for packet switches have been proposed, they usually consider only short delay and high throughput but not bandwidth guarantees. However, fair bandwidth allocation is critical for the quality of service (QoS) of the network, and is necessary to Support Multicast applications requiring guaranteed performance services, such as online audio and video streaming. This paper addresses the issue of bandwidth guaranteed Multicast scheduling on virtual output queued (VOQ) switches. We propose the credit based Multicast fair scheduling (CMF) algorithm, which aims at achieving not only short Multicast latency but also fair bandwidth allocation. CMF uses a credit/balance based strategy to guarantee the reserved bandwidth of an input port on each output port of the switch. It keeps track of the difference between the reserved bandwidth and actually received bandwidth, and minimizes the difference to ensure fairness. Moreover, CMF Supports Multicast scheduling by allowing a Multicast packet to send transmission requests to multiple output ports simultaneously. As a result, a Multicast packet has more chances to be delivered to all its destinations in the same time slot, and thus shortens its Multicast latency. Extensive simulations are conducted to compare the performance of CMF with other existing scheduling algorithms, and the results demonstrate that CMF achieves the two design goals: short Multicast latency and fair bandwidth allocation
Patrick Seeling - One of the best experts on this subject based on the ideXlab platform.
-
Multicast capacity of packet switched ring wdm networks
IEEE Transactions on Information Theory, 2008Co-Authors: Michael Scheutzow, Martin Reisslein, Martin Maier, Patrick SeelingAbstract:Packet-switched unidirectional and bidirectional ring wavelength division multiplexing (WDM) networks with destination stripping provide an increased capacity due to spatial wavelength reuse. Besides unicast traffic, future destination stripping ring WDM networks also need to Support Multicast traffic efficiently. This article examines the largest achievable transmitter throughput, receiver throughput, and Multicast throughput of both unidirectional and bidirectional ring WDM networks with destination stripping. A probabilistic analysis evaluates both the nominal capacity, which is based on the mean hop distances traveled by the Multicast packet copies, and the effective capacity, which is based on the ring segment with the highest utilization probability, for each of the three throughput metrics. The developed analytical methodology accommodates not only Multicast traffic with arbitrary Multicast fanout but also unicast and broadcast traffic. Numerical investigations compare the nominal transmission, receiver, and Multicast capacities with the effective transmission, receiver, and Multicast capacities and examine the impact of number of ring nodes and Multicast fanout on the effective transmission, reception, and Multicast capacity of both types of ring networks for different unicast, Multicast, and broadcast traffic scenarios and different mixes of unicast and Multicast traffic. The presented analytical methodology enables the evaluation and comparison of future Multicast-capable medium access control (MAC) protocols for unidirectional and bidirectional ring WDM networks in terms of transmitter, receiver, and Multicast throughput efficiency.
-
Multicast capacity of packet switched ring wdm networks
International Conference on Computer Communications, 2005Co-Authors: Michael Scheutzow, Patrick Seeling, Martin Maier, Martin ReissleinAbstract:Packet-switched unidirectional and bidirectional ring wavelength division multiplexing (WDM) networks with destination stripping provide an increased capacity due to spatial wavelength reuse. Besides unicast traffic, future destination stripping ring WDM networks also need to Support Multicast traffic efficiently. In this paper, we provide a probabilistic analysis of the mean hop distances traveled by Multicast packet copies on the wavelength channels, and based on the mean hop distances analyze the nominal transmission capacity, reception capacity, and Multicast capacity of both unidirectional and bidirectional ring WDM networks with destination stripping. The developed analytical methodology accommodates not only Multicast traffic with arbitrary Multicast fanout but also unicast and broadcast traffic. In our numerical investigations we examine the impact of number of ring nodes and Multicast fanout on the transmission, reception, and Multicast capacity of both types of ring networks for different unicast, Multicast, and broadcast traffic scenarios and different mixes of unicast and Multicast traffic. Our analytical methodology provides a foundation for extended analyses of the Multicast capacity of WDM ring networks and enables the evaluation and comparison of future Multicast-capable medium access control (MAC) protocols for unidirectional and bidirectional ring WDM networks in terms of transmitter, receiver, and Multicast throughput efficiency.
Deng Pan - One of the best experts on this subject based on the ideXlab platform.
-
Bandwidth guaranteed Multicast scheduling for virtual output queued packet switches
Journal of Parallel and Distributed Computing, 2009Co-Authors: Deng Pan, Yuanyuan YangAbstract:Multicast enables efficient data transmission from one source to multiple destinations, and has been playing an important role in Internet multimedia applications. Although several Multicast scheduling schemes for packet switches have been proposed in the literature, they usually aim to achieve only short Multicast latency and high throughput without considering bandwidth guarantees. However, fair bandwidth allocation is critical for the quality of service (QoS) of the network, and is necessary to Support Multicast applications requiring guaranteed performance services, such as online audio and video streaming. This paper addresses the issue of bandwidth guaranteed Multicast scheduling on virtual output queued (VOQ) switches. We propose the Credit based Multicast Fair scheduling (CMF) algorithm, which aims at achieving not only short Multicast latency but also fair bandwidth allocation. CMF uses a credit based strategy to guarantee the reserved bandwidth of an input port on each output port of the switch. It keeps track of the difference between the reserved bandwidth and actually received bandwidth, and minimizes the difference to ensure fairness. Moreover, in order to fully utilize the Multicast capability provided by the switch, CMF lets a Multicast packet simultaneously send transmission requests to multiple output ports. In this way, a Multicast packet has more chances to be delivered to multiple destination output ports in the same time slot and thus to achieve short Multicast latency. Extensive simulations are conducted to evaluate the performance of CMF, and the results demonstrate that CMF achieves the two design goals: fair bandwidth allocation and short Multicast latency.
-
bandwidth guaranteed Multicast scheduling for virtual output queued packet switches
Broadband Communications Networks and Systems, 2005Co-Authors: Deng Pan, Yuanyuan YangAbstract:Multicast enables efficient data transmission from one source to multiple destinations, and has been playing an important role in Internet multimedia applications. Although several Multicast scheduling schemes for packet switches have been proposed, they usually consider only short delay and high throughput but not bandwidth guarantees. However, fair bandwidth allocation is critical for the quality of service (QoS) of the network, and is necessary to Support Multicast applications requiring guaranteed performance services, such as online audio and video streaming. This paper addresses the issue of bandwidth guaranteed Multicast scheduling on virtual output queued (VOQ) switches. We propose the credit based Multicast fair scheduling (CMF) algorithm, which aims at achieving not only short Multicast latency but also fair bandwidth allocation. CMF uses a credit/balance based strategy to guarantee the reserved bandwidth of an input port on each output port of the switch. It keeps track of the difference between the reserved bandwidth and actually received bandwidth, and minimizes the difference to ensure fairness. Moreover, CMF Supports Multicast scheduling by allowing a Multicast packet to send transmission requests to multiple output ports simultaneously. As a result, a Multicast packet has more chances to be delivered to all its destinations in the same time slot, and thus shortens its Multicast latency. Extensive simulations are conducted to compare the performance of CMF with other existing scheduling algorithms, and the results demonstrate that CMF achieves the two design goals: short Multicast latency and fair bandwidth allocation
Ljiljana Trajkovic - One of the best experts on this subject based on the ideXlab platform.
-
analysis of public safety traffic on trunked land mobile radio systems
IEEE Journal on Selected Areas in Communications, 2004Co-Authors: D S Sharp, N. Cackov, N Laskovic, Qing Shao, Ljiljana TrajkovicAbstract:Mobile radio systems for public safety and agencies engaged in emergency response and disaster recovery operations must Support Multicast voice traffic. In this paper, we analyze the distribution of call interarrival and call holding times for Multicast voice (talk group) traffic on a transmission trunked mobile radio system. In such systems, the channel is held only while a user is making a call (while the push-to-talk key is pressed and the radio is transmitting). We find that the call interarrival time distributions are exponential and exhibit tendency toward long-range dependence. The call holding times best fit lognormal distributions and are not correlated. A potentially important implication of these findings is that performance estimation methods that assume memoryless Markov arrival and departure processes may not be viable approaches.
Yafeng Liu - One of the best experts on this subject based on the ideXlab platform.
-
joint base station clustering and beamforming for non orthogonal Multicast and unicast transmission with backhaul constraints
IEEE Transactions on Wireless Communications, 2018Co-Authors: Erkai Chen, Meixia Tao, Yafeng LiuAbstract:The demand for providing Multicast services in cellular networks is continuously and fastly increasing. In this paper, we propose a non-orthogonal transmission framework based on layered-division multiplexing (LDM) to Support Multicast and unicast services concurrently in cooperative multi-cell cellular networks with a limited backhaul capacity. We adopt a two-layer LDM structure where the first layer is intended for Multicast services, the second layer is for unicast services, and the two layers are superposed with different beamformers. Each user decodes the Multicast message first, subtracts it, and then decodes its dedicated unicast message. We formulate a joint Multicast and unicast beamforming problem with adaptive base station clustering that aims to maximize the weighted sum of the Multicast rate and the unicast rate under per-BS power and backhaul constraints. To solve the problem, we first develop a branch-and-bound algorithm to find its global optimum. We then reformulate the problem as a sparse beamforming problem and propose a low-complexity algorithm based on convex-concave procedure. Simulation results demonstrate the significant superiority of the proposed LDM-based non-orthogonal scheme over orthogonal schemes in terms of the achievable Multicast-unicast rate region.
-
joint base station clustering and beamforming for non orthogonal Multicast and unicast transmission with backhaul constraints
arXiv: Information Theory, 2017Co-Authors: Erkai Chen, Meixia Tao, Yafeng LiuAbstract:The demand for providing Multicast services in cellular networks is continuously and fastly increasing. In this work, we propose a non-orthogonal transmission framework based on layered-division multiplexing (LDM) to Support Multicast and unicast services concurrently in cooperative multi-cell cellular networks with limited backhaul capacity. We adopt a two-layer LDM structure where the first layer is intended for Multicast services, the second layer is for unicast services, and the two layers are superposed with different beamformers. Each user decodes the Multicast message first, subtracts it, and then decodes its dedicated unicast message. We formulate a joint Multicast and unicast beamforming problem with adaptive base station clustering that aims to maximize the weighted sum of the Multicast rate and the unicast rate under per-BS power and backhaul constraints. To solve the problem, we first develop a branch-and-bound algorithm to find its global optimum. We then reformulate the problem as a sparse beamforming problem and propose a low-complexity algorithm based on convex-concave procedure. Simulation results demonstrate the significant superiority of the proposed LDM-based non-orthogonal scheme over orthogonal schemes in terms of the achievable Multicast-unicast rate region.
