This paper proposes an efficient uplink scheduling algorithm that can perfectly support various VoIP CODECs with VAD/DTX/CNG in M-WiMAX considering the variants of silence duration between different voice users, solvi...
详细信息
ISBN:
(纸本)9780769539409
This paper proposes an efficient uplink scheduling algorithm that can perfectly support various VoIP CODECs with VAD/DTX/CNG in M-WiMAX considering the variants of silence duration between different voice users, solving the problems of uplink resources wastes and overwhelmingly large overhead that caused during silence period. In our proposed algorithm, efficient schemes is proposed to implement the uplink resource interval and allocation procedure, and the BS adapts this uplink resources interval according to the reserved bit in the generic MAC header of IEEE802.16e, which is utilized to indicate voice activity of each voice user. The performance analysis of the conventional algorithms (UGS, rtPS and ertPS) as well as the one proposed in this paper is also provided. Through the numerical validations, proposed algorithm performs efficiently than the conventional algorithms over enhancement of resource utilization, total throughput, and system capacity. Also, it is proved that our algorithm can support more voice users than the conventional algorithms.
Regarding the problems such as long response time, unbalanced job scheduling load and low implementation efficiency of traditional distributed logistics inventory system, this article proposed the Hadoop dynamic load ...
详细信息
ISBN:
(纸本)9781509048403
Regarding the problems such as long response time, unbalanced job scheduling load and low implementation efficiency of traditional distributed logistics inventory system, this article proposed the Hadoop dynamic load balance scheduling algorithm based on heartbeat feedback. According to Hadoop scheduling model and working principle of cloud computing, it analyzed the map and reducer function role of system scheduling as well as heartbeat mechanism. It presented the calculation formulas for Task Tracker node sending the heartbeat information and for the load capacity of each node, and built Hadoop logistics inventory dynamic load balance scheduling algorithm based on heartbeat feedback. Through comparing the simulation experiments under two cloud computing environments of homogeneous cluster and heterogeneous cluster, it verified the validity of this algorithm.
In this paper, based on the classic WRR (Weighted Round Robin) discipline, we propose an efficient real-time traffic scheduling algorithm for WLAN (Wireless Local Area Networks). Our algorithm operates at link layer l...
详细信息
ISBN:
(纸本)0780377818
In this paper, based on the classic WRR (Weighted Round Robin) discipline, we propose an efficient real-time traffic scheduling algorithm for WLAN (Wireless Local Area Networks). Our algorithm operates at link layer level, and is coupled closely with DCF (Distributed Coordinate Function). Through that, the HOL (Head Of Line) blocking problem is alleviated. With compensation for mobile users experiencing burst channel error, we achieve long-term fairness approximately. Extensive simulations are performed using NS (Network Simulator). The results show that our algorithm is simple, and improves the channel utilization and data throughput effectively. The average packet delay is also decreased.
In the packet-switched domain of the Universal Mobile Telecommunications System (UNITS), scheduling algorithms such as the Proportional Fairness (PF) and Round Robin (RR) are used to decide on resource allocation (tim...
详细信息
ISBN:
(纸本)9781424405268
In the packet-switched domain of the Universal Mobile Telecommunications System (UNITS), scheduling algorithms such as the Proportional Fairness (PF) and Round Robin (RR) are used to decide on resource allocation (time and code space) for the users. According to the literature, the PIT algorithm will provide significant throughput gain only if the channel variation is slow enough for the scheduler to track but fast enough such that it does not have to wait for too long in order to experience a constructive fading. In this paper, the authors provide a comparison study between the PIT & RR algorithm. Matlab simulations are conducted under various different settings and environments in order to gauge and understand the characteristics of the PF scheduler. Simulation results show that under average channel conditions with fading within 5dB and user diversity of 5, the PF provides a cell throughput gain of 5% over the RR and an individual UE bit rate gain of 7% over RR. When simulated with a higher SNR margin of 10dB and user diversity of 10, the PIT showed better performance compared to the RR, with a cell throughput gain of 18% and an individual bit rate gain of 20% over those achieved by the RR. This seems to suggest that the PF is able to better adapt to an increased user diversity and Signal-to-Noise (SNR) margin compared to the RR. The findings in this paper underscore the critical characteristics of the Proportional Fairness scheduling algorithm under different channel conditions. The findings also set the tone for further research to optimise the trade-off achieved by the PF.
The goal of the OURAGAN project is to provide access of meta-computing resources to Scilab users. We present here an approach that consists, given a Scilab script, in scheduling and executing this script on an heterog...
详细信息
ISBN:
(纸本)0769512607
The goal of the OURAGAN project is to provide access of meta-computing resources to Scilab users. We present here an approach that consists, given a Scilab script, in scheduling and executing this script on an heterogeneous cluster of machines. One of the most effective scheduling technique is called clustering which consists in grouping tasks on virtual processors (clusters) and then mapping clusters onto real processors. In this paper we study and apply the clustering technique for heterogeneous systems. We present a clustering algorithm called triplet, study its performance and compare it to the HEFT algorithm. We show that triplet has good characteristics and outperforms HEFT in most of the cases.
A new scheduling, algorithm, which aims to provide proportional and controllable QoS in terms of burst loss probability for OBS (optical burst switching) networks, is proposed on the basis of a summary of current QoS ...
详细信息
ISBN:
(纸本)0819455792
A new scheduling, algorithm, which aims to provide proportional and controllable QoS in terms of burst loss probability for OBS (optical burst switching) networks, is proposed on the basis of a summary of current QoS schemes in OBS. With simulations, performance analyses and comparisons are studied in detail. The results show that, in the proposed scheme, burst loss probabilities are proportional to the given factors and the control of QoS performance can be achieved with better performance. This scheme will be beneficial to the OBS network management and the tariff policy making.
Modern computer system is organized with multi-core processing system. The scheduling of processes in multiprocessing may turn into more complex task. In multi-core processing system, there are two or more cores embed...
详细信息
ISBN:
(纸本)9789811055089;9789811055072
Modern computer system is organized with multi-core processing system. The scheduling of processes in multiprocessing may turn into more complex task. In multi-core processing system, there are two or more cores embedded into a single chip. This architecture provides more efficiency in terms of throughput than single processor architecture. Previously, most of the work has been done in creating new scheduling algorithms for multi-core processing system, but small consideration has been given to merge user priority and system priority. In this paper, researcher has proposed Smart Job First Dynamic Round Robin algorithm with smart Time Quantum (SJFDRR) in multi-core processing system in which a smart priority factor (SPF) is calculated for each process. The process which has lowest value of SPF is scheduled first. The time quantum is calculated dynamically for each processor. By this algorithm the average waiting time and average turnaround time and context switch is significantly decreases which lead to increase in performance of the system.
With the rise and development of cloud computing technology, more and more individuals and companies are hosting applications to cloud servers. Thanks to the strong support of virtualization technology, the developmen...
详细信息
ISBN:
(纸本)9781728136608
With the rise and development of cloud computing technology, more and more individuals and companies are hosting applications to cloud servers. Thanks to the strong support of virtualization technology, the development of cloud computing technology has become faster. Virtualization technology can isolate the user from the underlying physical hardware and generate virtual machines of various configurations for the user. However, as a basic unit for cloud users, virtual machine scheduling algorithms have become a research hotspot in academia and industry. In the existing research, most of the virtual machine scheduling algorithms are aimed at simplifying or satisfying user requirements. However, with the further expansion of the cloud cluster size and the increase of multi-tenant parallel tasks, the existing virtual machine scheduling algorithm can not meet the current requirements. In this paper, according to the characteristics of virtual machine and physical machine, a new virtual machine scheduling algorithm is proposed: Maximum Filling (MF) algorithm, which can improve the scheduling efficiency of virtual machines and reduce the usage of physical machines in cloud clusters. Finally, the effect of the algorithm is compared. The proposed algorithm is obviously better than the comparison algorithm.
Hyperledger Fabric (Fabric for short), is a consortium blockchain platform that adopts the smart contract paradigm and provides complete operational functions. Although it has become the system with the highest throug...
详细信息
ISBN:
(纸本)9798350369205;9798350369199
Hyperledger Fabric (Fabric for short), is a consortium blockchain platform that adopts the smart contract paradigm and provides complete operational functions. Although it has become the system with the highest throughput among open source blockchain systems, its performance cannot meet the needs of industrial-grade application scenarios. To further expand the application scenarios of blockchain, this paper proposes a Transaction Batch Processing scheduling (TBPS) algorithm for multi-channel Fabric networks based on Lyapunov optimization theory. The algorithm maximizes the consensus efficiency of the system while ensuring the minimum transaction accumulation, and provides stability conditions and optimal performance for the system under transaction batch processing. Finally, we built a blockchain network of Fabric's latest stable version v2.0 via the cloud platform, providing an order of magnitude of algorithmic parameters by testing transaction processing rates. To simulate the distribution of performance indicators such as transaction delay, system transaction accumulation and average transaction processing rate under different impact factors, and verify the effectiveness of the proposed TBPS algorithm.
The optimal scheduling algorithm based on non-periodic information is model and analyzed. Compared with typical scheduling algorithms, it improves non-periodic tasks theoretical delay. Finally, the simulation shows th...
详细信息
ISBN:
(纸本)9783037850732
The optimal scheduling algorithm based on non-periodic information is model and analyzed. Compared with typical scheduling algorithms, it improves non-periodic tasks theoretical delay. Finally, the simulation shows that the scheduling algorithm is effective in reducing delay problems of the non-periodic communication task.
暂无评论