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

Towards distributed Flow scheduling in IEEE 802.1Qbv Time-Sensitive Networks

ACM TRANSACTIONS ON SENSOR NETWORKS 2024年第5期20卷 1-30页

作者： Guo, Miao He, Shibo Gu, Chaojie Guo, Xiuzhen Chen, Jiming Gao, Tao Wang, Tongtong Zhejiang Univ Coll Control Sci & Engn Hangzhou Zhejiang Peoples R China Huawei Technol Co Ltd Beijing Peoples R China

Flow scheduling plays a pivotal role in enabling Time-Sensitive Networking (TSN) applications. Current flow scheduling mainly adopts a centralized scheme, posing challenges in adapting to dynamic network conditions and scaling up for larger networks. To address these challenges, we first thoroughly analyze the flow scheduling problem and find the inherent locality nature of time scheduling tasks. Leveraging this insight, we introduce the first distributed framework for IEEE 802.1Qbv TSN flow scheduling. In this framework, we further propose a multi-agent flow scheduling method by designing Deep Reinforcement Learning (DRL)-based route and time agents for route and time planning tasks. The time agents are deployed on field devices to schedule flows in a distributed way. Evaluations in dynamic scenarios validate the effectiveness and scalability of our proposed method. It enhances the scheduling success rate by 20.31% compared to state-of-the-art methods and achieves substantial cost savings, reducing transmission costs by 410x in large-scale networks. Additionally, we validate our approach on edge devices and a TSN testbed, highlighting its lightweight nature and ease of deployment.

关键词： Time-sensitive networking distributed scheduling deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Design and Analysis of A New distributed scheduling Approach

Design and Analysis of A New Distributed Scheduling Approach

引用

IEEE Symposium on Computers and Communications

作者： Wenzhuo Li Chuang Lin Chao Xue Department of Computer Science and Technology Tsinghua University Beijing China

Big data analytics frameworks are developing towards larger degrees of parallelism and shorter task durations to achieve lower latency. Consequently, millions of scheduling decisions need to be made per second, which has posed a big challenge to today's centralized schedulers. Therefore, many researchers and enterprises turn to distributed scheduling approaches to avoid the throughput limitation of centralized designs. To our knowledge, Omega, Apollo and Sparrow are three famous approaches that make prior moves in distributed scheduling but they each have shortcomings and none of them try peer-to-peer architecture. We then propose a new scheduling approach called Piper that adapts peer-to-peer idea to the domain of distributed scheduling, which provides near-optimal performance. We have implemented Piper using Apache Thrift and the results show that Piper reduces job response times by over 1.5× when compared to Sparrow (we select Sparrow for comparison because it is a leading design and has been open source). In addition, trace-driven simulations have been used to evaluate Piper when scaling to large clusters, which further reveals that Piper provides better performance than Sparrow.

关键词： distributed scheduling Peer-to-peer Response time Scalability Big data

来源：评论

学校读者我要写书评

暂无评论

distributed Multiuser scheduling for Improving Throughput of Wireless LAN

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2014年第5期13卷 2770-2781页

作者： Tang, Suhua ATR Adapt Commun Res Labs Kyoto Japan

In wireless LANs, the performance of CSMA/CA might be degraded by several problems: (i) severe collisions in the uplink, (ii) head-of-line problem caused by fading in the downlink, and (iii) serious unfairness between uplink and downlink. In this paper, a distributed multiuser scheduling (DMUS) scheme is proposed to simultaneously address these problems. In DMUS, a node (i) computes its normalized SNR (signal to noise ratio) as the ratio of its instantaneous SNR to its average SNR, and (ii) contends via a contention window (CW) for the channel to initiate its uplink or downlink transmission when its normalized SNR is greater than a threshold. The contribution is threefold: (i) All three problems are solved in a unified framework by applying multiuser diversity in both uplink and downlink. Fresh SNR is exploited for distributed scheduling meanwhile airtime fairness is retained. (ii) SNR threshold and CW are jointly optimized to maximize throughput, taking into account time-variant link quality, collision probability and protocol overhead. (iii) Network performance is theoretically analyzed. Extensive simulations confirm that DMUS greatly improves total throughput under almost all scenarios compared with both the contention-based CSMA/CA scheme and the contention-free PCF scheme.

关键词： CSMA/CA multiuser diversity multipath fading airtime fairness distributed scheduling cross-layer design

来源：评论

学校读者我要写书评

暂无评论

distributed Dynamic scheduling for Cyber-Physical Production Systems Based on a Multi-Agent System

引用

IEEE ACCESS 2018年 6卷 1855-1869页

作者： Jiang, Zengqiang Jin, Yang Mingcheng, E. Li, Qi Beijing Jiaotong Univ Sch Mech Elect & Control Engn Beijing 100044 Peoples R China

The world is experiencing a new industrial revolution characterized by intelligent manufacturing. Cyber-physical production systems (CPPSs) have become a research focus due to their proposed use as a solution to the development of flexible and reactive systems. The application of current centralized scheduling methods is difficult because of the enhanced precision control mode of a CPPS. Therefore, this paper focuses on distributed optimal scheduling based on multi-agent systems. First, the goals and constraints of the system are set, a two-layer decision model and the required indicators are designed to ensure the overall optimization effect, and the roles and functions of different agents are then set. Second, the dynamic decision cycle and the multistage negotiation mechanism based on the contract net protocol are studied to ensure the quality of negotiation. A rescheduling algorithm is designed to guarantee adaptability in the case of disturbance in the system. Finally, the applicability and superiority of the strategies are demonstrated via experiments and case studies.

关键词： Cyber-physical production system multi-agent system distributed scheduling two-layer decision model contract net protocol

来源：评论

学校读者我要写书评

暂无评论

distributed priority scheduling and medium access in ad hoc networks

引用

WIRELESS NETWORKS 2002年第5期8卷 455-466页

作者： Kanodia, V Li, CZ Sabharwal, A Sadeghi, B Knightly, E Rice Univ Dept ECE Houston TX 77005 USA Univ Virginia CS Dept Charlottesville VA USA

Providing Quality-of-Service in random access multi-hop wireless networks requires support from both medium access and packet scheduling algorithms. However, due to the distributed nature of ad hoc networks, nodes may not be able to determine the next packet that would be transmitted in a (hypothetical) centralized and ideal dynamic priority scheduler. In this paper, we develop two mechanisms for QoS communication in multi-hop wireless networks. First, we devise distributed priority scheduling, a technique that piggybacks the priority tag of a node's head-of-line packet onto handshake and data packets;e.g., RTS/DATA packets in IEEE 802.11. By monitoring transmitted packets, each node maintains a scheduling table which is used to assess the node's priority level relative to other nodes. We then incorporate this scheduling table into existing IEEE 802.11 priority backoff schemes to approximate the idealized schedule. Second, we observe that congestion, link errors, and the random nature of medium access prohibit an exact realization of the ideal schedule. Consequently, we devise a scheduling scheme termed multi-hop coordination so that downstream nodes can increase a packet's relative priority to make up for excessive delays incurred upstream. We next develop a simple analytical model to quantitatively explore these two mechanisms. In the former case, we study the impact of the probability of overhearing another packet's priority index on the scheme's ability to achieve the ideal schedule. In the latter case, we explore the role of multi-hop coordination in increasing the probability that a packet satisfies its end-to-end QoS target. Finally, we perform a set of ns-2 simulations to study the scheme's performance under more realistic conditions.

关键词： distributed scheduling medium access IEEE 802.11 ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

A kind of Two-Level Cooperation distributed scheduling Strategy

A kind of Two-Level Cooperation Distributed Scheduling Strat...

引用

2014 IEEE 5th International Conference on Software Engineering and Service Science

作者： Dongru Ruan Yu hua Zhifeng Pang School of Information Science and Engineering Hebei University of Science and Technology

This paper studies the two-level collaborative work architecture of resources allocation mechanism for remote collaborative distribution,researches on key technologies of twolevel organization activities in real-time dynamic allocate resources,proposed a two-level collaborative scheduling algorithm to support resources *** application showed that the system had a good serviceability.

关键词： two-level cooperation resource allocation distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

Approaching Throughput-Optimality in distributed CSMA scheduling Algorithms With Collisions

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2011年第3期19卷 816-829页

作者： Jiang, Libin Walrand, Jean Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important but idealized assumption is that the sensing time is negligible, so that there is no collision. In this paper, we study more practical CSMA-based scheduling algorithms with collisions. First, we provide a Markov chain model and give an explicit throughput formula that takes into account the cost of collisions and overhead. The formula has a simple form since the Markov chain is "almost" time-reversible. Second, we propose transmission-length control algorithms to approach throughput-optimality in this case. Sufficient conditions are given to ensure the convergence and stability of the proposed algorithms. Finally, we characterize the relationship between the CSMA parameters (such as the maximum packet lengths) and the achievable capacity region.

关键词： Carrier sence multiple access (CSMA) convex optimization distributed scheduling Markov chain

来源：评论

学校读者我要写书评

暂无评论

Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach

引用

ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING 2006年第5-6期22卷 493-504页

作者： Chan, Felix T. S. Chung, S. H. Chan, L. Y. Finke, G. Tiwari, M. K. Univ Hong Kong Dept Ind & Mfg Syst Engn Hong Kong Hong Kong Peoples R China Univ Grenoble 1 LEIBNIZ IMAG F-38041 Grenoble France

In general, distributed scheduling problem focuses on simultaneously solving two issues: (i) allocation of jobs to suitable factories and (ii) determination of the corresponding production scheduling in each factory. The objective of this approach is to maximize the system efficiency by finding an optimal planning for a better collaboration among various processes. This makes distributed scheduling problems more complicated than classical production scheduling ones. With the addition of alternative production routing, the problems are even more complicated. Conventionally, machines are usually assumed to be available without interruption during the production scheduling. Maintenance is not considered. However, every machine requires maintenance, and the maintenance policy directly affects the machine's availability. Consequently, it influences the production scheduling. In this connection, maintenance should be considered in distributed scheduling. The objective of this paper is to propose a genetic algorithm with dominant genes (GADG) approach to deal with distributed flexible manufacturing system (FMS) scheduling problems subject to machine maintenance constraint. The optimization performance of the proposed GADG will be compared with other existing approaches, such as simple genetic algorithms to demonstrate its reliability. The significance and benefits of considering maintenance in distributed scheduling will also be demonstrated by simulation runs on a sample problem. (C) 2006 Elsevier Ltd. All rights reserved.

关键词： distributed scheduling flexible manufacturing systems genetic algorithms maintenance

来源：评论

学校读者我要写书评

暂无评论

On distributed Multimedia scheduling With Constrained Control Channels

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2011年第5期13卷 1040-1051页

作者： Zhou, Liang Chen, Hsiao-Hwa Nanjing Univ Posts & Telecommun Minist Educ Key Lab Broadband Wireless Commun & Sensor Networ Nanjing 210003 Peoples R China Natl Cheng Kung Univ Dept Engn Sci Tainan 70101 Taiwan

Traditional multimedia scheduling approaches assumed perfect control channels where each node has access to the knowledge of its neighbors. However, in practice the control channels are always constrained and nodes can only exchange limited information with their neighbors. In this paper, we investigate how imperfect neighbor information affects the multimedia scheduling. First, we formulate the optimal multimedia scheduling problem with the constraints on network information. Specifically, a constrained factor is introduced to capture the profile of control channels. Then, we consider two cases of the constrained factor distribution: 1) the class with finite mean and variance, and 2) a general class that does not employ any parametric representation. In each case, we investigate the relationship between the control gain and scheduling performance based on available network and multimedia information. We show that the control gain can be chosen properly such that the optimal distributed multimedia scheduling can be achieved with an exponential convergence rate. In addition, an explicit equation for asymptotic convergence rate is derived for each case. Finally, we use computer simulations to verify the analytical results.

关键词： Constrained control channels control gain distributed scheduling multimedia communication

来源：评论

学校读者我要写书评

暂无评论

distributed link scheduling method with physical interference model in wireless multi-hop networks

引用

High Technology Letters 2013年第4期19卷 353-358页

作者：樊帅 Zhang Lin Feng Wei Ren Yong Department of Electronic Engineering Tsinghua University

To further increase the throughput of wireless multi-hop networks,a distributed scheduling method is proposed,which takes physical interference model into *** is assumed that nodes in the network can perform physical carrier sensing,and the carrier sensing range can be set to different *** the traditional carrier sensing mechanism,the carrier sensing range is computed under the protocol interference model,which is not *** the optimal carrier sensing range with physical interference model is *** sending node implements the distributed approach in three phases at each time slot,and all the concurrent transmissions are interference *** performance can be achieved under this scheduling *** approximation ratio of the distributed method to the optimal one is also proved.

关键词： wireless multi-hop network physical interference model distributed scheduling physical carrier sensing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：