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

Packet importance based scheduling strategy for H.264 video transmission in wireless networks

MULTIMEDIA TOOLS AND APPLICATIONS 2015年第23期74卷 10259-10275页

作者： Li, Fan Zhang, Danyang Wang, Liejun Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China Xinjiang Univ Sch Informat Sci & Engn Urumqi 830046 Peoples R China

This paper investigates the problem of H.264 video transmission in wireless networks. We propose a packet scheduling algorithm based on the packet quality contribution index (PQCI) of H.264 video packet. The PQCI is estimated not only by the quality distortion made for the current frame, but also by that made for the frames which are directly or indirectly related with current frame. A dual-decoder-model (DDM) algorithm is proposed for the PQCI estimation. In DDM algorithm, we develop a novel architecture with two simulated decoders in the sender. To reduce the computational complexity, an estimated-model (EM) algorithm is also proposed. In EM algorithm, the coding characters of video that are pre-coded are extracted for the PQCI estimation. The results demonstrate that our schemes can bring a significant gain to the end-to-end video quality with respect to traditional methods.

关键词： Multimedia communication Packet distortion Packet loss scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A New Heuristic scheduling Strategy LBMM in Cloud Computing

A New Heuristic Scheduling Strategy LBMM in Cloud Computing

引用

International Conference on Intelligent Human-Machine Systems and Cybernetics, IHMSC

作者： Huili Chen Quan Liu Qingsong Ai School of Information Engineering Wuhan University of Technology Wuhan China

ISBN: (纸本)9781509007691

With the rapid development of cloud computing technology, cloud task scheduling has become a hot research topic in the related field. At present, there are many researches focused on the scheduling in cloud environment, such as task deadline, running cost, resource utilization and security privacy. However, due to the commercial nature and openness of the cloud platform, it is a key problem to balance the load of the resources. In this paper, a new scheduling strategy LBMM (Load-Balanced Min-Max) based on the Min-Min algorithm in cloud computing is presented, which can improve the performance in both makespan and the level of resources utilization of the scheduling system. The experimental results show that the strategy proposed in this paper can lead to significant performance gain for a variety of parameters than several basic heuristics.

关键词： scheduling algorithms Cloud computing scheduling Resource management Computational modeling Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Budget Constrained scheduling Algorithm for Hybrid Cloud Computing Systems Under Data Privacy

A Budget Constrained Scheduling Algorithm for Hybrid Cloud C...

引用

IEEE International Conference on Cloud Engineering (IC2E)

作者： Amin Rezaeian Hamid Abrishami Saeid Abrishami Mahmoud Naghibzadeh Dept of Computer Engineering Ferdowsi University of Mashhad Mashhad Iran

In hybrid cloud model, organizations can keep their sensitive information and critical applications in the private cloud and move other data and applications to a public cloud, if necessary. To maintain data privacy in workflow applications, we present a budget constrained hybrid cloud scheduler (BCHCS) which is a static heuristic scheduling algorithm. It is able to make decisions about scheduling sensitive tasks on private cloud and uses public cloud's resources for non-sensitive tasks, such that the makespan is minimized, while the budget limitation imposed by the user is satisfied. Experimental results show that the proposed method guarantees the execution of sensitive tasks on private cloud while achieving at least 7 percent lower makespan and higher success rate in comparison to similar existing techniques.

关键词： Cloud computing Schedules scheduling algorithms scheduling Data privacy Workflow management software Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive packet scheduling for scalable video streaming with network coding

Adaptive packet scheduling for scalable video streaming with...

引用

IEEE International Conference on Communications (ICC)

作者： Shenglan Huang Ebroul Izquierdo Pengwei Hao School of Electrical Engineering and Computer Science Queen Mary University of London London UK

In advanced Peer-to-Peer delivery systems, each user downloads a video stream and at the same time uploads the same stream to other users. In live streaming, scalable video streaming is also proposed to allow partial decoding of the video streaming at a reduced resolution, frame-rate or quality, adapting to different display requirements and receptions conditions of heterogeneous receivers. In live streaming applications, Network Coding (NC) has the potential to bring substantially higher throughput while reducing transmission delays. However, the bandwidth efficiency of NC transmission is still a problem to live media streaming due to the lack of synchronization among peers. To solve this problem, we introduce a scalable streaming system, which includes a layer selection algorithm and a distributed packet scheduling algorithm. The proposed system is tested by streaming a scalable video over a peer-to-peer network. The experimental results confirm that the proposed algorithm achieves better video quality, better delivery ratio, and lower transmission redundancy.

关键词： Peer-to-peer computing Streaming media Bandwidth Receivers Network coding Media scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhanced job scheduling algorithm with budget constraints in computational grids

Enhanced job scheduling algorithm with budget constraints in...

引用

International Conference on Computational Techniques in Information and Communication Technologies (ICCTICT)

作者： Shalini Chawla Krishan Saluja Department of CSE SBS State Technical Campus Ferozepur India Department of CSE Punjab Technical University Ferozepur India

ISBN: (纸本)9781509000838

In present era, technical problems are complex enough to be resolved by a single computer. Grid Computing is a promising field that deals with exploiting the idle CPU cycles of resources connected in a network. Job scheduling is a most demanding subject in computing grids. An effective scheduling strategy is required to utilize the resources in grid and to balance the overall load on them. This paper presents an enhanced job scheduling algorithm with budget constraint which extends existing algorithm to include economy factor into account. The main contribution of our work is dual: Firstly it tries to balance load of overall grid system and secondly it assigns tasks to resources with best computing capability which lies within the budget specified by each user. The performance of proposed algorithm is assessed by conducting simulations using GridSim. Observations prove that this algorithm achieves reduced average cost of execution for jobs to great extent so that it lies in the user's stated budget.

关键词： Load management Clustering algorithms Portals scheduling algorithms Grid computing Load modeling

来源：评论

学校读者我要写书评

暂无评论

A Novel Bottleneck Identification Based Differential Evolution Algorithm for scheduling Complex Manufacturing Lines

A Novel Bottleneck Identification Based Differential Evoluti...

引用

International Conference on Information Science and Control Engineering (ICISCE)

作者： Yong Sun Peng Jiang Beijing Research Institute of Mechanical and Electrical Technology (BRIMET) Beijing China

ISBN: (纸本)9781509025367

This paper presents a bottleneck identification based differential evolution algorithm for scheduling complex production lines. Operation priority sequences of bottleneck machine groups are determined by the differential evolution algorithm, while operation priority sequences of non-bottleneck machine groups are determined by predefined heuristic rules. The bottleneck identification method is presented based on the average flow time of all operations on each machine groups. The machine groups with longer average flow time are considered to be bottlenecks of manufacturing lines. In the differential evolution algorithm, mutation process is constructed by the operation priority differences and crossover process is constructed by operation priority swap. DE/best/1/bin and DE/rand/1/bin are used together to improve the efficiency while avoiding prematurity. Simulation results indicate the validity and efficiency of the algorithm presented in this paper.

关键词： Manufacturing Job shop scheduling Sociology Statistics Algorithm design and analysis scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

QoS scheduling algorithm with Improved MAX C/I for the performance enhancement of WiMAX environment

QoS scheduling algorithm with Improved MAX C/I for the perfo...

引用

IEEE International Conference on Engineering and Technology (ICETECH)

作者： Abhishek Kumar Rai Chandrakant Mahobiya Department of Computer Science and Engineering MATS University Arang Raipur India

ISBN: (纸本)9781467399159

Worldwide Interoperability for Microwave Access applications and QoS specifications are based upon class based schemes. These service classes effect to QoS for user fairness and system utilization. Improved MAX C/I algorithm considers user waiting time and channel to interference ratio but not class based scheduling schemes, after including this neglecting condition algorithm solves the problem of long distance priorities. MAX C/I and RR scheduled the instructions of execution where queue and priorities of users set. But this Improved MAX C/I condition not gain QoS specifications criteria, now mDmT resolves those neglecting conditions to resolve QoS lacking under network architecture. This comparison performs to evaluate minimum delay for user choice execution and maximum utilization of system with high efficiency. mDmT generates with the combination of MLDRR, E-APF, Modified Inverse C/I and mDmSIR which are completely designs under the instructions of WiMAX scheduling schemes. MLDRR scheduler that not categorized sudden priorities to users because DRR show fix granularity and it gives large delay for short executable packets and low throughput. MLDRR high throughput and small delay. The property helps to overcome the problem of DRR and provides work conserving scheduler environment where scheduler never idles when packets are waiting in the queue. E- APF describes Resource management with MDRR and APF with consideration of quantum value, assign weights and priority queuing. Differentiation of quality of service (QoS) acts as modified C/I base scheduling algorithm and performs on specifications of Prioritized C/I and Modified Inverse C/I scheduling. Prioritized C/I scheduling works with MAX C/I and RR, for those users which are in equal distances from base station (BS) with different service class schemes. In Prioritized C/I, if two users having same priority then scheduler allocates execution time according to Channel Quality Indicator (CQI) values. Second is Modif

关键词： Quality of service WiMAX Delays Throughput scheduling scheduling algorithms Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Energy efficient priority packet scheduling with delay and loss constraints for wireless sensor networks

Energy efficient priority packet scheduling with delay and l...

引用

International Conference on Inventive Computation Technologies (ICICT)

作者： J. Jean Justus A. Chandra Sekar Department of Computer Science and Engineering St. Joseph's College of Engineering OMR Chennai 600119 Tamilnadu India

ISBN: (纸本)9781509012862

Wireless Sensor Networks (WSN) consists of numerous minute sensor nodes that are linked wirelessly to one another. In WSN, the data packets are transmitted from source node to destination through several intermediate nodes which forward data packets towards the next one hop neighbor. However, each node participates simultaneously in several data transmissions. As a result, each node may have several data packets stored in it, which needs to be transmitted when channel becomes free. But, there are several types of data packets like real time and non real time and based on the application, immediate transmission of some packets are critical. In this paper, we propose to develop a packet scheduling technique based on delay and loss constraints. In this technique, every incoming data packet is analyzed and prioritized according to the delay and loss constraints. Then the prioritized data is scheduled on the basis of packet priority. This ensures immediate delivery of high priority data packets to guarantee proficient network operation.

关键词： Delays Wireless sensor networks scheduling algorithms Real-time systems Optimal scheduling Reliability Nickel

来源：评论

学校读者我要写书评

暂无评论

Data Rate Guarantee for Coflow scheduling in network function virtualization

Data Rate Guarantee for Coflow scheduling in network functio...

引用

International Workshop on Quality of Service

作者： Jianhui Zhang Keqiu Li Deke Guo Heng Qi Xiaoyi Tao Yingwei Jin School of Computer Science and Technology Dalian University of Technology Dalian China School of Information System and Management National University of Defense Technology Changsha China School of Management Dalian University of Technology Dalian China

In data centers, a lot of cluster computing applications follow a coflow pattern. On the other hand, network function virtualization (NFV) sufficiently improves the performance of the data center network. However, coflows encounter extremely different processing delays under diverse network functions. Traditional coflow scheduling schemes become insufficient in this situation. Based on the observation that the benefit of coflows is closely related to the data rates of flows, we propose DRGC (Data Rate Guarantee for Coflow) to guarantee the data rate requirements of coflows in the NFV environment. We prioritize the scheduling sequence of coflows, precisely allocate data rates for individual flows, and design an efficient scheduling algorithm. DRGC maintains the desired data rates of coflows with higher priorities at middleboxes and leaves more scheduling opportunities to the ones with lower priorities. In the large-scale trace-driven experiment, DRGC efficiently guarantees the data rate requirements of coflows and supports more 15% workload, compared with other scheduling schemes.

关键词： scheduling Middleboxes scheduling algorithms Delays Resource management Quality of service

来源：评论

学校读者我要写书评

暂无评论

Value of Service Based Task scheduling for Cloud Computing Systems

Value of Service Based Task Scheduling for Cloud Computing S...

引用

International Conference on Cloud and Autonomic Computing (ICCAC)

作者： Cihan Tunc Nirmal Kumbhare Ali Akoglu Salim Hariri Dylan Machovec Howard Jay Siegel NSF Center for Cloud and Autonomic Computing University of Arizona Tucson Arizona USA Department of Electrical and Computer Engineering Department of Computer Science Colorado State University Fort Collins Colorado USA

ISBN: (纸本)9781509035373

Task scheduling for large scale computing systems is a challenging problem. From the users' perspective, the main concern is the performance of the submitted tasks, whereas, for the cloud service providers, reducing cost while providing the required service is critical. Therefore, there is a need for task scheduling mechanisms that balance users' performance requirements while being energy efficient. We present a time dependent Value of Service (VoS) metric that takes into consideration the arrival time of a task while evaluating the value of completing a task within its deadline and its energy consumption within a constraint. We consider the variation in value for completing a task at different times such that the value of energy reduction can change significantly between peak and non-peak periods. We use completion time and energy based value functions with soft and hard thresholds. Thus, we define the VoS for a given workload to be the sum of the values for all tasks that are executed during a given period of time. Our system model is based on virtual machines (VMs), where each task will be assigned a resource configuration characterized by the number of the homogeneous cores and amount of memory. Using VoS, we design, evaluate, and compare our task scheduling methods to show a significant improvement in energy consumption when considering time-of-use dependent scheduling algorithms. The experimental results are run on an IBM blade server using KVM. The experimental results show using time dependent VoS, 50% improvement in performance value, 40% improvement in energy value, and up to 91% improvement in VoS over a heuristic that only considers only the hard threshold of the value functions.

关键词： Energy consumption Cloud computing Measurement Resource management scheduling algorithms scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：