9,210 Hits in 5.9 sec

Cooperative group provisioning with latency guarantees in multi-cloud deployments

Sean Yaw, Eben Howard, Brendan Mumey, Mike P. Wittie
2015 Computer communication review  
Here, we formally define the Cooperative Group Provisioning problem and show it is NP-hard to approximate within a constant factor.  ...  We find that multi-cloud deployments dramatically increase the likelihood of meeting group latency thresholds with minimal cost increase compared to single-cloud deployments.  ...  The process then loops back and determines the path costs for the paths of the remaining clients. This algorithm is presented as Algorithm 1.  ... 
doi:10.1145/2805789.2805791 fatcat:rvnkajtad5cqdbkbgellalpxka

A Novel Unmanned Aerial Vehicle Charging Scheme for Wireless Rechargeable Sensor Networks in an Urban Bus System

Tu-Liang Lin, Hong-Yi Chang, Yu-Hsin Wang
2022 Electronics  
In the shortest path strategy, the minimum distance between the sensor node and bus location is calculated, and the UAVs fly the shortest path to the sensor nodes.  ...  In this study, we propose an unmanned aerial vehicle (UAV)-based charging scheme in an urban bus system, involving the coordination between UAVs and bus schedules.  ...  Previously, studies on WRSN mainly focused on solving the problems of the deployment of mobile wireless chargers [6, 7] , energy conservation [8, 9] , and routing and scheduling [10] .  ... 
doi:10.3390/electronics11091464 fatcat:zerd6y2i5bborkuiym6q3sroti

Efficient deployment algorithms for mobile sensor networks

Salah Abdel-Mageid, Rabie A. Ramadan
2010 2010 International Conference on Autonomous and Intelligent Systems, AIS 2010  
In addition, after a period of time, the sensors topology might change due to some sensor hardware failure or deplaned energy. Therefore, redeployment and/or sensors relocation process is essential.  ...  Nevertheless, mobility consumed energy as well as sensor load balancing are essential factors to be considered during the initial deployment and relocation processes.  ...  cascading scheduling procedure 12: if h.isSupplier then 13: if action(sensor died) occurs then 14: Determine the best redundant (r) to target location(t) 15: Apply shortest cascading scheduling procedure  ... 
doi:10.1109/ais.2010.5547017 dblp:conf/ais2/Abdel-MageidR10 fatcat:mz4l5ne2lvab3gux3yyy6grkl4

Wireless link scheduling under a graded SINR interference model

Paolo Santi, Ritesh Maheshwari, Giovanni Resta, Samir Das, Douglas M. Blough
2009 Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing - FOWANC '09  
Furthermore, we investigate, through both simulation and implementation on an experimental testbed, the tradeoff between the minimum link quality threshold β Q and the resulting network throughput.  ...  Then, we present an approximation algorithm for this problem, which is shown to be within a constant factor from optimal.  ...  This process is repeated until all links have been scheduled.  ... 
doi:10.1145/1540343.1540346 fatcat:kir2sd4bcbh5lpkldhxz3uxnzm

JiTS: Just-in-Time Scheduling for Real-Time Sensor Data Dissemination [article]

Ke Liu, Nael Abu-Ghazaleh, Kyoung-Don Kang
2006 arXiv   pre-print
Based on this observation, we propose a Just-in-Time Scheduling (JiTS) algorithm for scheduling data transmissions to alleviate the shortcomings of the existing solutions.  ...  We show that the shortest path routing using the minimum number of hops leads to considerably better performance than Geographical Forwarding, which has often been used in existing real-time data dissemination  ...  In contrast, the proposed Just-in-Time Scheduling (JiTS) approach sets target transmission times for the packets in accordance with their deadline and the remaining distance along the path.  ... 
arXiv:cs/0608069v1 fatcat:d5cdswdvgfdxfkqwtyrui7dfqy

Maintenance pooling to maximize fab uptime

M. Czerniak, A. Ifould, M. Mooney, A. Maiorana
2012 2012 SEMI Advanced Semiconductor Manufacturing Conference  
Maximizing process tool uptime has remained a core challenge for the manufacturing of advanced semiconductors over time.  ...  with the maintenance schedule of the process tool.  ...  This paper summarizes Edwards' research deployment of predictive tools and technologies in respect of vacuum and abatement critical sub-systems. II. MAINTENANCE SCHEDULING TODAY A.  ... 
doi:10.1109/asmc.2012.6212892 fatcat:ixn6rfpt2jgdjh4t3zrccf3ffa

New Insights into the Real-time Performance of a Multicore Processor

Raimarius Delgado, Byoung Wook Choi
2020 IEEE Access  
We identify various multicore deployments and discuss their trade-offs, as established through the experimental evaluation of the scheduling latency.  ...  In real-time systems, where processes and tasks are governed by stringent temporal constraints, the worst-case timings should be considered, and migration to multicore processors leads to additional difficulties  ...  Nonetheless, the scheduling latency should remain low to ensure that the real-time tasks are schedulable and exhibit deterministic behavior.  ... 
doi:10.1109/access.2020.3029858 fatcat:6mitheukx5gpxm3iqr2zg3y5i4

Approximate and Incremental Network Function Placement [article]

Tamas Lukovszki, Matthias Rost, Stefan Schmid
2017 arXiv   pre-print
This paper studies approximation algorithms for the incremental deployment of a minimum number of middleboxes at optimal locations, such that capacity constraints at the middleboxes and length constraints  ...  It is hence particularly attractive for incremental deployments.We prove that the achieved polynomial-time approximation bound is optimal, unless P = NP.  ...  In the datacenter scheduling problem [23] , we are given a set of m machines and n jobs. The processing time of job j on machine i is p i,j . Each machine i has an activation cost a i .  ... 
arXiv:1706.06496v1 fatcat:eyyzharpwjat3a2hiuuu6bhsxi

Fast sink placement for Gossip-based Wireless Sensor Networks

Milos Blagojevic, Marc Geilen, Twan Basten, Teun Hendriks
2012 2012 IEEE 31st International Performance Computing and Communications Conference (IPCCC)  
sink deployment process.  ...  We use a fast and accurate performance evaluation technique, which exploits specifics of the sink placement problem and significantly reduces evaluation time.  ...  The approximate-greedy approach is a greedy heuristic that instead of using the stochastic shortest path analysis uses structural metrics to approximate the result.  ... 
doi:10.1109/pccc.2012.6407744 dblp:conf/ipccc/BlagojevicGBH12 fatcat:a3fahk7yabetxc3vu4qohgqjxa

CAPTON – Centralized All-Path Transmission for Over-Subscribed Datacenter Networks

Nan Zhou, Jack Y. B. Lee
2022 IEEE Access  
This work proposes a new centralized flow-based scheduling scheme called CAPTON which schedules flow according to remaining flow size and link capacities to avoid congestion in over-subscribed networks  ...  CAP-TON employs all-path transmission to exploit all available paths and redundant links between source and destination hosts to maximize resource utilization and eliminate the need for routing.  ...  ACKNOWLEDGMENT The authors wish to thank the Associate Editor and the anonymous reviewers for their suggestions in improving this article to its final form.  ... 
doi:10.1109/access.2022.3143160 fatcat:6lzvsqbxobcjrlrs2beu2znrwy

Mobile-to-mobile energy replenishment in mission-critical robotic sensor networks

Liang He, Peng Cheng, Yu Gu, Jianping Pan, Ting Zhu, Cong Liu
2014 IEEE INFOCOM 2014 - IEEE Conference on Computer Communications  
Observing the discrepancy between the charging latency of robots and charger travel distance, we propose a novel tree-based charging schedule for the charger, which minimizes its travel distance without  ...  We analytically evaluate its performance and show its closeness to the optimal solutions.  ...  IMPLEMENTATION GUIDANCE Given a specific system deployment, the remaining energy threshold θ is the dominating parameter that determines whether it is possible for the tree-based schedule to return a depletion-free  ... 
doi:10.1109/infocom.2014.6848051 dblp:conf/infocom/HeCGPZL14 fatcat:apxtiaht25f7foq3deg5gfl65a

Multichannel Scheduling and Spanning Trees: Throughput–Delay Tradeoff for Fast Data Collection in Sensor Networks

Amitabha Ghosh, Özlem Durmaz Incel, V. S. Anil Kumar, Bhaskar Krishnamachari
2011 IEEE/ACM Transactions on Networking  
In this paper, we utilize multiple frequency channels and design an efficient link scheduling protocol that gives a constant factor approximation on the optimal throughput in delivering aggregated data  ...  of the tree at most β times the minimum possible radius for a given degree bound ∆ * , and the degree of any node at most ∆ * + α, where α and β are positive constants.  ...  So all the remaining edges can be scheduled in max k |S(f k )| ≤ max k {l φ i (f k )} time slots.  ... 
doi:10.1109/tnet.2011.2146273 fatcat:vienqx3kjzgjhl4c3eecmxv4v4

Comprehensive Study on Task Scheduling Strategies in Multicloud Environment

Roshni Patil, Anup Gade, Abhay Rewatkar
2019 Journal Europeen des Systemes Automatises  
This survey paper presents the Shortest Job First algorithm, Round Robin algorithm and Genetic Algorithm for task scheduling in multicloud computing.  ...  A good task and resource scheduling mechanism must satisfy the QoS requirement of the user and at the same time make an efficient utilization of resources.  ...  Shortest job first scheduling algorithm follow the criteria that it processes the smallest task first and largest task later. Figure 4.  ... 
doi:10.18280/jesa.520106 fatcat:gvrr24mgyvaqpp3bqaw74agaha

Energy-Efficient Scheduling for Mobile Sensors Using Connection Graphs in a Hybrid Wireless Sensor Network with Obstacles

Guangqian Xie, Chunguang Li, Feng Pan
2014 International Journal of Distributed Sensor Networks  
adjustment, and efficient data collection and processing.  ...  In this paper, we focus on the energy-efficient scheduling for mobile sensors to find an obstacle-avoiding shortest path.  ...  Acknowledgments This work was supported by the National Natural Science Foundation of China (no. 61273131) and PAPD of Jiangsu Higher Education Institutions.  ... 
doi:10.1155/2014/139731 fatcat:zudjwrvdqvgcfifbyrpjwzlzya

Placement and Routing Optimization Problem for Service Function Chain: State of Art and Future Opportunities [article]

Weihan Chen, Xia Yin, Zhiliang Wang, Xingang Shi
2019 arXiv   pre-print
This article introduces service function chain related optimization problems, summarizes the optimization motivation and mainstream algorithm of virtualized network functions deployment and traffic routing  ...  scheme; and 2) routing policy for traffic flow among different instances of network function.  ...  These methods can yield time efficiency and scalability benefit.  ... 
arXiv:1910.02613v1 fatcat:udfxp74wgfdkflyiqwlu7vowvu
« Previous Showing results 1 — 15 out of 9,210 results