检索结果-内蒙古大学图书馆

Packet scheduling in Multipath TCP: Fundamentals, Lessons, and Opportunities

IEEE SYSTEMS JOURNAL 2021年第1期15卷 1445-1457页

作者： Kimura, Bruno Y. L. Lima, Demetrius C. S. F. Loureiro, Antonio A. F. Fed Univ Sao Paulo ICT UNIFESP BR-12247014 Sao Jose Dos Campos SP Brazil Fed Univ Itajuba IESTI UNIFEI BR-37500903 Itajuba MG Brazil Fed Univ Minas Gerais DCC UFMG BR-31270901 Belo Horizonte MG Brazil

Multipath transmission control protocol (MPTCP) is a transport protocol that allows the simultaneous use of multiple transmission control protocol subflows across the existing IP addresses between peers. Since each subflow undergoes the bottleneck link condition of its path, selecting the best subflow to schedule an outgoing packet plays a key role in the multipath performance. While good scheduling decisions can significantly improve throughput, wrong decisions prevent users from benefiting the aggregating capacities of available subflows. To deal with this concern, in the last years, several scheduling solutions were proposed to achieve different goals and applications. Different from other surveys and tutorials, in this article, we provide a tutorial of packet scheduling in the MPTCP that brings not only its fundamentals but also a detailed analysis of multipath performance from a consistent experimental methodology. In a multipath network setup, we compare single-criterion and multicriteria schedulers under different bottleneck conditions and multipath congestion controls. From a comprehensive experimental analysis that unveils several performance issues, we discuss the lessons learned and research opportunities regarding the multipath throughput improvement as the central motivation. In this way, this article provides a comprehensive analysis of packet scheduling in the MPTCP, not only in theory but in practice as well.

关键词： scheduling algorithms scheduling Protocols Linux Kernel Tutorials Throughput Multipath transmission control protocol (MPTCP) multicriteria multipath congestion controls packet scheduling single criterion

来源：评论

学校读者我要写书评

暂无评论

Multiobjective Differential Evolution Algorithm for Solving Robotic Cell scheduling Problem With Batch-Processing Machines

引用

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2021年第2期18卷 757-775页

作者： Wu, Xiuli Yuan, Qi Wang, Ling Univ Sci & Technol Beijing Sch Mech Engn Beijing 100083 Peoples R China Tsinghua Univ Dept Automat Beijing 100084 Peoples R China

Robotic cell scheduling problem with batch-processing machines (RCSP-BMs) needs to determine the processing sequence and the transferring sequence simultaneously. The buffer size before and after the batch-processing machines has a big influence on the scheduling solution. A big amount of energy is always consumed by batch-processing machines. Hybrid flow shop scheduling has been proven NP-hard, and the features of the batch-processing machines in a flow shop make the hybrid flow shop scheduling more difficult. This study proposes a multiobjective differential evolution (DE) algorithm to address these issues. First, a mathematical optimization model is formulated for the RCSP-BMs to minimize makespan and energy consumption of the batch-processing machines. Second, the multiobjective DE algorithm (MODE) is developed. A green scheduling algorithm is designed to decode the individuals to balance the makespan and energy consumption. A local search method is also presented to help the searching escape from the local optimum. Finally, experiments are carried out, and the results show that the MODE can solve the robotic cell scheduling problem with batch-processing machines effectively and efficiently. Note to Practitioners-This study focuses on the robotic cell scheduling problem with batch-processing machines (RCSP-BMs) and discusses the influence of the buffer sizes and different batching methods on scheduling. In this study, we propose a green scheduling algorithm and a multiobjective differential evolution algorithm to optimize the makespan and the energy consumption of the batch-processing machines simultaneously. In future research, we will address more complicated situations, such as many-objective optimization and many-robot scheduling.

关键词： Robots Job shop scheduling Collision avoidance Energy consumption scheduling algorithms Batch-processing scheduling buffer size green scheduling algorithm hybrid flow shop scheduling multiobjective differential evolution (DE) algorithm robotic cell smart manufacturing system

来源：评论

学校读者我要写书评

暂无评论

Multipath scheduling for 5G Networks: Evaluation and Outlook

引用

IEEE COMMUNICATIONS MAGAZINE 2021年第4期59卷 44-50页

作者： Wu, Hongjia Caso, Giuseppe Ferlin, Simone Alay, Ozgu Brunstrom, Anna SimulaMet Oslo Norway OsloMet Oslo Norway Ericsson AB Gothenburg Sweden Univ Oslo Oslo Norway Karlstad Univ Distributed Syst & Commun Res Grp Karlstad Sweden

The fifth generation (5G) of cellular networks aims at providing very high data rates, ultra-reliable low latency, and massive connection density. As one of the fundamental design trends toward these objectives, 5G exploits multi-connectivity (i.e., the concurrent use of multiple access networks), where multipath transport protocols have emerged as key technology enablers. The scheduler of a multipath transport protocol determines how to distribute the data packets onto different paths and has a critical impact on the protocol performance. Within this context, we present in this article the first empirical evaluation of state-of-the-art multipath schedulers based on real 5G data, for both static and mobile scenarios. Furthermore, we introduce M-Peekaboo, which builds on a state-of-the-art learning-based multipath scheduler and extends its usage to 5G networks. Our results illustrate the benefits of employing a learning-based multipath scheduler for 5G networks and motivate further studies of advanced learning schemes that can adapt more quickly to the path conditions, and take into account the emerging features and requirements of 5G and beyond networks.

关键词： Transport protocols Performance evaluation Cellular networks 5G mobile communication scheduling algorithms Market research Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Elastic scheduling for Microservice Applications in Clouds

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2021年第1期32卷 98-115页

作者： Wang, Sheng Ding, Zhijun Jiang, Changjun Tongji Univ Key Lab Embedded Syst & Serv Comp Minist Educ Shanghai 201804 Peoples R China Tongji Univ Dept Comp Sci & Technol Shanghai 201804 Peoples R China

Microservices are widely used for flexible software development. Recently, containers have become the preferred deployment technology for microservices because of fast start-up and low overhead. However, the container layer complicates task scheduling and auto-scaling in clouds. Existing algorithms do not adapt to the two-layer structure composed of virtual machines and containers, and they often ignore streaming workloads. To this end, this article proposes an Elastic scheduling for Microservices (ESMS) that integrates task scheduling with auto-scaling. ESMS aims to minimize the cost of virtual machines while meeting deadline constraints. Specifically, we define the task scheduling problem of microservices as a cost optimization problem with deadline constraints and propose a statistics-based strategy to determine the configuration of containers under a streaming workload. Then, we propose an urgency-based workflow scheduling algorithm that assigns tasks and determines the type and quantity of instances for scale-up. Finally, we model the mapping of new containers to virtual machines as a variable-sized bin-packing problem and solve it to achieve integrated scaling of the virtual machines and containers. Via simulation-based experiments with well-known workflow applications, the ability of ESMS to improve the success ratio of meeting deadlines and reduce the cost is verified through comparison with existing algorithms.

关键词： Task analysis scheduling Containers Cloud computing scheduling algorithms Virtual machining Auto-scaling cloud computing containers microservice task scheduling

来源：评论

学校读者我要写书评

暂无评论

Minimizing Cost-Plus-Dissatisfaction in Online EV Charging Under Real-Time Pricing

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2022年第8期23卷 12464-12479页

作者： Lin, Qiulin Yi, Hanling Chen, Minghua City Univ Hong Kong Sch Data Sci Hong Kong Peoples R China Intellifus Inc Shenzhen 518000 Peoples R China

We consider an increasingly popular demand-response scenario where a home user schedules the flexible electric vehicle (EV) charging load in response to real-time electricity prices. The objective is to minimize the total charging cost with user dissatisfaction taken into account. We focus on the online setting where neither accurate prediction nor distribution of future real-time prices is available to the user when making irrevocable charging decisions in each time slot. The emphasis on considering user dissatisfaction and achieving optimal competitive ratio differentiates our work from existing ones and makes our study uniquely challenging. Our key contribution is two simple online algorithms with the optimal competitive ratio among all deterministic algorithms. The optimal competitive ratio is upper-bounded by $min{root{alpha/p_{min}},p_{max}/p_{min}} $ and the bound is asymptotically tight with respect to alpha, where $p_{max}$ and $p_{min}$ are the upper and lower bounds of real-time prices and $alpha >= p_{min}$ captures the consideration of user dissatisfaction. The bounds with respect to small and large values of alpha suggest the fundamental difference of the problems with and without considering user dissatisfaction. revFWe also extend the algorithms to take minimum charging requirement and short-term prediction into account. Simulation results based on real-world traces corroborate our theoretical findings and show that the empirical performance of our algorithms can be substantially better than the theoretical worst-case guarantees. Our algorithms also achieve notable performance gains under diverse settings as compared to conceivable alternatives.

关键词： Real-time systems Pricing Electric vehicle charging Costs Demand response Renewable energy sources Trajectory Electric vehicles (EVs) online optimization real-time pricing scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Simulating TSN Traffic scheduling and Shaping For Future Automotive Ethernet

引用

JOURNAL OF COMMUNICATIONS AND NETWORKS 2021年第1期23卷 53-62页

作者： Zhou, Zifan Lee, Juho Berger, Michael Stuebert Park, Sungkwon Yan, Ying Tech Univ Denmark Dept Photon Engn Lyngby Denmark Hanyang Univ Convergence Commun Lab Seoul South Korea

The broadening range of applications for vehicles has motivated the evolution of the automotive communication network. Ethernet has been deployed in production vehicles to build invehicle networks (IVN) by main manufacturers. To extent Ethernet with real-time service for future E/E architecture, a time-sensitive networking (TSN) profile for automotive Ethernet has been created. This paper evaluates the implementation of multiple traffic scheduling and shaping mechanisms in the automotive Ethernet, respectively. And we especially focus on two solutions, namely the time-aware shaping (TAS) and asynchronous traffic shaping (ATS). To investigate the performance, we introduce a TSN-based automotive gateway testing model in a simulation environment. Furthermore, another two methods, i.e., strict-priority and credit-based shaper (CBS), as well as TAS and ATS are implemented in the model and tested within a domain-based IVN scenario. The results show that TAS guarantees the shortest worst-case latency of high-priority streams, whereas it has a longer transmission latency for low-priority streams. ATS provides less determinism for high-priority streams than TAS, but ensures a better average latency of all streams.

关键词： Automotive electronics Ethernet networks scheduling algorithms simulation time-sensitive networking

来源：评论

学校读者我要写书评

暂无评论

Multi-Queue Request scheduling for Profit Maximization in IaaS Clouds

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2021年第11期32卷 2838-2851页

作者： Wang, Shuang Li, Xiaoping Sheng, Quan Z. Ruiz, Ruben Zhang, Jinquan Beheshti, Amin Southeast Univ Sch Comp Sci & Engn Nanjing 211189 Peoples R China Southeast Univ Minist Educ Key Lab Comp Network & Informat Integrat Nanjing 211189 Peoples R China Macquarie Univ Dept Comp Sydney NSW 2109 Australia Univ Politecn Valencia Grp Sistemas Optimizac Aplicada Camino Vera S-N Valencia 46022 Spain

In cloud computing, service providers rent heterogeneous servers from cloud providers, i.e., Infrastructure as a Service (IaaS), to meet requests of consumers. The heterogeneity of servers and impatience of consumers pose great challenges to service providers for profit maximization. In this article, we transform this problem into a multi-queue model where the optimal expected response time of each queue is theoretically analyzed. A multi-queue request scheduling algorithm framework is proposed to maximize the total profit of service providers, which consists of three components: request stream splitting, requests allocation, and server assignment. A request stream splitting algorithm is designed to split the arriving requests to minimize the response time in the multi-queue system. An allocation algorithm, which adopts a one-step improvement strategy, is developed to further optimize the response time of the requests. Furthermore, an algorithm is developed to determine the appropriate number of required servers of each queue. After statistically calibrating parameters and algorithm components over a comprehensive set of random instances, the proposed algorithms are compared with the state-of-the-art over both simulated and real-world instances. The results indicate that the proposed multi-queue request scheduling algorithm outperforms the other algorithms with acceptable computational time.

关键词： Servers Time factors Cloud computing Task analysis Queueing analysis Resource management scheduling algorithms Profit maximization consumer impatience queue scheduling cloud computing

来源：评论

学校读者我要写书评

暂无评论

Adaptive CSMA for Decentralized scheduling of Multi-Hop Networks With End-to-End Deadline Constraints

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2021年第3期29卷 1224-1237页

作者： Singh, Rahul Kumar, P. R. Indian Inst Sci Dept Elect Commun Engn Bengaluru 560012 India Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

Consider a multihop wireless network serving multiple flows in which wireless interference constraints between links are described by a link-interference graph. The timely-throughput of a flow is defined as the throughput of packets of that flow that reach their destination node within a specified deadline, and the weighted timely throughput of the network is their weighted average over the flows with a given set of positive weights. The problem is particularly challenging, and has generally been open, when there is wireless interference between transmissions. We show that a modified CSMA routing-scheduling policy with an appropriate set of attempt probabilities is nearly optimal for maximizing weighted timely-throughput. This policy has the useful property that the routing-scheduling decision for an individual packet is solely a function of its location and time-to-deadline, and so a wireless node does not require knowledge of the global network state. It is easily implementable in a decentralized fashion by the nodes given the attempt probabilities. A gradient-based adaptive CSMA routing-scheduling policy to determine the optimal attempt probabilities is further provided. It moves along the gradient of the timely throughput and converges to a local maximum.

关键词： Bandwidth Throughput Multiaccess communication Wireless sensor networks Spread spectrum communication Interference constraints Wireless networks scheduling algorithms wireless networks multi-armed bandits real-time systems

来源：评论

学校读者我要写书评

暂无评论

Design of a Two-Stage scheduling Scheme for DVB-S2/S2X Satellite Architecture

引用

IEEE TRANSACTIONS ON BROADCASTING 2021年第2期67卷 424-437页

作者： Tropea, Mauro De Rango, Floriano Santamaria, Amilcare Francesco Univ Calabria Dept Informat Modeling Elect & Syst Engn DIMES I-87036 Arcavacata Di Rende Italy Consorzio Nazl Interuniv Telecomunicaz CNIT I-43124 Parma Italy Vitrociset SpA I-00156 Rome Italy

One of the main characteristics of the DVB-S2/S2X standard is the capability of using the Adaptive Coding and Modulation (ACM) technique. Differently from Variable Coding and Modulation (VCM), ACM provides a feedback path in the return channel for dynamically varying protection error levels in accordance with different channel conditions. In this article, a double-layer packet scheduling mechanism able to support different QoS levels monitoring the propagation and channel conditions is proposed. It consists of a Two-Stage Scheduler (TSS) approach and proposes two novel schedulers to be used in the first and second stage: an Adaptive Priority-based scheduling (APS) able to account QoS requirements is proposed for the first stage;an improved version of Proportional Fair queueing (PF) called PF with Padding and Packing (PF-PP), able to select and transmit in the forward link frames in accordance to an appropriate fair policy is designed for the second stage. Performed experiments show an improvement of the overall system performance in terms of packet drop rate, delay jitter, and packets delay.

关键词： Quality of service Digital video broadcasting scheduling Satellite broadcasting Satellites Standards scheduling algorithms Two stage scheduler hierarchical scheduling satellite DVB-S2 DVB-S2X

来源：评论

学校读者我要写书评

暂无评论

An Extensive Study on the Performance Evaluation and scheduling of HeNBs

引用

IEEE ACCESS 2021年 9卷 40098-40110页

作者： Paulo, Rui R. Velez, Fernando J. Inst Telecomunicacoes Fac Engn DEM P-6201001 Covilha Portugal Univ Beira Interior P-6201001 Covilha Portugal

Since the dawn of mobile communication systems, reducing the cell size has been one option to increase the signal-to-interference-plus-noise ratio (SINR) in both links. The impact of this reduction can be perfectly understood by considering Shannon's law. This work studies in detail the performance of Home eNBs (HeNBs), nodes with a smaller coverage area. After a detailed theoretical study of the SINR, a simulation approach is used to extract performance results in small cell indoor scenarios. Results corresponding to the goodput, delay and packet loss ratio are analyzed. Based on an improved version of LTE-Sim, the proportional fair, frame level scheduler (FLS) and exponential rule are tested in an indoor environment. With the saturation conditions taken into consideration, the FLS performs better than the other schedulers. This work shows that with the considered applications, it is possible to achieve a reduction in the transmitter power of HeNBs without compromising the small cell network performance.

关键词： Interference Signal to noise ratio Radio transmitters Streaming media scheduling algorithms Buildings Bandwidth Delay small cell femtocells goodput HeNBs LTE-Sim packet loss ratio packet scheduler saturation conditions SINR

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：