Review on Service Curves of Typical Scheduling Algorithms

In recent years,various internet architectures,such as Integrated Services(IntServ),Differentiated Services(DiffServ),Time Sensitive Networking(TSN)and Deterministic Networking(DetNet),have been proposed to meet the quality-of-service(QoS)requirements of different network services.Concurrently,network calculus has found widespread application in network modeling and QoS analysis.Network calculus abstracts the details of how nodes or networks process data packets using the concept of service curves.This paper summarizes the service curves for typical scheduling algorithms,including Strict Priority(SP),Round Robin(RR),Cycling Queuing and Forwarding(CQF),Time Aware Shaper(TAS),Credit Based Shaper(CBS),and Asynchronous Traffic Shaper(ATS).It introduces the theory of network calculus and then provides an overview of various scheduling algorithms and their associated service curves.The delay bound analysis for different scheduling algorithms in specific scenarios is also conducted for more insights.

一种可扩展的Web Service QoS管理框架

Web Service是目前研究界和产业界广泛关注的技术之一.随着Web Service的广泛应用,研究者们普遍认识到,服务的非功能属性,即服务质量(Quality of Service,QoS)是面向服务的应用能否成功的关键因素之一.因此,研究者们尝试从多个角度对QoS相关问题展开了研究.然而,现有工作普遍关注基于QoS的动态服务选择和组装等上层应用技术,而对于如何获取、存储、度量QoS等基础支持技术研究较少,而这些基础性工作对QoS相关的研究工作具有显著的重要性.此外,不同应用领域对Web Service QoS的需求不尽相同,因此,需要有一套灵活的机制支持在QoS模型定义、QoS度量方法、QoS信息采集等方面体现出的领域特性.针对这个问题,文中提出了一个可扩展的Web Service QoS信息管理框架,详细分析了该框架涉及到的重要方法与核心技术,并给出了该框架在北京大学软件构件库系统中的设计决策和方案.最后,介绍了文中框架在一个863计划项目中的应用实例,该实例展示了用户根据其应用的领域需求对本框架进行扩展并进行Web Service QoS管理的方法,从而验证了本管理框架的可扩展性及实用性.

Web services composition with QoS bound based on simulated annealing algorithm

In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.

Scheduling Algorithm with Quality of Service Support in IEEE 802.16 Networks

The MAC layer in IEEE802.16 is designed to differentiate service among traffic categories with different multimedia requirements.In this paper,a scheduling algorithm at MAC layer for multiple connections with diverse QoS requirements is proposed.As for this algorithm,each connection is assigned a priority,which is updated dynamically based on its service status concluding queue characteristic and channel state.A connection with the highest priority is scheduled each time.Analytical model is developed by assuming a Finite State Markov Chain(FSMC)channel model.Simulation results show that the proposed scheduling algorithm can improve the performance of mean waiting time and throughput in broadband wireless networks.

基于时间序列分析的Web Service QoS预测方法

通过网络提供服务的Web Service的服务质量会随着网络环境、服务器负载等因素的变化而变化,如何更好地帮助用户选择在未来一段时间内符合服务质量需求的Web Service,是目前服务计算领域中需要解决的关键问题之一。针对上述问题,提出了一种基于时间序列分析的Web Service QoS预测方法,并实现了相应的Web Service QoS自动预测工具。该工具能够根据Web Service的历史QoS数据,有效地预测未来短期内的QoS信息。以17832个Web Service的历史数据为基础,设计了相关实验,并验证了方法的有效性。

Modeling and performance evaluation of QoS-aware job scheduling of computational grids

To achieve high quality of service （QoS） on computational grids, the QoS-aware job scheduling is investigated for a hierarchical decentralized grid architecture that consists of multilevel schedulers. An integrated QoS-aware job dispatching policy is proposed, which correlates priorities of incoming jobs used for job selecting at the local scheduler of the grid node with the job dispatching policies at the global scheduler for computational grids. The stochastic high-level Petri net （SHLPN） model of a two-level hierarchy computational grid architecture is presented, and a model refinement is made to reduce the complexity of the model solution. A performance analysis technique based on the SHLPN is proposed to investigate the QoS-aware job scheduling policy. Numerical results show that the QoS-aware job dispatching policy outperforms the QoS-unaware job dispatching policy in balancing the high-priority jobs, and thus enables priority-based QoS.

QoS驱动的Web services动态计价机制研究

结合Web services的服务质量(QoS)因素和用户经验,对Web services的计价机制进行研究,提出一种QoS驱动的Web services动态计价模型,描述其计价过程,并给出相应的实现算法。通过对模型的简单实现,经测试这一计价模型在准确性和合理性上具有一定优势。

Quality of Service and Security on Cisco Network Devices, Coupled with the Development of a Mobile Application Prototype Software for Server Room Temperature Monitoring

In an era where digital technology is paramount, higher education institutions like the University of Zambia (UNZA) are employing advanced computer networks to enhance their operational capacity and offer cutting-edge services to their academic fraternity. Spanning across the Great East Road campus, UNZA has established one of the most extensive computer networks in Zambia, serving a burgeoning community of over 20,000 active users through a Metropolitan Area Network (MAN). However, as the digital landscape continues to evolve, it is besieged with burgeoning challenges that threaten the very fabric of network integrity—cyber security threats and the imperatives of maintaining high Quality of Service (QoS). In an effort to mitigate these threats and ensure network efficiency, the development of a mobile application to monitor temperatures in the server room was imperative. According to L. Wei, X. Zeng, and T. Shen, the use of wireless sensory networks to monitor the temperature of train switchgear contact points represents a cost-effective solution. The system is based on wireless communication technology and is detailed in their paper, “A wireless solution for train switchgear contact temperature monitoring and alarming system based on wireless communication technology”, published in the International Journal of Communications, Network and System Sciences, vol. 8, no. 4, pp. 79-87, 2015 [1]. Therefore, in this study, a mobile application technology was explored for monitoring of temperatures in the server room in order to aid Cisco device performance. Additionally, this paper also explores the hardening of Cisco device security and QoS which are the cornerstones of this study.

Interactive Web service choice-making based on extended QoS model

Quality of Service (QoS) is a key factor in Web service advertising, choosing and runtime monitoring. Web service QoS is multi-faceted, fuzzy and dynamic. Current researches focus on implementation level performance assurance, ignoring domain specific or application level metrics which are also very important to service users. Industry Web service standards lack QoS expression. The support for QoS based service choice-making is very limited. We proposed an extended Web service QoS model based on configurable fuzzy synthetic evaluation system. Web service QoS is evaluated dynamically according to the service context. A QoS requirement description model is also given for service QoS requirement definition. An interactive Web service choice-making process is described, which takes QoS as a key factor when choosing from functionally equivalent services.

A QoS-aware Method for Web Services Discovery

The non-functional QoS (quality of service) information helps us to select a proper Web-service from the web applications, by using component services such as UDDI[1](Universal Description, Discovery, and Integration) and MDS(Monitoring and Discovery System). MDS is a suite of web services to monitor and discover resources and service on Grids, but MDS only based on function aspects. This paper studies on an approach to provide the QoS information and a discovery model by using MDS and gives a system deployment and implementation plan. The simulation results show that the method is effective in service discovery.

Service allocation based on QoS evaluation in military organization cloud cooperation

The problem of cloud cooperation of military service providers（MSPs） is addressed for allocating limited resources to military service users（MSUs） that are geographically distributed. The MSPs, also called military organization clouds, are virtualized and encapsulated by the services they can offer and each of them contains different kinds of resources that MSU needs. The MSPs are also geographically dispersed. They are required to allocate their resources to the MSU complying with the corresponding quality of service（QoS）, so that each MSU gathers the services it needs to guarantee its task to be implemented. The outline of military organization cloud cooperation is discussed and the method of service optimal selection is proposed based on QoS evaluation. The QoS evaluation method based on exponential approximation is put forward to include the users＇ will. Simulation results verify the effectiveness of the proposed algorithm.

Toward Cloud Computing QoS Architecture:Analysis of Cloud Systems and Cloud Services

Cloud can be defined as a new computing paradigm that provides scalable, on-demand, and virtualized resources for users. In this style of computing, users can access a shared pool of computing resources which are provisioned with minimal management efforts of users. Yet there are some obstacles and concerns about the use of clouds. Guaranteeing quality of service QoS by service providers can be regarded as one of the main concerns for companies tending to use it. Service provisioning in clouds is based on service level agreements representing a contract negotiated between users and providers. According to this contract, if a provider cannot satisfy its agreed application requirements, it should pay penalties as compensation. In this paper, we intend to carry out a comprehensive survey on the models proposed in literature with respect to the implementation principles to address the QoS guarantee issue. © 2014 Chinese Association of Automation.

A QoS-Aware Packet Scheduling Mechanism in Cognitive Radio Networks for Smart Grid Applications

Cognitive radio sensor network is applied to facilitate network monitoring and management, and achieves high spectrum efficiencies in smart grid. However, the conventional traffic scheduling mechanisms are hard to provide guaranteed quality of service for the secondary users. It is because that they ignore the influence of diverse transition requirements in heterogeneous traffi c. Therefore, a novel Qo S-aware packet scheduling mechanism is proposed to improve transmission quality for secondary users. In this mechanism, a Qo S-based prioritization model is established to address data classification firstly. And then, channel quality and the effect of channel switch are integrated into priority-based packet scheduling mechanism. At last, the simulation is implemented with MATLAB and OPNET. The results show that the proposed scheduling mechanism improves the transmission quality of high-priority secondary users and increase the whole system utilization by 10%.

An approach for QoS measurement and web service selection sureness

Web services have gained popularity m recent years anu prowue a new moue, u~ w^u, w,,,~,, ,^- cilitates interaction of scientific and business applications through the Internet. More often, several services with similar functionality are available from a large and changing number of service provid- ers. Quality of Service （QoS） is the dominant factor in service selection and is of great importance to users. In this paper, we propose a model for QoS measurement and web services selection. The model consists of QoS model, QoS monitoring, QoS comparison and service selection with a QoS feedback mechanism. The most suitable service is to take into account the agreed QoS, monitoring is done during invocation phase and if any deviation is recorded, next suitable service is selected. Fi- nally the model is proved to be feasible and effective by simulation experiments.

Constraint-based QoS-aware Web Service Composition in Cross-organizational Collaboration

To improve the Quality of Service (QoS)-aware Web service compositions considering constraints between cross-organizational business,this paper analyzes the types of constraints,and accordingly proposes a Chaos Genetic Algorithm (CGA). The algorithm creates an initial population of service compositions based on the chaos theory,and then processes individuals which violate constraints in the initial population using repair strategies. Next,a new fitness function is designed to gradually eliminate the infeasible compositions generated in evolution. Finally,the algorithm makes minor chaotic disturbances on the evolved group to accelerate convergence and avoid local optimum. Experimental results demonstrate the effectiveness of the proposed algorithm.

TRS Scheduling for Improved QoS Performance in Cloud System

Numerous methods are analysed in detail to improve task schedulingand data security performance in the cloud environment. The methodsinvolve scheduling according to the factors like makespan, waiting time,cost, deadline, and popularity. However, the methods are inappropriate forachieving higher scheduling performance. Regarding data security, existingmethods use various encryption schemes but introduce significant serviceinterruption. This article sketches a practical Real-time Application CentricTRS (Throughput-Resource utilization–Success) Scheduling with Data Security(RATRSDS) model by considering all these issues in task scheduling anddata security. The method identifies the required resource and their claim timeby receiving the service requests. Further, for the list of resources as services,the method computes throughput support (Thrs) according to the number ofstatements executed and the complete statements of the service. Similarly, themethod computes Resource utilization support (Ruts) according to the idletime on any duty cycle and total servicing time. Also, the method computesthe value of Success support (Sus) according to the number of completions forthe number of allocations. The method estimates the TRS score (ThroughputResource utilization Success) for different resources using all these supportmeasures. According to the value of the TRS score, the services are rankedand scheduled. On the other side, based on the requirement of service requests,the method computes Requirement Support (RS). The selection of service isperformed and allocated. Similarly, choosing the route according to the RouteSupport Measure (RSM) enforced route security. Finally, data security hasgets implemented with a service-based encryption technique. The RATRSDSscheme has claimed higher performance in data security and scheduling.

A NEW SCHEDULING ALGORITHM TO PROVIDE PROPORTIONAL QOS IN OPTICAL BURST SWITCHING NETWORKS

A new scheduling algorithm, which aims to provide proportional and controllable QoS (Quality of Service) in terms of burst loss probability for OBS (Optical Burst Switching) networks, is proposed on the ba- sis of a survey of QoS schemes in current OBS networks. With simulations, performance analysis and com- parisons are carried out 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.

A QoS-aware scheduling algorithm for combined-input-crosspoint-queued switch

In this paper, we study the quality of service requirement and guaranteed-rate scheduling problem for combined-input-crosspoint-queued (CICQ) switches. Using crosspoint buffers between input queues and output ports, the input and output scheduling can be decoupled in CICQ switches. Here we propose a new guaranteed-rate scheduling algorithm which is divided seperately into input and output scheduling. Simulation results show that our algorithm can perform better than existing scheduling schemes in both packet loss and jitter control.

Packet Scheduling Algorithm for Real-Time Services in Broadband WMAN

Packet scheduling algorithm is the key technology to guarantee Quality of Service (QoS) and balance the fairness between users in broadband Wireless Metropolitan Area Network (WMAN). Based on the research of Proportional Fairness (PF) algorithm and Modified Largest Weighted Delay First (M-LWDF) algorithm, a new packet scheduling algorithm for real-time services in broadband WMAN, called Enhanced M-LWDF (EM-LWDF), was proposed. The algorithm phases in new information to measure the load of service queues and updates the state parameters in real-time way, which remarkably improves system performance.Simulation results show that comparing with M-LWDF algorithm, the proposed algorithm is advantageous in performances of queuing delay and fairness while guaranteeing system throughput.

Proportional rate scheduling based on QoS in mobile WiMAX networks

A new scheduling scheme based on users＇ quality of service（QoS） in mobile WiMAX networks is presented.The proposed scheme tracks each user＇s average rate and adjusts the corresponding scheduling weight adaptively to result in：（a） each user＇s average rate is proportional to the corresponding QoS level;（b） the constraints of the minimal and/or maximal rates required by QoS can be satisfied;（c） the utility function of system is maximal under the constraints（a） and（b）.Theoretical analysis based on utility function and simulation results indicates the system throughput can be improved dramatically in the proposed scheme.