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

IEEE International Smart Cities Conference (ISC2)

作者： Supiwat Mateesakulkan Thanapong Suwanasri Chaiyod Pirak The Sirindhorn International Thai-German Graduate School of Engineering King Mongkut's University of Technology North Bangkok Bangkok Thailand

ISBN: (数字)9798350364316

ISBN: (纸本)9798350364323

This research explores the effectiveness of three electric vehicle (EV) charging models—Balance Load Sharing, First-Come, First-Served (FCFS), and Shortest Job First (SJF)—in managing electrical loads and preventing transformer overloads within Thailand's distribution systems. This is achieved through collaboration between the Advanced Metering Infrastructure (AMI) smart meter and EV charger within the system. With the growing adoption of EVs, particularly during off-peak periods under Time-of-Use (TOU) tariffs, the study addresses the need for efficient load management to prevent system overloads. The Balance Load Sharing model, which dynamically adjusts charging power based on real-time load conditions, demonstrated superior efficiency by reducing overall charging times and eliminating queuing delays. In contrast, the FCFS and SJF models, while yielding similar overall charging times, showed significant differences in queue management. The FCFS model, which charges vehicles in their order of arrival, led to extended waiting times during peak periods. On the other hand, the SJF model, which prioritizes vehicles requiring shorter charging durations, effectively minimized queuing times, thereby enhancing overall system efficiency.

关键词： scheduling algorithms Smart cities Tariffs Load management Transformers Electric vehicle charging Smart meters Delays Smart grids Load modeling

来源：评论

学校读者我要写书评

暂无评论

The Research of scheduling algorithms in Real-time System

The Research of Scheduling Algorithms in Real-time System

引用

2010 International Conference on Computer and Communication Technologies in Agriculture Engineering(计算机与通信技术在农业工程国际会议 CCTAE 2010)

作者： Li Jie Guo Ruifeng Shao Zhixiang Graduate University of Chinese Academy of Sciences Shenyang Institute of Computing Technology Chines Shenyang Institute of Computing Technology Chinese Academy of Sciences Shenyang P. R. China Graduate University of Chinese Academy of Sciences Shenyang Institute of Computing Technology Chines

scheduling algorithm is a hot research topic of real time system. The quality of real-time scheduling algorithm has a direct impact on real-time system's throughput capacity, response time, even on tasks' scheduling result in required deadline. This paper discusses the features and performance of real-time system. According to system environment, real-time system can be divided into uniprocessor scheduling, centralized multiprocessor scheduling and distributed scheduling. Classic real-time scheduling algorithms RMS, EDF and LLF are discussed in uniprocessor systems. The scheduling thought and strategies are investigated in multiprocessor systems. Distributed real-time scheduling algorithms such as GRMS and DSr are analyzed briefly. Finally, it points out the future direction of real-time scheduling research.

关键词： real-time system scheduling algorithms RMS EDF pinwheel scheduling classification

来源：评论

学校读者我要写书评

暂无评论

A survey of backpressure based scheduling algorithms for delay tolerant networks

A survey of backpressure based scheduling algorithms for del...

引用

International Conference on Information Communication and Embedded Systems (ICICES)

作者： J. Dhivya M. Vanithalakshmi S.A Engineering College Chennai Communication Systems India

ISBN: (纸本)9781479936984

The Delay Tolerant Networks (DTN) are networks where the end-to-end paths between source and destination are unstable or unlikely. In such networks, conventional path-discovery-based MANET routing techniques like AODV and DSR are not possible because the network may not form a single connected partition at any time, and thus a full path may never exist between the source and the destination. In such cases a store and forward algorithm is required, where the data packets can be stored in the network and be delivered before its deadline is over. Backpressure is one such algorithm, which stores data packets in queues and tries to deliver data packets to their final destination by building up gradients. It has been proved that this algorithm works effectively during peak traffic period compared to other DTN algorithm such as epidermis, spray and wait, Maxprop, etc., This paper is brief study of backpressure algorithm from its origin to its developed versions at present. It also explains the methods that can improve the working of backpressure in high traffic as well as low traffic with reduced overloads at the nodes maintaining queues.

关键词： Delays Routing Educational institutions scheduling algorithms Throughput Telecommunication traffic Redundancy

来源：评论

学校读者我要写书评

暂无评论

Making Sense of Constellations Methodologies for Understanding Starlink’s scheduling algorithms

arXiv

引用

arXiv 2023年

作者： Tanveer, Hammas Bin Puchol, Mike Singh, Rachee Bianchi, Antonio Nithyanand, Rishab University of Iowa United States Google X United States Cornell University United States Purdue University United States

Starlink constellations are currently the largest LEO WAN and have seen considerable interest from the research community. In this paper, we use high-frequency and high-fidelity measurements to uncover evidence of hierarchical traffic controllers in Starlink — a global controller which allocates satellites to terminals and an on-satellite controller that schedules transmission of user flows. We then devise a novel approach for identifying how satellites are allocated to user terminals. Using data gathered with this approach, we measure the characteristics of the global controller and identify the factors that influence the allocation of satellites to terminals. Finally, we use this data to build a model which approximates Starlink’s global scheduler. Our model is able to predict the characteristics of the satellite allocated to a terminal at a specific location and time with reasonably high accuracy and at a rate significantly higher than baseline. © 2023, CC BY.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of scheduling algorithms for MU-MIMO systems

Performance comparison of scheduling algorithms for MU-MIMO ...

引用

International Bhurban Conference on Applied Sciences & Technology, IBCAST

作者： Muddasar Naeem Sajid Bashir Muhammad Usman Khan Aqeel A Syed Department of Computer Science Iqra University Islamabad Pakistan Department of Electronics Quaid-i-Azam University Islamabad Pakistan

scheduling more than one user could increase system capacity of multi antenna systems. Present article reviews Multi User MIMO (MU-MIMO) communication from scheduling perspective, discussing performance gains in terms of sumrate, fairness, and computational complexity. Several scheduling techniques reported for MU-MIMO based on different algorithms are reviewed, along with partial channel state information and full channel state information. Moreover, the selection procedure of first user in leakage based and interference based scheduling algorithms is analyzed. The results show that random selection of first user does not effect the performance and have relatively less computational complexity.

关键词： Interference scheduling algorithms Signal to noise ratio scheduling MIMO

来源：评论

学校读者我要写书评

暂无评论

Comparative Study of scheduling algorithms and Almost Blank Subframe for LTE HetNets

Comparative Study of Scheduling Algorithms and Almost Blank ...

引用

International Electrical Engineering Congress (iEECON)

作者： Pichit Thienthong Nonthapat Teerasuttakorn Kittipong Nuanyai Soamsiri Chantaraskul The Sirindhorn International Thai-German Graduate School of Engineering King Mongkut’s University of Technology North Bangkok Bangkok Thailand

With dramatically increasing demand for data usage in the LTE Heterogeneous Networks (HetNets), traffic offloading techniques have been used to balance the load among the network tiers in order to enhance the overall system performance. The Cell Range Expansion (CRE) and Almost Blank Subframe (ABS) are the two major techniques under the enhanced Inter-Cell Interference Coordination (eICIC), which are aimed at increasing overall system performance while keeping low interference toward cell edge users. In general, a scheduling algorithm is also one major issue affecting the system efficiency. In this paper, different scheduling schemes, i.e. Round Robin (RR), Proportional Fairness (PF), Best-Channel Quality Identification (Best-CQI), Maximum Throughput (Max-TP) and Resource Fairness (RF), are investigated. The study focuses on the comparison of the system performance when operating with different schedulers as well as under different CRE and ABS parameters. The results are observed through the system level simulation in terms of average throughput, peak throughput, edge throughput, and fairness.

关键词： Throughput Radio frequency Long Term Evolution System performance scheduling algorithms Indexes

来源：评论

学校读者我要写书评

暂无评论

Task Migration with EDF-RM scheduling algorithms in Distributed System

Task Migration with EDF-RM Scheduling Algorithms in Distribu...

引用

International Conference on Advances in Computing and Communications (ICACC)

作者： Rashmi Sharma Nitin Department of CSE and ICT Jaypee University of Information and Technology Waknaghat Solan Himachal Pradesh India

Earliest deadline first and Rate Monotonic are the two well-known scheduling algorithms to meet the deadlines for task in RTS. For single processor, these tasks work well but for more than one node, overloading in utilization usually creates problem. Task migration and duplication are those two concepts that balance the load of distributed system due to which overloading problem has been resolved. This paper explains the processing of task migration with EDF-RM (simultaneously) scheduling algorithm by using Global scheduling.

关键词： Real time systems scheduling algorithms Heuristic algorithms Optimal scheduling Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

A comparative study of mixed traffic scenarios for different scheduling algorithms in WiMAX

A comparative study of mixed traffic scenarios for different...

引用

IEEE Vehicular Technology Conference

作者： Milad Alizadeh Rudzidatul Akmam Dziyauddin Dritan Kaleshi Angela Doufexi Centre of Communication Research Department of Electronics and Electrical Engineering University of Bristol UK

ISBN: (纸本)9781467309899

WiMAX promises an advanced framework to support Quality-of-Service (QoS) requirements of different types of applications and scheduling is a key part in its QoS provisioning. The scheduling algorithms used in this paper are based on our proposed Greedy-Latency scheduler, a modified form of Greedy algorithm which can guarantee delay requirements of real-time applications while optimising the system throughput. Our study of TCP performance in WiMAX shows that unlike UDP traffic, there are fluctuations in TCP throughput even for low traffic loads. It is seen that employing Automatic Repeat reQuest (ARQ) and setting the right TCP window size are crucial for a stable optimal TCP performance. WiMAX QoS mechanism can successfully maintain the inter-class priority between TCP traffic in Best Effort (BE) class and UDP in higher priority Real- Time Polling Service (rtPS) class. For intra-class scenarios, it is observed that TCP flows in general need a protection mechanism as the UDP traffic tend to seize the channel. The proposed Greedy-Scheduler can provide better intra-class protection for TCP flows due to its packet dropping policy.

关键词： IEEE 802.16 WiMAX QoS scheduling TCP Greedy Packet Dropping WiMax Tritolyl Phosphates tactical command post scheduling algorithms User Datagram Protocol/Internet Protocol Uridine Diphosphate protection mechanism Quality of service low traffic Mixed traffic greedy algorithm Window Size Automatic repeat request

来源：评论

学校读者我要写书评

暂无评论

On the Design of scheduling algorithms for Wireless Navigation Networks

On the Design of Scheduling Algorithms for Wireless Navigati...

引用

IEEE Global Communications Conference

作者： Tianheng Wang Andrea Conti Moe Z. Win Laboratory for Information and Decision Systems Massachusetts Institute of Technology ENDIF University of Ferrara

ISBN: (纸本)9781509013296

Network navigation is a promising paradigm for providing accurate location-awareness in wireless environments, where mobile nodes estimate their locations based on inter- and intra-node measurements. In the presence of limited wireless resources, only a subset rather than all of the node pairs can perform inter-node measurements. Therefore, it is crucial to design efficient scheduling algorithms for selecting node pairs at different times for inter-node measurements. This paper develops a framework for the design of scheduling algorithms based on random access for network navigation. The proposed algorithms are suitable for practical operation of wireless navigation networks due to their distributed nature, and the optimized access probabilities of the agents lead to significant performance improvement.

关键词： Network navigation Localization error evolution scheduling algorithms Parameter optimization scheduling algorithms Parameter optimization navigation wireless performance boost RANDOM ACCESS

来源：评论

学校读者我要写书评

暂无评论

Cooperation vs. multiplexing: Multicast scheduling algorithms for OFDMA relay networks 10

Cooperation vs. multiplexing: Multicast scheduling algorithm...

引用

11th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2010

作者： Sundaresan, Karthikeyan Rangarajan, Sampath Mobile Communications and Networking Research NEC Laboratories America Princeton NJ United States

ISBN: (纸本)9781450301831

With the next generation cellular networks making a transition to-wards smaller cells, two-hop OFDMA relay networks have become a dominant, mandatory component in the 4G standards (WiMAX 802.16j, 3GPP LTE-Adv). While unicast flows have received reasonable attention in two-hop OFDMA relay networks, not much light has been shed on the design of efficient scheduling algorithms for multicast flows, thereby forming the focus of this work. We show that while relay cooperation is critical for improving multicast performance, it must be carefully balanced with the ability to multiplex multicast sessions and hence maximize aggregate multicast flow. To this end, we highlight strategies that carefully group relays for cooperation to achieve this balance. We then solve the multicast scheduling problem under two OFDMA sub-channelization models. We establish the NP-hardness of the scheduling problem even for the simpler model and provide efficient algorithms with approximation guarantees under both models. Evaluation of the proposed solutions reveals the efficiency of the scheduling algorithms as well as the significant benefits obtained from the multicasting strategy. Copyright 2010 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：