• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.3913-3934
• /
• 2021

Real-time prediction of Web service of quality (QoS) provides more convenience for web services in cloud environment, but real-time QoS prediction faces severe challenges, especially under the cold-start situation. Existing literatures of real-time QoS predicting ignore that the QoS of a user/service is related to the QoS of other users/services. For example, users/services belonging to the same group of category will have similar QoS values. All of the methods ignore the group relationship because of the complexity of the model. Based on this, we propose a real-time Matrix Factorization based Clustering model (MFC), which uses category information as a new regularization term of the loss function. Specifically, in order to meet the real-time characteristic of the real-time prediction model, and to minimize the complexity of the model, we first map the QoS values of a large number of users/services to a lower-dimensional space by the PCA method, and then use the K-means algorithm calculates user/service category information, and use the average result to obtain a stable final clustering result. Extensive experiments on real-word datasets demonstrate that MFC outperforms other state-of-the-art prediction algorithms.

• ETRI Journal
• /
• v.28 no.1
• /
• pp.31-44
• /
• 2006

In a packet switching network, congestion is unavoidable and affects the quality of real-time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well-known solutions for quality-of-service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.

• International Journal of Reliability and Applications
• /
• v.3 no.2
• /
• pp.99-112
• /
• 2002

Traffic congestion is one of critical factors in Internet applications to guarantee their QoS and provide reliable services. This paper discusses many existing congestion control algorithms and proposes a new ISDA. The algorithm is analyzed in respect of queue length, throughput and fairness. The proposed algorithm is working well with TCP and UDP traffics to offer QoS guarantee and fairness.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.477-488
• /
• 2001

In wireless networking environments, supporting guaranteed quality of service to mobile hosts is difficult due to the facts that wireless networks have limited bandwidth and mobile hosts frequently move in and out of cells. In spite of the characteristics of wireless communications, the quality of some types of services, i.e., real-time services, must be guaranteed at a certain level. When a mobile host moves into another cell, service rates for mobile hosts in wireless networks may be adjusted since wireless networks have limited bandwidths. In this paper, we propose two resource allocation algorithms in wireless mobile networks, using quality of service (QoS) specifications. For efficient use of resources of wireless networks, the proposed algorithms dynamically allocate rates of flows in proportion to QoS with limited resources.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.351-361
• /
• 2008

This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.

• Journal of Advanced Navigation Technology
• /
• v.14 no.4
• /
• pp.521-529
• /
• 2010

In this paper, we propose a new scheduling algorithms in OFDM systems to reduce inter-cell interference. The proposed algorithm applies different subcarrier allocation sequences for different cells which is optimized through integer programming to minimize inter-cell interference. System level simulation is executed to derive the performance of the proposed algorithm. Simulation results show that the proposed scheduling algorithm improves user fairness as well as throughput compared with previous algorithms and therefore improves support of user QoS.

• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.39-47
• /
• 2007

The scheduling algorithms to provide quality of service (QoS) in broadband convergence network (BcN) are compared and analysed. The main QoS management methods such as traffic classification, traffic processing in the input queue and weighted queueing are first analysed, and then the major scheduling algorithms of round robin, priority and weighted round robin under recently considering for BcN to supply real time multimedia communications are analysed. The simulation results by NS-2 show that the scheduling algorithm with proper weights for each traffic class outperforms the priority algorithm.

• IE interfaces
• /
• v.23 no.2
• /
• pp.193-202
• /
• 2010

The quality of service(QoS) model should be presented with the optimal network design to effectively provide the multimedia data services between users and converged services with mobile or TV in the next-generation Internet. In specific, the method to provide differentiated services for each user is needed in the given Internet node to offer the previously negotiated QoS with the user. In this paper, the performance of the QoS enabling technologies in the differentiated services(DiffServ) network domain is analyzed. The QoS offering model and QoS metrics are presented to analyze the performance of the major scheduling algorithms. Under the real network topology and virtual service scenarios in the university, the NS-2 network simulation based on the discrete-event is performed. The results show that the ratio-based scheduling method is more effective rather than the bandwidth-assignment method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.553-562
• /
• 2003

Supporting QoS (Quality of Service) for the multimedia applications becomes an important issue as the demand of multimedia applications increases. Thus, it is necessary for the application layer to have an efficient congestion control algorithm, which can support the multimedia applications' QoS requirements. In this paper, we propose a new application layer congestion control algorithm, called RRC-OTT (Receiver-based Rate Control with One-way Trip Time). RRC-OTT algorithm differs from the previously proposed algorithms in that the receiver takes the responsibility of the network congestion control. Thus, RRC-OTT algorithm can not only precisely estimate the network congestion using OTT (one-way Trip Time), but reduce the work load from the sender (e.g., the web server). Our simulation study shows that RRC-OTT algorithm can maintain the comparable link utilization to the previously proposed algorithms and keep the packet jitter low, which thus can help enhance the quality of multimedia applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.7
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.