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

8th IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

作者： Sheikh, Anooq Muzaffar Fiandrotti, Attilio Magli, Enrico Politecn Torino Dipartimento Elettron & Telecomunicaz Turin Italy

ISBN: (纸本)9781467360470

This paper presents a distributed push-based packet scheduling algorithm for Peer-to-Peer (P2P) IPTV streaming with Network Coding (NC) over unorganized random network topologies. The benefits of random-push NC for P2P system have been investigated previously, packet scheduling in P2P systems using NC is still largely uninvestigated. The proposed scheduling algorithm aims to opt for a policy that maximizes the number of peers that completely retrieve the media content. We compare the performance of the proposed scheduling algorithm with a typical random scheduler as reference. Our results show increased performance in terms of media quality and bandwidth consumption.

关键词： distributed scheduling P2P IPTV Internet TV Video Streaming Network Coding

来源：评论

学校读者我要写书评

暂无评论

QoS-TEOS:QoS Guaranteed Throughput-Efficiency Optimal distributed scheduling in WiMAX Mesh Networks

引用

Journal of Computer Science & Technology 2010年第5期25卷 970-981页

作者：滕达杨寿保赫卫卿胡云 School of Computer Science and Technology University of Science and Technology of China CCF

WiMAX distributed scheduling can be modeled as two procedures：three-way handshaking procedure and data subframe scheduling *** to manipulating data transmission directly,data subframe scheduling has a closer relationship with user Quality of Service（QoS） satisfaction,and has more severe impact on network performance,compared with handshaking procedure.A QoS guaranteed Throughput-Efficiency Optimal distributed data subframe scheduling scheme,named as QoS-TEOS,is ***-TEOS achieves QoS guarantee through modeling services into different ranks and assigning them with corresponding priorities.A service with higher priority is scheduled ahead of that with lower priority and offered with high QoS *** kinds of services that request similar QoS quality are classified into one service *** service sets are scheduled with different ***-TEOS promotes network performance through improving network throughput and *** analysis shows that the scheduled data transmission should balance data generation rate from upper layer and transmission rate of physical layer,to avoid network throughput and efficiency *** results show that QoS-TEOS works excellently to achieve throughput-efficiency optimization and guarantee a high QoS.

关键词： distributed scheduling data subframe scheduling network efficiency quality of service(QoS) throughput WiMAX mesh networks

来源：评论

学校读者我要写书评

暂无评论

PHY-Aware distributed scheduling for Ad Hoc Communications with Physical Interference Model

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2009年第5期8卷 2682-2693页

作者： Ge, Weiyan Zhang, Junshan Wieselthier, Jeffrey E. Shen, Xuemin (Sherman) Qualcomm Inc San Diego CA 92121 USA Arizona State Univ Dept Elect Engn Tempe AZ 85287 USA Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

We consider a random-access-based ad hoc network, where different links use mini-slots to contend for the channel, and then successful links transmit data packets, as in CSMA. The focus of our study is to develop optimal strategies for physical-layer-aware (PHY-aware) distributed scheduling, which involves a joint process of channel probing and distributed scheduling. Because of channel fading and cochannel interference, the signal-to-interference-plus-noise-ratio (SINR) across links is highly dynamic and can exhibit significant variation. In the low SINR case, further channel probing is likely to lead to better SINR conditions and hence yield higher throughput. The desired tradeoff boils down to judiciously choosing the optimal stopping strategy for channel probing before data transmissions. In this paper, we investigate PHY-aware distributed scheduling, aiming to maximize the overall network throughput. The problem under consideration is inherently challenging: 1) multiple links can transmit successfully simultaneously and the number of simultaneously transmitting links is random;and 2) the network throughput is the sum rate of all transmitting links, but each link involved in the transmission has no knowledge of the instantaneous rates of other links, and the stopping decision is made in a distributed manner based on local information only. We use optimal stopping theory to tackle this challenge, and show that the optimal policy for distributed scheduling has a threshold structure. Accordingly, after a channel probing, a link would proceed with data transmissions only if a function of its instantaneous rate is greater than the optimal rate threshold. Observing that the network throughput depends heavily on the contention probability of each link, we generalize the study to jointly optimize the rate threshold and the contention probability, and propose a two-stage algorithm for computing the pair of optimal rate threshold and contention probability by using fracti

关键词： distributed scheduling physical interference model optimal stopping ad hoc communications

来源：评论

学校读者我要写书评

暂无评论

A column generation based distributed scheduling algorithm for multi-mode resource constrained project scheduling problem

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2018年 125卷 258-278页

作者： Liu Changchun Xiang Xi Zhang Canrong Wang Qiang Zheng Li Tsinghua Univ Dept Ind Engn Beijing 100084 Peoples R China Tsinghua Univ Grad Sch Shenzhen Logist Engn & Simulat Lab Shenzhen 518055 Peoples R China

This study develops a column generation-based distributed scheduling algorithm for multi-mode resource constrained project scheduling problem. The proposed distributed algorithm shares less information among independent decision makers compared with the traditional integrated approach. In this problem, many independent processors, which can produce different types of products, coordinate with a resource manager (or third-party logistic), who provides different types of vehicles to deliver products to the customers. The problem is decomposed into two parts: production planning for individual processors and vehicle scheduling for the resource manager. A total of 1200 instances are randomly generated to verify the effectiveness of the proposed distributed algorithm. Results of computational experiments verify that the proposed distributed algorithm has good solution quality and calculation efficiency compared with the integrated approach, i.e., CPLEX, hybrid Benders Decomposition, and Lagrangian Relaxation. Lastly, a general framework for the distributed algorithm is proposed to solve a generalized problem.

关键词： Multi-mode resource constrained project scheduling problem distributed scheduling Information-sharing Column generation

来源：评论

学校读者我要写书评

暂无评论

Application of genetic algorithms with dominant genes in a distributed scheduling problem in flexible manufacturing systems

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2006年第3期44卷 523-543页

作者： Chan, FTS Chung, SH Chan, PLY Univ Hong Kong Dept Ind & Mfg Syst Engn Hong Kong Hong Kong Peoples R China

Multi-factory production networks have increased in recent years. With the factories located in different geographic areas, companies can benefit from various advantages, such as closeness to their customers, and can respond faster to market changes. Products ( jobs) in the network can usually be produced in more than one factory. However, each factory has its operations efficiency, capacity, and utilization level. Allocation of jobs inappropriately in a factory will produce high cost, long lead time, overloading or idling resources, etc. This makes distributed scheduling more complicated than classical production scheduling problems because it has to determine how to allocate the jobs into suitable factories, and simultaneously determine the production scheduling in each factory as well. The problem is even more complicated when alternative production routing is allowed in the factories. This paper proposed a genetic algorithm with dominant genes to deal with distributed scheduling problems, especially in a flexible manufacturing system (FMS) environment. The idea of dominant genes is to identify and record the critical genes in the chromosome and to enhance the performance of genetic search. To testify and benchmark the optimization reliability, the proposed algorithm has been compared with other approaches on several distributed scheduling problems. These comparisons demonstrate the importance of distributed scheduling and indicate the optimization reliability of the proposed algorithm.

关键词： genetic algorithms dominant genes distributed scheduling flexible manufacturing systems (FMS)

来源：评论

学校读者我要写书评

暂无评论

EDSF: Efficient distributed scheduling Function for IETF 6TiSCH-based Industrial Wireless Networks

引用

MOBILE NETWORKS & APPLICATIONS 2022年第6期27卷 2244-2253页

作者： Yang, Wei Cao, Yuanlong Wang, Hao Zhang, Zhiming Wu, Celimuge Jiangxi Normal Univ Sch Software Nanchang Jiangxi Peoples R China Univ Electrocommun Grad Sch Informat & Engn Chofu Tokyo Japan

IETF 6TiSCH, which is composed of the IEEE802.15.4e and IPv6 RPL protocols, is a highly reliable and low-power industrial wireless network protocol stack. IEEE802.15.4e is the medium access control (MAC) layer protocol of the protocol stack-it defines a time-slotted channel hopping communication mode. IPv6 RPL is the network layer protocol of the protocol stack-it allows multiple nodes to form a multi-hop network. scheduling is vital to the 6TiSCH protocol stack, as it defines the MAC layer cells to send/receive by the network packets. Herein, we propose an efficient distributed scheduling function (EDSF) for 6TiSCH wireless networks;it fully considers the use probability and distance of cells rather than random selection. Additionally, a schedule collision detection algorithm is proposed to detect two pairs of neighbor nodes that use the same cell. It fully utilizes the historical statistical data from the cell packet delivery ratio. Finally, we implement the EDSF scheme and verify its performance through experiments on a 6TiSCH simulator. The experimental results show that our proposed scheme can achieve a low end-to-end latency without additional costs.

关键词： 6TiSCH distributed scheduling Industrial wireless network Time-slotted channel hopping (TSCH)

来源：评论

学校读者我要写书评

暂无评论

Self-healing distributed scheduling for end-to-end delay optimization in multihop wireless networks with 6TiSCh

引用

COMPUTER COMMUNICATIONS 2017年第Sep.15期110卷 103-119页

作者： Hosni, Ines Theoleyre, Fabrice Univ Tunis El Manar Natl Engn Sch Tunis Lab Syst Commun Tunis Tunisia Univ Strasbourg CNRS ICube Lab Blvd Sebastien Brant F-67412 Illkirch Graffenstaden France

Time Slotted Channel Hopping (TSCH) is an amendment of the IEEE 802.15.4 working group to provide a low-power Medium Access Control (MAC) for the Internet of Things (IoT). This standard relies on techniques such as channel hopping and bandwidth reservation to ensure both energy savings and reliable transmissions. Since many applications require low end-to-end delay (e.g. alarms), we propose here a distributed algorithm to schedule the transmissions with a short end-to-end delay. We divide the network in stratums, regrouping all the nodes with the same depth in the DODAG constructed by RPL. Then, different time-frequency blocks are assigned deterministically to each stratum. By appropriately organizing the blocks in the slotframe, we are able to deliver a packet before the end of the slotframe, whatever the route length is. We present a simple analytical study to define the initial size of each block in a homogeneous scenario. We experimentally analyze the behavior of our strategy to validate its ability to provide both high reliability and low latency in a distributed manner. (C) 2017 Elsevier B.V. All rights reserved.

关键词： IEEE802.15.4-TSCH End-to-end delay Self-healing distributed scheduling Autonomous Large-scale experiments

来源：评论

学校读者我要写书评

暂无评论

REAL-TIME distributed scheduling OF HETERARCHICAL MANUFACTURING SYSTEMS

引用

JOURNAL OF MANUFACTURING SYSTEMS 1994年第2期13卷 94-107页

作者： DUFFIE, NA PRABHU, VV University of Wisconsin-Madison USA

Lack of master-slave relationships and absence of a centralized supervisor in heterarchical manufacturing systems prohibits the use of centralized scheduling. A fully distributed scheduling method for these systems is described in this paper. Entities in the system continually generate tentative local schedules in real time using a cooperative scheduling heuristic and select the best schedule for execution. Tentative schedules are evaluated in time-scaled, distributed simulations using software that is a replica of the real system software. The state of the real system is copied into this virtual system at the beginning of each simulation, eliminating cumulative uncertainties and immediately incorporating equipment failures and other unexpected events into schedule evaluation. Experimental results illustrate the real-time distributed scheduling method and its response to faults.

关键词： distributed CONTROL HETERARCHICAL SYSTEMS REAL-TIME scheduling distributed scheduling distributed SIMULATION

来源：评论

学校读者我要写书评

暂无评论

Incentive-Based distributed scheduling of Electric Vehicle Charging Under Uncertainty

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2019年第1期34卷 3-11页

作者： Zhou, Yaqin Kumar, Rajnish Tang, Shaojie Nanyang Technol Univ Singapore 639798 Singapore Natl Univ Singapore Singapore 119077 Singapore Univ Texas Richardson Richardson TX 75080 USA

We consider a power system with N charging stations, each of which has local renewable generation and electric vehicle (EV) arrivals with deadline constraints for their requests. To reduce the adverse impact brought by uncoordinated charging, the utility company requires to adopt advanced load management to control the load supplied to stations but without collecting many details. The major challenge is to incentivize them to coordinate charging for its system-wide optimization while meeting all charging requests, regarding inherent uncertainties. We model a game that aims to minimize the total electricity cost at the utility company meanwhile maximize the payoff of each station. We combine epsilon-Nash equilibrium and Lyapunov optimization to design a low-complexity distributed scheduling scheme of EV charging. It achieves at most O(1/V) more than the optimal cost where V is a controllable parameter that balances between the cost and average fulfillment ratio of charging requests. The payoff of each station is around O(1/V) less than the optimal payoff if using a small V. Simulation results under real-world traces show that, compared with a state-of-the-art scheduling algorithm, our algorithm reduces the peak-to-average ratio and charging cost, respectively, by 94.32% and 44.21%, and increases the payoff by 52.27% averagely.

关键词： Game theory distributed scheduling EV charging Lyapunov optimization

来源：评论

学校读者我要写书评

暂无评论

LDSF: Low-Latency distributed scheduling Function for Industrial Internet of Things

引用

IEEE INTERNET OF THINGS JOURNAL 2020年第9期7卷 8688-8699页

作者： Kotsiou, Vasileios Papadopoulos, Georgios Z. Chatzimisios, Periklis Theoleyre, Fabrice Univ Strasbourg ICube Lab CNRS F-67412 Illkirch Graffenstaden France IMT Atlantique UBL IRISA Cesson Sevigne 35510 France Int Hellen Univ Dept Sci & Technol Thessaloniki 57001 Greece

The Industrial Internet of Things (IIoT) is expected to be a key enabler for the Industry 4.0. However, networked control automation often requires high reliability and bounded latency to react properly. Thus, modern wireless protocols for industrial networks, such as IEEE 802.15.4-2015 time-slotted channel hopping (TSCH), rely on a strict schedule of the transmissions to avoid collisions and to make the end-to-end traffic deterministic. Unfortunately, guaranteeing a bounded end-to-end latency is particularly challenging since transmissions have to be temporally chained. Even worse, potential degradation of the link quality may result in reconstructing the whole TSCH schedule along the path. In this article, we propose the low-latency distributed scheduling function (LDSF) that relies on the organization of the slotframe in smaller parts, called blocks. Each transmitter selects the right set of blocks, depending on its hop distance from the border router, so that retransmission opportunities are automatically scheduled. To save energy, a node can still turn off its radio as soon as its packet is correctly acknowledged. Our mathematical analysis as well as our simulation evaluation show the efficiency of the proposed LDSF algorithm compared to three state-of-the-art scheduling functions (SFs): 1) the minimal SF (MSF);2) low-latency SF (LLSF);and 3) stratum.

关键词： Delays Schedules Job shop scheduling scheduling algorithms Internet of Things Reliability distributed scheduling end-to-end delay high reliability Industrial Internet of Things (IIoT)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：