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

distributed scheduling With Centralized Coordination for Scalable Wireless Mesh Networking

IEEE-ACM TRANSACTIONS ON NETWORKING 2023年第1期31卷 436-451页

作者： Huang, Cheng Wang, Xudong Shanghai Jiao Tong Univ UM SJTU Joint Inst Shanghai 200240 Peoples R China

A coordinated carrier sense multiple access (C-CSMA) scheme is developed to schedule packet transmissions in multihop wireless networks. It integrates distributed scheduling and centralized coordination at different time scales. At a small time scale, a distributed scheduling algorithm, which is incorporated into CSMA, runs on each node to determine key parameters for CSMA. These parameters are optimized by ensuring multiple network attributes, i.e., average link date rate, node transmission probability, and the conditional probability of a link being selected for transmission, approaching their corresponding optimal values at a large time scale, e.g., a few seconds. Such optimal values are obtained from a centralized algorithm running on a portal node. The algorithm collects topology, link, and traffic information from the network at a large time scale and determines the attributes above to fulfill the optimal tradeoff between throughput and fairness. Since the distributed algorithm is shepherded by the centralized algorithm, C-CSMA has high scalability: first, it achieves long-term optimal performance with low information collection overhead;second, it schedules packet transmissions in a distributed way and responds quickly to changes in networks. It is proved that network attributes resulting from the distributed scheduling algorithm converge to optimal values provided by the centralized algorithm. Simulation experiments demonstrate that the convergence speed is fast. Moreover, extensive simulation results show that C-CSMA achieves much higher throughput, better fairness, and lower delay than existing scheduling schemes under different carrier sensing thresholds and traffic conditions.

关键词： Throughput scheduling Spread spectrum communication Mesh networks Behavioral sciences Topology Scalability Multihop wireless networks distributed scheduling stochastic hybrid approximation

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling of Event Analytics across Edge and Cloud

引用

ACM TRANSACTIONS ON CYBER-PHYSICAL SYSTEMS 2018年第4期2卷 1–28页

作者： Ghosh, Rajrup Simmhan, Yogesh Indian Inst Sci Dept Computat & Data Sci Bangalore 560012 Karnataka India

Internet of Things (IoT) domains generate large volumes of high-velocity event streams from sensors, which need to be analyzed with low latency to drive decisions. Complex Event Processing (CEP) is a Big Data technique to enable such analytics and is traditionally performed on Cloud Virtual Machines (VM). Leveraging captive IoT edge resources in combination with Cloud VMs can offer better performance, flexibility, and monetary costs for CEP. Here, we formulate an optimization problem for energy-aware placement of CEP queries, composed as an analytics dataflow, across a collection of edge and Cloud resources, with the goal of minimizing the end-to-end latency for the dataflow. We propose a Genetic Algorithm (GA) meta-heuristic to solve this problem and compare it against a brute-force optimal algorithm (BF). We perform detailed real-world benchmarks on the compute, network, and energy capacity of edge and Cloud resources. These results are used to define a realistic and comprehensive simulation study that validates the BF and GA solutions for 45 diverse CEP dataflows, LAN and WAN setup, and different edge resource availability. We compare the GA and BF solutions against random and Cloud-only baselines for different configurations for a total of 1, 764 simulation runs. Our study shows that GA is within 97% of the optimal BF solution that takes hours, maps dataflows with 4-50 queries in 1-26s, and only fails to offer a feasible solution <= 20% of the time.

关键词： Internet of things (IoT) complex event processing (CEP) cloud computing edge computing big data platforms query partitioning low power processing distributed scheduling energy-aware scheduling meta-heuristics

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling and dynamic pricing in a communication network

引用

WIRELESS NETWORKS 2004年第3期10卷 233-244页

作者： Heikkinen, T Univ Lancaster Dept Management Sci Lancaster LA1 4YX England

This paper studies dynamic resource allocation in a decentralized communication network. The temporal aspect in the decentralized resource allocation problem presents new challenges, e. g., in optimizing the delay-throughput trade-off under user-specific delay costs. A dynamic bandwidth allocation game modelling an agent-based network is presented. The dynamic noncooperative game achieves Pareto-efficient bandwidth allocation that can be implemented by a greedy algorithm with pricing. Optimal dynamic pricing is discussed for the efficient sharing of network resources. An ad hoc wireless network is an example of such self-organizing decentralized system: the mobile nodes need not be directly connected to a base station. Another application of the model is to consider distributed uplink scheduling, based on local information, in a WCDMA network. The discretized control variable of a mobile node is either the received power/QoS-level or the binary decision on packet transmission.

关键词： distributed scheduling QoS ad-hoc networks auctions

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling for Time-Critical Tasks in a Two-layer Vehicular Fog Computing Architecture 17

Distributed Scheduling for Time-Critical Tasks in a Two-laye...

引用

IEEE 17th Annual Consumer Communications and Networking Conference (CCNC)

作者： Zhou, Yi Liu, Kai Xu, Xincao Guo, Songtao Wu, Zhou Lee, Victor Son, Sang Chongqing Univ Coll Comp Sci Chongqing 400040 Peoples R China Chongqing Univ Coll Automat Chongqing 400044 Peoples R China City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China DGIST Coll Informat & Commun Engn Daegu South Korea

ISBN: (纸本)9781728138930

With the rapid development of vehicular applications and mobile devices, demands for resources to process time-critical and computation-intensive tasks are increasingly prominent. In this paper, we propose a two-layer Vehicular Fog Computing (VFC) architecture, including the client layer and the fog layer. Vehicles may generate tasks as clients, which are further assigned to the nodes in the fog layer for processing. The fog layer aggregates available resources of vehicles and infrastructures by exploiting their communication, computation and storage capabilities. Each task requires certain amount of resources for processing at the fog nodes. We formulate a distributed task allocation (DTA) problem, which takes deadline, vehicle mobility and fog capacity into consideration, and aims at maximizing the overall resource utilization of system, via the cooperation of vehicles and fog nodes. We linearize DTA into a 0-1 integer linear programming (ILP) problem to obtain the optimal solution. Further, we design a heuristic algorithm to obtain near-optimal performance with low computational overhead, which decomposes DTA into two subprocess and schedules tasks in each fog node independently. Finally, we build the simulation model and conduct a series of experiments based on real-world vehicle trajectories, which demonstrate the effectiveness and scalability of the proposed algorithm.

关键词： Vehicular Fog Computing (VFC) distributed scheduling Task Allocation Integer Linear Programming (ILP)

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling and dynamic pricing in a communication network

Distributed scheduling and dynamic pricing in a communicatio...

引用

2nd IFIP-TC6 Networking Conference

作者： Heikkinen, T Univ Lancaster Dept Management Sci Lancaster LA1 4YX England

关键词： distributed scheduling QoS ad-hoc networks auctions

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling for Video Streaming over Multi-Channel Multi-Radio Multi-Hop Wireless Networks

Distributed Scheduling for Video Streaming over Multi-Channe...

引用

IEEE Global Telecommunications Conference (GLOBECOM 09)

作者： Zhou, Liang Geller, Benoit Zheng, Baoyu Tang, Sulan Cui, Jingwu Zhang, Dengyin ENSTA ParisTech Lab UEI Paris France Nanjing Univ Posts & Telecommun Nanjing Peoples R China

ISBN: (纸本)9781424441471

An important issue of supporting multi-user video streaming over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resources while, at the same time, to meet each video's QoS (Quality of Service) requirement. In this work, we study the problem of video scheduling over multi-channel multi-radio multi-hop networks with the goals of minimizing the video distortion. At first, we construct a general distortion model according to the network's transmission mechanism, as well as video's rate-distortion characteristics. Then, by joint considering the channel assignment, rate allocation and routing, we develop a fully distributed scheduling scheme to get an optimal QoS performance. Furthermore, the realization of the distributed scheduling scheme through cooperation among the channel, link and source is the highlight of this paper. Extensive simulation results are provided which demonstrate the effectiveness of our proposed scheme.

关键词： multi-radio multi-channel multi-hop wireless networks distributed scheduling video QoS

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling in wireless sensor networks under heterogeneity and imperfect channel state information

Distributed scheduling in wireless sensor networks under het...

引用

14th IEEE/SP Workshop on Statistical Signal Processing

作者： Matamoros, Javier Anton-Haro, Carles CTTC Barcelona 08860 Spain

ISBN: (纸本)9781424411979

In this paper, we propose and analyze an energy-efficient opportunistic random access scheme for wireless sensor networks. The scheme allows for the simultaneous transmission of multiple observations to the fusion center (where a Successive Interference Cancellation scheme is assumed to be available), this resulting in a reduced system latency for a predefined parameter estimation quality. We provide both analytical and numerical expressions of the overall energy consumption and system latency in two practical situations: (1) when only imperfect (noisy) estimates of the sensor-FC propagation channel are available and, (2) in the presence of non-identically distributed propagation channels due, for instance, to different path-loss conditions.

关键词： sensor networks distributed scheduling energy efficiency

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling for Many-Cores Using Cooperative Game Theory 16

Distributed Scheduling for Many-Cores Using Cooperative Game...

引用

53rd ACM/EDAC/IEEE Design Automation Conference (DAC)

作者： Pathania, Anuj Venkataramani, Vanchinathan Shafique, Muhammad Mitra, Tulika Henkel, Joerg Karlsruhe Inst Technol Chair Embedded Syst CES D-76021 Karlsruhe Germany Natl Univ Singapore Sch Comp Singapore Singapore

ISBN: (纸本)9781450342360

Many-cores are envisaged to include hundreds of processing cores etched on to a single die and will execute tens of multithreaded tasks in parallel to exploit their massive parallel processing potential. A task can be sped up by assigning it to more than one core. Moreover, processing requirements of tasks are in a constant state of flux and some of the cores assigned to a task entering a low processing requirement phase can be transferred to a task entering high requirement phase, maximizing overall performance of the system. This scheduling problem of partial core reallocations can be solved optimally in polynomial time using a dynamic programming based scheduler. Dynamic programming is an inherently centralized algorithm that uses only one of the available cores for scheduling-related computations and hence is not scalable. In this work, we introduce a distributed scheduler that disburses all scheduling-related computations throughout the many-core allowing it to scale up. We prove that our proposed scheduler is optimal and hence converges to the same solution as the centralized optimal scheduler. Our simulations show that the proposed distributed scheduler can result in 1000x reduction in per-core processing overhead in comparison to the centralized scheduler and hence is more suited for scheduling on many-cores.

关键词： Many-Core distributed scheduling Multi-Agent Systems

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling for Wireless Networks

Distributed Scheduling for Wireless Networks

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Gowaikar, Radhika Lott, Chris Attar, Rashid Ghosh, Donna Azarian, Kambiz Jafarian, Amin Qualcomm Inc San Diego CA 92121 USA Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781457705953

We pose a network-wide scheduling problem for cellular wireless networks in which users are capable of being served by several schedulers on the downlink, though not jointly. We present a distributed algorithm, with limited communication across servers, that solves this problem optimally, in that it gives the network-wide proportional fair solution. An idealized version is presented first, in which all users are capable of being served by all schedulers and in which all the decision-making takes place among the schedulers alone. A practical version is also presented, in which users play a role in choosing their servers and servers decide how to allocate resources to the users that choose them. The practical version can achieve the same optimum as the idealized one and gives gains up to 60% in typical network deployments. This version can be implemented on any wireless technology to achieve optimal network scheduling. We have focused particularly on LTE, HSPA and 1xEV-DO and the first commercial deployment will soon occur on the 1xEV-DO system, based on the 3GPP2 standard, under the rubric of 'Smart Networks.'

关键词： 3GPP2 standard Algorithm design and analysis Delay HSPA Interference LTE Long Term Evolution Resource management Servers Throughput Wireless communication cellular radio cellular wireless networks decision making decision-making distributed algorithm distributed algorithms distributed scheduling network-wide proportional fair solution network-wide scheduling problem radio networks scheduling smart networks

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling Algorithm for Highly Available Component based Applications 29

Distributed Scheduling Algorithm for Highly Available Compon...

引用

29th IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Frincu, Marc E. Univ Southern Calif Dept Elect Engn 3740 McClintock AveEEB 318 Los Angeles CA 90089 USA

ISBN: (纸本)9781467376846

The emergence of multi-clouds makes it difficult for application providers to offer reliable applications to end users. The different levels of infrastructure reliability offered by various cloud providers need to be abstracted at application level through application-aware algorithms for high availability. This task is challenging due to the closed world approach taken by the various cloud providers. In the face of different access and management policies orchestrated distributed management algorithms are needed instead of centralized solutions. In this paper we present a decentralized autonomic algorithm for achieving application high availability by harnessing the properties of scalable component-based applications and the advantage of overlay networks to communicate between peers. In a multi-cloud environment the algorithm maintains cloud provider independence while achieving global application availability. The algorithm was tested on a simulator and results show that it gives similar results to a centralized approach without inducing much communication overhead.

关键词： distributed scheduling highly available applications multi-clouds

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：