The Experts below are selected from a list of 282 Experts worldwide ranked by ideXlab platform
Kaiyeung Siu - One of the best experts on this subject based on the ideXlab platform.
-
supporting bursty traffic with Bandwidth Guarantee in wdm distribution networks
IEEE Journal on Selected Areas in Communications, 2000Co-Authors: A C Kam, Kaiyeung SiuAbstract:This paper presents new research results of the DARPA-funded ONRAMP consortium on the next generation Internet to study efficient WDM-based network architectures and protocols for supporting broadband services in regional access networks. In particular, we present new efficient scheduling algorithms for Bandwidth sharing in WDM distribution networks. The current ONRAMP distribution network architecture has a tree topology with each leaf node (e.g., a router or workstation) sharing access to the root node of the tree, which corresponds to an access node in the feeder network. Our model allows a leaf node to use one or more fixed-tuned or tunable transceivers; moreover, different leaf nodes can support different subsets of wavelengths depending on their expected traffic volumes. An important goal of ONRAMP is to support Bandwidth-on-demand services with QoS Guarantee over WDM. As a first step toward this goal, we have developed several fast scheduling algorithms for flexible Bandwidth reservations in a WDM distribution network. The scheduling algorithms can provably Guarantee any Bandwidth reservations pattern that does not overbook network resources, i.e., Bandwidth reservation (throughput) up to 100% network capacity can be supported.
-
a cell switching wdm broadcast lan with Bandwidth Guarantee and fair access
Journal of Lightwave Technology, 1998Co-Authors: A C Kam, Kaiyeung Siu, R A Barry, E A SwansonAbstract:This paper presents the design of a cell-switching wavelength division multiplexing (WDM) local area network (LAN), which constitutes a key component of a next-generation internet (NGI) consortium project recently funded by DARPA. An important goal of the NGI project is to support Bandwidth-on-demand services with quality-of-service (QOS) Guarantee over WDM networks. As a first step toward this goal, we have developed several fast scheduling algorithms for flexible Bandwidth reservations and fair sharing of unreserved Bandwidth in a WDM broadcast network with fast-tunable transceivers. Unlike circuit-based Bandwidth reservation schemes that impose a fixed schedule precomputed on setup, our scheme deals with bursty traffic by allocating network resources dynamically using very efficient algorithms. Our algorithms are based on a new concept of computing maximal weighted matchings, which is a generalization of maximal matchings on unweighted graphs. We prove that our algorithms can support total reserved Bandwidth of up to 50% of the network capacity, and in that case constant delay bounds are also established. Simulations show that our algorithms can in practice support much higher reserved Bandwidth-up to 90% of network capacity, and with much better delay bounds, even for burst traffic. In addition to the Bandwidth Guarantee, the unreserved Bandwidth can be shared fairly among the users using our fair access algorithms with case to 100% network utilization in simulations.
-
virtual queueing techniques for ubr service in atm with fair access and minimum Bandwidth Guarantee
Other Information: PBD: [1998], 1998Co-Authors: Kaiyeung Siu, Wenge RenAbstract:The ATM Forum is currently discussing the need for a new best-effort service called UBR+, which is an enhancement to the existing UBR service, to support data traffic. The objective of the UBR+ service is to provide each user with a minimum service rate Guarantee and a fair access to any excess available Bandwidth. In this paper, the authors present a new efficient scheme for supporting this service. The key advantage of the scheme is that it employs only FIFO queueing (instead of per-VC queueing) and admits simple implementation in ATM switches. The ideas involve a simple scheduling mechanism that is based on per-VC queueing and incorporate the virtual queueing technique that can efficiently emulate per-VC queueing on a shared FIFO queue. Simulation results are presented to show that the schemes can deliver almost ideal performance for supporting the new service requirements of UBR+.
-
toward best effort services over wdm networks with fair access and minimum Bandwidth Guarantee
IEEE Journal on Selected Areas in Communications, 1998Co-Authors: A C Kam, Kaiyeung Siu, R A Barry, E A SwansonAbstract:Most existing wavelength-division multiplexed (WDM) networks employ circuit switching, typically with one session having exclusive use of one entire wavelength. Consequently, they are not suitable for data applications involving bursty traffic patterns. The All-Optical Network (AON) Consortium has developed an all-optical LAN/MAN test bed which provides time-slotted WDM service. We explore extensions of this service to achieve fine-grained statistical multiplexing with different virtual circuits time sharing the wavelengths in a fair manner. We develop a very fast, best effort time-slotted WDM network protocol with very good fairness and throughput characteristics. As an additional design feature, our protocol supports the assignment of Guaranteed Bandwidths (GBW) to selected sessions. This feature acts as a first step toward supporting integrated services at the optical layer in WDM networks.
-
virtual queueing techniques for ubr service in atm with fair access and minimum Bandwidth Guarantee
Global Communications Conference, 1997Co-Authors: Kaiyeung Siu, Wenge RenAbstract:The ATM Forum is currently discussing the need for a new best-effort service called UBR+, which is an enhancement to the existing UBR service, to support data traffic. The objective of the UBR+ service is to provide each user with a minimum service rate Guarantee and a fair access to any excess available Bandwidth. We present a new efficient scheme for supporting this service. The key advantage of our scheme is that it employs only FIFO queueing (instead of per-VC queueing) and admits simple implementation in ATM switches. Our ideas involve a simple scheduling mechanism that is based on per-VC queueing and incorporate the virtual queueing technique that can efficiently emulate per-VC queuing on a shared FIFO queue. Simulation results are presented to show that our schemes can deliver almost ideal performance for supporting the new service requirements of UBR+.
Jingcheng Zhang - One of the best experts on this subject based on the ideXlab platform.
-
towards Bandwidth Guarantee in multi tenancy cloud computing networks
International Conference on Network Protocols, 2012Co-Authors: Jing Zhu, Hongnan Liu, Ying Zhang, Jingcheng ZhangAbstract:To efficiently utilize their infrastructure and thus increase their revenue, cloud providers need mechanisms to provide resource allocation and performance isolation for different tenants in the shared platform. In particular, network Bandwidth sharing is a critical yet still an open problem to most cloud providers. In this paper, we study the problem of virtual machine (VM) allocation under the consideration of providing Bandwidth Guarantees. We first propose an online allocation algorithm for tenants with homogeneous Bandwidth demand, which improves on the accuracy of existing algorithms. Subsequently, we extend it to handle heterogeneous Bandwidth demand. Extensive simulations show that our algorithm makes much more efficient utilization of the network resource than existing algorithms, and performs close to the optimal offline allocation.
-
ICNP - Towards Bandwidth Guarantee in multi-tenancy cloud computing networks
2012 20th IEEE International Conference on Network Protocols (ICNP), 2012Co-Authors: Jing Zhu, Hongnan Liu, Ying Zhang, Jingcheng ZhangAbstract:To efficiently utilize their infrastructure and thus increase their revenue, cloud providers need mechanisms to provide resource allocation and performance isolation for different tenants in the shared platform. In particular, network Bandwidth sharing is a critical yet still an open problem to most cloud providers. In this paper, we study the problem of virtual machine (VM) allocation under the consideration of providing Bandwidth Guarantees. We first propose an online allocation algorithm for tenants with homogeneous Bandwidth demand, which improves on the accuracy of existing algorithms. Subsequently, we extend it to handle heterogeneous Bandwidth demand. Extensive simulations show that our algorithm makes much more efficient utilization of the network resource than existing algorithms, and performs close to the optimal offline allocation.
Haiying Shen - One of the best experts on this subject based on the ideXlab platform.
-
Towards Bandwidth Guarantee for Virtual Clusters Under Demand Uncertainty in Multi-Tenant Clouds
IEEE Transactions on Parallel and Distributed Systems, 2018Co-Authors: Haiying Shen, Zhipeng Cai, Ling LiuAbstract:In the cloud, multiple tenants share the resource of datacenters and their applications compete with each other for scarce network Bandwidth. Current studies have shown that the lack of Bandwidth Guarantee causes unpredictable network performance, leading to poor application performance. To address this issue, several virtual network abstractions have been proposed which allow the tenants to reserve virtual clusters with specified Bandwidth between the Virtual Machines (VMs) in the datacenters. However, all these existing proposals require the tenants to deterministically characterize the Bandwidth demands in the abstractions, which can be difficult and result in inefficient Bandwidth reservation due to the demand uncertainty. In this paper, we explore a virtual cluster abstraction with stochastic Bandwidth characterization to address the Bandwidth demand uncertainty. We propose Stochastic Virtual Cluster (SVC), which models the Bandwidth demand between VMs in a probabilistic way. Based on SVC, we develop a stochastic framework for virtual cluster allocation, in which the admitted virtual cluster's Bandwidth demands are satisfied with a high probability. Efficient VM allocation algorithms are proposed to implement the framework while reducing the possibility of link congestion through minimizing the maximum Bandwidth occupancy of a virtual cluster on physical links. Using simulations, we show that SVC achieves the trade-off between the job concurrency and the average job running time, and demonstrate its effectiveness for accommodating cloud application workloads with highly volatile Bandwidth demands and its improvement to work-conserving Bandwidth enforcement.
-
Bandwidth Guarantee under demand uncertainty in multi tenant clouds
International Conference on Distributed Computing Systems, 2014Co-Authors: Haiying ShenAbstract:The shared multi-tenant nature of cloud network infrastructures has caused poor application performance in the clouds due to unpredictable network performance. To provide Bandwidth Guarantee, several virtual network abstractions have been proposed which allow the tenants to specify and reserve virtual clusters with required network Bandwidth between the VMs. However, all of these existing proposals require the tenants to deterministically characterize the exact Bandwidth demands in the abstractions, which can be difficult and result in inefficient Bandwidth reservation due to the demand uncertainty. In this paper, we propose a virtual cluster abstraction with stochastic Bandwidth requirements between VMs, called Stochastic Virtual Cluster (SVC), which probabilistically models the Bandwidth demand uncertainty. Based on SVC, we propose a network sharing framework and efficient VM allocation algorithms to ensure that the Bandwidth demands of tenants on any link are satisfied with a high probability, while minimizing the Bandwidth occupancy cost on links. Using simulations, we demonstrate the effectiveness of SVC for accommodating cloud application workloads with highly volatile Bandwidth demands, in the way of achieving the trade-off between the job concurrency and average job running time.
-
ICDCS - Bandwidth Guarantee under Demand Uncertainty in Multi-tenant Clouds
2014 IEEE 34th International Conference on Distributed Computing Systems, 2014Co-Authors: Haiying ShenAbstract:The shared multi-tenant nature of cloud network infrastructures has caused poor application performance in the clouds due to unpredictable network performance. To provide Bandwidth Guarantee, several virtual network abstractions have been proposed which allow the tenants to specify and reserve virtual clusters with required network Bandwidth between the VMs. However, all of these existing proposals require the tenants to deterministically characterize the exact Bandwidth demands in the abstractions, which can be difficult and result in inefficient Bandwidth reservation due to the demand uncertainty. In this paper, we propose a virtual cluster abstraction with stochastic Bandwidth requirements between VMs, called Stochastic Virtual Cluster (SVC), which probabilistically models the Bandwidth demand uncertainty. Based on SVC, we propose a network sharing framework and efficient VM allocation algorithms to ensure that the Bandwidth demands of tenants on any link are satisfied with a high probability, while minimizing the Bandwidth occupancy cost on links. Using simulations, we demonstrate the effectiveness of SVC for accommodating cloud application workloads with highly volatile Bandwidth demands, in the way of achieving the trade-off between the job concurrency and average job running time.
A C Kam - One of the best experts on this subject based on the ideXlab platform.
-
supporting bursty traffic with Bandwidth Guarantee in wdm distribution networks
IEEE Journal on Selected Areas in Communications, 2000Co-Authors: A C Kam, Kaiyeung SiuAbstract:This paper presents new research results of the DARPA-funded ONRAMP consortium on the next generation Internet to study efficient WDM-based network architectures and protocols for supporting broadband services in regional access networks. In particular, we present new efficient scheduling algorithms for Bandwidth sharing in WDM distribution networks. The current ONRAMP distribution network architecture has a tree topology with each leaf node (e.g., a router or workstation) sharing access to the root node of the tree, which corresponds to an access node in the feeder network. Our model allows a leaf node to use one or more fixed-tuned or tunable transceivers; moreover, different leaf nodes can support different subsets of wavelengths depending on their expected traffic volumes. An important goal of ONRAMP is to support Bandwidth-on-demand services with QoS Guarantee over WDM. As a first step toward this goal, we have developed several fast scheduling algorithms for flexible Bandwidth reservations in a WDM distribution network. The scheduling algorithms can provably Guarantee any Bandwidth reservations pattern that does not overbook network resources, i.e., Bandwidth reservation (throughput) up to 100% network capacity can be supported.
-
a cell switching wdm broadcast lan with Bandwidth Guarantee and fair access
Journal of Lightwave Technology, 1998Co-Authors: A C Kam, Kaiyeung Siu, R A Barry, E A SwansonAbstract:This paper presents the design of a cell-switching wavelength division multiplexing (WDM) local area network (LAN), which constitutes a key component of a next-generation internet (NGI) consortium project recently funded by DARPA. An important goal of the NGI project is to support Bandwidth-on-demand services with quality-of-service (QOS) Guarantee over WDM networks. As a first step toward this goal, we have developed several fast scheduling algorithms for flexible Bandwidth reservations and fair sharing of unreserved Bandwidth in a WDM broadcast network with fast-tunable transceivers. Unlike circuit-based Bandwidth reservation schemes that impose a fixed schedule precomputed on setup, our scheme deals with bursty traffic by allocating network resources dynamically using very efficient algorithms. Our algorithms are based on a new concept of computing maximal weighted matchings, which is a generalization of maximal matchings on unweighted graphs. We prove that our algorithms can support total reserved Bandwidth of up to 50% of the network capacity, and in that case constant delay bounds are also established. Simulations show that our algorithms can in practice support much higher reserved Bandwidth-up to 90% of network capacity, and with much better delay bounds, even for burst traffic. In addition to the Bandwidth Guarantee, the unreserved Bandwidth can be shared fairly among the users using our fair access algorithms with case to 100% network utilization in simulations.
-
toward best effort services over wdm networks with fair access and minimum Bandwidth Guarantee
IEEE Journal on Selected Areas in Communications, 1998Co-Authors: A C Kam, Kaiyeung Siu, R A Barry, E A SwansonAbstract:Most existing wavelength-division multiplexed (WDM) networks employ circuit switching, typically with one session having exclusive use of one entire wavelength. Consequently, they are not suitable for data applications involving bursty traffic patterns. The All-Optical Network (AON) Consortium has developed an all-optical LAN/MAN test bed which provides time-slotted WDM service. We explore extensions of this service to achieve fine-grained statistical multiplexing with different virtual circuits time sharing the wavelengths in a fair manner. We develop a very fast, best effort time-slotted WDM network protocol with very good fairness and throughput characteristics. As an additional design feature, our protocol supports the assignment of Guaranteed Bandwidths (GBW) to selected sessions. This feature acts as a first step toward supporting integrated services at the optical layer in WDM networks.
Jing Zhu - One of the best experts on this subject based on the ideXlab platform.
-
higher Bandwidth may sometimes reduce cloud application performance
Workshop on Local and Metropolitan Area Networks, 2014Co-Authors: Jing Zhu, Wei Liang, Zhixiong Jiang, Ming ZhuAbstract:Cloud computing has experienced explosive growth in last ten years. Since cloud applications usually come up with large amounts of data transfer, the network capability becomes one of the dominant performance factors. Judging from common sense, it seems obvious that the higher quantity of Bandwidth Guaranteed for a job, the higher performance we will achieve. Rather, in this paper, we found that the effect of providing higher Bandwidth Guarantee turns to be uncertain. Without efficient work and flow scheduling mechanism, merely increasing the Bandwidth allocated for the job may actually be as harmful as reducing the Bandwidth.
-
LANMAN - Higher Bandwidth may sometimes reduce cloud application performance
2014 IEEE 20th International Workshop on Local & Metropolitan Area Networks (LANMAN), 2014Co-Authors: Jing Zhu, Wei Liang, Zhixiong Jiang, Ming ZhuAbstract:Cloud computing has experienced explosive growth in last ten years. Since cloud applications usually come up with large amounts of data transfer, the network capability becomes one of the dominant performance factors. Judging from common sense, it seems obvious that the higher quantity of Bandwidth Guaranteed for a job, the higher performance we will achieve. Rather, in this paper, we found that the effect of providing higher Bandwidth Guarantee turns to be uncertain. Without efficient work and flow scheduling mechanism, merely increasing the Bandwidth allocated for the job may actually be as harmful as reducing the Bandwidth.
-
towards Bandwidth Guarantee in multi tenancy cloud computing networks
International Conference on Network Protocols, 2012Co-Authors: Jing Zhu, Hongnan Liu, Ying Zhang, Jingcheng ZhangAbstract:To efficiently utilize their infrastructure and thus increase their revenue, cloud providers need mechanisms to provide resource allocation and performance isolation for different tenants in the shared platform. In particular, network Bandwidth sharing is a critical yet still an open problem to most cloud providers. In this paper, we study the problem of virtual machine (VM) allocation under the consideration of providing Bandwidth Guarantees. We first propose an online allocation algorithm for tenants with homogeneous Bandwidth demand, which improves on the accuracy of existing algorithms. Subsequently, we extend it to handle heterogeneous Bandwidth demand. Extensive simulations show that our algorithm makes much more efficient utilization of the network resource than existing algorithms, and performs close to the optimal offline allocation.
-
ICNP - Towards Bandwidth Guarantee in multi-tenancy cloud computing networks
2012 20th IEEE International Conference on Network Protocols (ICNP), 2012Co-Authors: Jing Zhu, Hongnan Liu, Ying Zhang, Jingcheng ZhangAbstract:To efficiently utilize their infrastructure and thus increase their revenue, cloud providers need mechanisms to provide resource allocation and performance isolation for different tenants in the shared platform. In particular, network Bandwidth sharing is a critical yet still an open problem to most cloud providers. In this paper, we study the problem of virtual machine (VM) allocation under the consideration of providing Bandwidth Guarantees. We first propose an online allocation algorithm for tenants with homogeneous Bandwidth demand, which improves on the accuracy of existing algorithms. Subsequently, we extend it to handle heterogeneous Bandwidth demand. Extensive simulations show that our algorithm makes much more efficient utilization of the network resource than existing algorithms, and performs close to the optimal offline allocation.
