1
|
Suo L, Ma H, Jiao W, Liu X. Job-Deadline-Guarantee-Based Joint Flow Scheduling and Routing Scheme in Data Center Networks. SENSORS (BASEL, SWITZERLAND) 2023; 24:216. [PMID: 38203078 PMCID: PMC10781248 DOI: 10.3390/s24010216] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Received: 11/17/2023] [Revised: 12/25/2023] [Accepted: 12/25/2023] [Indexed: 01/12/2024]
Abstract
Many emerging Internet of Things (IoT) applications deployed on cloud platforms have strict latency requirements or deadline constraints, and thus meeting the deadlines is crucial to ensure the quality of service for users and the revenue for service providers in these delay-stringent IoT applications. Efficient flow scheduling in data center networks (DCNs) plays a major role in reducing the execution time of jobs and has garnered significant attention in recent years. However, only few studies have attempted to combine job-level flow scheduling and routing to guarantee meeting the deadlines of multi-stage jobs. In this paper, an efficient heuristic joint flow scheduling and routing (JFSR) scheme is proposed. First, targeting maximizing the number of jobs for which the deadlines have been met, we formulate the joint flow scheduling and routing optimization problem for multiple multi-stage jobs. Second, due to its mathematical intractability, this problem is decomposed into two sub-problems: inter-coflow scheduling and intra-coflow scheduling. In the first sub-problem, coflows from different jobs are scheduled according to their relative remaining times; in the second sub-problem, an iterative coflow scheduling and routing (ICSR) algorithm is designed to alternately optimize the routing path and bandwidth allocation for each scheduled coflow. Finally, simulation results demonstrate that the proposed JFSR scheme can significantly increase the number of jobs for which the deadlines have been met in DCNs.
Collapse
Affiliation(s)
- Long Suo
- College of Information Science and Technology, Nanjing Forestry University, Nanjing 210037, China; (W.J.); (X.L.)
| | - Han Ma
- State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China;
| | - Wanguo Jiao
- College of Information Science and Technology, Nanjing Forestry University, Nanjing 210037, China; (W.J.); (X.L.)
| | - Xiaoming Liu
- College of Information Science and Technology, Nanjing Forestry University, Nanjing 210037, China; (W.J.); (X.L.)
| |
Collapse
|
2
|
Zeng S, Zhang Y, Liu J, Lin Z, Lin Z, Chen H, Liu J, Yu S. Solid-state 360° optical beamforming for reconfigurable multicast optical wireless communications. OPTICS EXPRESS 2023; 31:10070-10081. [PMID: 37157564 DOI: 10.1364/oe.477553] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/10/2023]
Abstract
Optical wireless communication is an attractive technique for data center interconnects due to its low latency line-of-sight connectivity. Multicast, on the other hand, is an important data center network function that can improve traffic throughput, reduce latency, and make efficient use of network resources. To enable reconfigurable multicast in data center optical wireless networks, we propose a novel 360° optical beamforming scheme based on the principle of superposition of orbital angular momentum modes, emitting beams from the source rack pointing towards any combination of other racks so that connections are established between the source and multiple destination racks. We experimentally demonstrate the scheme using solid state devices for a scenario where racks are arranged in a hexagonal formation in which a source rack can connect with any number of adjacent racks simultaneously, with each link transmitting 70 Gb/s on-off-keying modulations at bit error rates of <10-6 at 1.5-m and 2.0-m link distances.
Collapse
|
3
|
Zou S, Ji W, Huang J. BTP: automatic identification and prediction of tasks in data center networks. JOURNAL OF CLOUD COMPUTING: ADVANCES, SYSTEMS AND APPLICATIONS 2022. [DOI: 10.1186/s13677-022-00312-7] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/10/2022] Open
Abstract
AbstractModern data centers have widely deployed lots of cluster computing applications such as MapReduce and Spark. Since the coflow/task abstraction can exactly express the requirements of cluster computing applications, various task-based solutions have been proposed to improve application-level performance. However, most of solutions require modification of the applications to obtain task information, making them impractical in many scenarios. In this paper, we propose a Bayesian decision-based Task Prediction mechanism named BTP to identify task and predict the task-size category. First, we design an automatic identification mechanism to identify tasks without manually modifying the applications. Then we leverage bayesian decision to predict the task-size category. Through a series of large-scale NS2 simulations, we demonstrate that BTP can accurately identify task and predict the task-size category. More specifically, BTP achieves 96% precision and 92% recall while obtaining accuracy by up to 98%.
Collapse
|
4
|
Coded Parallel Transmission for Half-Duplex Distributed Computing. INFORMATION 2022. [DOI: 10.3390/info13070342] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/10/2022] Open
Abstract
This work studies a general distributed coded computing system based on the MapReduce-type framework, where distributed computing nodes within a half-duplex network wish to compute multiple output functions. We first introduce a definition of communication delay to characterize the time cost during the date shuffle phase, and then propose a novel coding strategy that enables parallel transmission among the computation nodes by delicately designing the data placement, message symbols encoding, data shuffling, and decoding. Compared to the coded distributed computing (CDC) scheme proposed by Li et al., the proposed scheme significantly reduces the communication delay, in particular when the computation load is relatively smaller than the number of computing nodes K. Moreover, the communication delay of CDC is a monotonically increasing function of K, while the communication delay of our scheme decreases as K increases, indicating that the proposed scheme can make better use of the computing resources.
Collapse
|
5
|
Link Load Correlation-Based Blocking Performance Analysis for Tree-Type Data Center Networks. APPLIED SCIENCES-BASEL 2022. [DOI: 10.3390/app12126235] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
Abstract
With the explosive growth of cloud computing applications, the east-west traffic among servers has come to occupy the dominant proportion of the traffic in data center networks (DCNs). Cloud computing tasks need to be executed in a distributed manner on multiple servers, which exchange large amounts of intermediate data between the adjacent stages of each multi-stage task. Therefore, the congestion in DCNs can reduce the processing performance when conducting multi-stage tasks. To address this, the relationship between the blocking performance and the traffic load can be adopted as a theoretical basis for network planning and traffic engineering. In this paper, the traffic load correlation between edge links and aggregation links is considered, and an iterative blocking performance analysis method is proposed for two-layer tree-type DCNs. The simulation results show the good accuracy of the proposed method with respect to the theoretical results especially in the blocking rate range below 4% and with over-subscription ratio 1.5.
Collapse
|
6
|
|
7
|
Mao R, Aggarwal V. NPSCS: Non-Preemptive Stochastic Coflow Scheduling With Time-Indexed LP Relaxation. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2021. [DOI: 10.1109/tnsm.2021.3051657] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/08/2022]
|
8
|
Allocating MapReduce workflows with deadlines to heterogeneous servers in a cloud data center. SERVICE ORIENTED COMPUTING AND APPLICATIONS 2020. [DOI: 10.1007/s11761-020-00290-1] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 10/24/2022]
|
9
|
Zhang J, Guo D, Li K, Qi H, Tao X, Jin Y. Coflow Scheduling in the Multi-Resource Environment. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2019. [DOI: 10.1109/tnsm.2019.2901549] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/10/2022]
|
10
|
Zhao S, Medhi D. Application-Aware Network Design for Hadoop MapReduce Optimization Using Software-Defined Networking. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2017. [DOI: 10.1109/tnsm.2017.2728519] [Citation(s) in RCA: 21] [Impact Index Per Article: 2.6] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/10/2022]
|
11
|
|
12
|
Mukerjee MK, Naylor D, Jiang J, Han D, Seshan S, Zhang H. Practical, Real-time Centralized Control for CDN-based Live Video Delivery. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW 2015. [DOI: 10.1145/2829988.2787475] [Citation(s) in RCA: 17] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 10/23/2022]
Affiliation(s)
| | | | | | | | | | - Hui Zhang
- Carnegie Mellon University, Pittsburgh, PA, USA
| |
Collapse
|
13
|
Bao J, Dong D, Zhao B, Luo Z, Wu C, Gong Z. FlyCast. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW 2015. [DOI: 10.1145/2829988.2790002] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 10/23/2022]
Affiliation(s)
- Jinzhen Bao
- National University of Defense Technology, Changsha, China
| | - Dezun Dong
- National University of Defense Technology, Changsha, China
| | - Baokang Zhao
- National University of Defense Technology, Changsha, China
| | - Zhang Luo
- National University of Defense Technology, Changsha, China
| | - Chunqing Wu
- National University of Defense Technology, Changsha, China
| | - Zhenghu Gong
- National University of Defense Technology, Changsha, China
| |
Collapse
|
14
|
Samadi P, Gupta V, Xu J, Wang H, Zussman G, Bergman K. Optical multicast system for data center networks. OPTICS EXPRESS 2015; 23:22162-22180. [PMID: 26368190 DOI: 10.1364/oe.23.022162] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/05/2023]
Abstract
We present the design and experimental evaluation of an Optical Multicast System for Data Center Networks, a hardware-software system architecture that uniquely integrates passive optical splitters in a hybrid network architecture for faster and simpler delivery of multicast traffic flows. An application-driven control plane manages the integrated optical and electronic switched traffic routing in the data plane layer. The control plane includes a resource allocation algorithm to optimally assign optical splitters to the flows. The hardware architecture is built on a hybrid network with both Electronic Packet Switching (EPS) and Optical Circuit Switching (OCS) networks to aggregate Top-of-Rack switches. The OCS is also the connectivity substrate of splitters to the optical network. The optical multicast system implementation requires only commodity optical components. We built a prototype and developed a simulation environment to evaluate the performance of the system for bulk multicasting. Experimental and numerical results show simultaneous delivery of multicast flows to all receivers with steady throughput. Compared to IP multicast that is the electronic counterpart, optical multicast performs with less protocol complexity and reduced energy consumption. Compared to peer-to-peer multicast methods, it achieves at minimum an order of magnitude higher throughput for flows under 250 MB with significantly less connection overheads. Furthermore, for delivering 20 TB of data containing only 15% multicast flows, it reduces the total delivery energy consumption by 50% and improves latency by 55% compared to a data center with a sole non-blocking EPS network.
Collapse
|
15
|
Chowdhury M, Kandula S, Stoica I. Leveraging endpoint flexibility in data-intensive clusters. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW 2013. [DOI: 10.1145/2534169.2486021] [Citation(s) in RCA: 15] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 10/21/2022]
|
16
|
Hong CY, Kandula S, Mahajan R, Zhang M, Gill V, Nanduri M, Wattenhofer R. Achieving high utilization with software-driven WAN. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW 2013. [DOI: 10.1145/2534169.2486012] [Citation(s) in RCA: 136] [Impact Index Per Article: 11.3] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 10/21/2022]
Affiliation(s)
- Chi-Yao Hong
- University of Illinois at Urbana-Champaign, Urbana, IL, USA
| | | | | | | | | | | | | |
Collapse
|
17
|
Wang H, Xia Y, Bergman K, Ng TE, Sahu S, Sripanidkulchai K. Rethinking the physical layer of data center networks of the next decade. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW 2013. [DOI: 10.1145/2500098.2500105] [Citation(s) in RCA: 26] [Impact Index Per Article: 2.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 10/26/2022]
Abstract
Not only do big data applications impose heavy bandwidth demands, they also have diverse communication patterns denoted as *-cast) that mix together unicast, multicast, incast, and all-to-all-cast. Effectively supporting such traffic demands remains an open problem in data center networking. We propose an unconventional approach that leverages physical layer photonic technologies to build custom communication devices for accelerating each *-cast pattern, and integrates such devices into an application-driven, dynamically configurable photonics accelerated data center network. We present preliminary results from a multicast case study to highlight the potential benefits of this approach.
Collapse
Affiliation(s)
| | | | | | | | - Sambit Sahu
- IBM T.J. Watson Research Center, Yorktown Heights, NY, USA
| | | |
Collapse
|