• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.11a
• /
• pp.219-223
• /
• 2003

A lot of researches have been done on supporting QoS in the mobile networks and ad hoc network architectures, but most of them are not suitable in the static ad hoc environment. Most Research in mobile ad hoc networks has been devoted to routing protocol since they are fundamantal to the technology for improving QoS. In mobile ad hoc networks, QoS means not only fast speed and reliable transmission but reliable node. Needless to say, general QoS is serious question. In this paper, we enunciate the proposition to reduce network load and prevent node expire using buffer node.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.907-916
• /
• 2005

RMCP is an application layer multicast protocol and was established as a standard by ITU-T Also, RMCP includes a scheme which can statically construct a multicast tree. In this paper, we propose a QoS based tree construction scheme which can dynamically construct a multicast tree. And this scheme shows more superior performance than the static tree scheme of RMCP in terms of start-up delay and user requirement QoS. This scheme consists of a best-fit method using multiple sub-net groups which are satisfied a user requirement QoS and a first-fit method using one sub-net group which has maximum transmission bandwidth. In simulation result, two proposed methods are superior to the existing static tree scheme.

• The KIPS Transactions:PartA
• /
• v.15A no.2
• /
• pp.101-110
• /
• 2008

Ubiquitous computing has extended the computer system into the whole physical space and has ushered the emergence of more dynamic distributed systems. This environment require unique QoS parameters for various devices, resources and user requirements. In this paper, we propose a new hybrid QoS management model which defines a static-dynamic QoS parameter that is more appropriate to the ubiquitous computing environment. This model consists of the QoS Control Management Module(QoS CMM) in the client side and the Resource QoS Management Module (RQoS MM) in the server side. The RQoS MM deals with the static QoS parameters and the whole QoS control of the distributed control(QoS CMM) in order to minimize server load in cases of multiple communication. Finally, we present the experimental result of our location based application using a graphical user interface that shows the multimedia service execution of selected client device types such as desktop PC, notebook and PDA.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.891-910
• /
• 2021

Previous QoS-aware service composition methods mainly focus on how to generate composite service with the optimal QoS efficiently for a single request. However, in the real application scenarios, there are multiple service requests and multiple service providers. It is more important to compose services with suboptimal QoS and maintain the load balance between services. To solve this problem, in this paper, we propose a service composition method, named as dynamically change and balancing composition method (DCBC). It assumes that the QoS of service is not static, and the services can adjust the value of QoS to gain more opportunities to be selected for composition. The method mainly includes two steps, which are the preprocessing step and the service selection step. In the preprocessing step, a backward global best QoS calculation is performed which regarding the static and dynamic QoS respectively; then guided by the global QoS, the feasible services can be selected efficiently in the service selection step. The experiments show that the DCBC method can not only improve the overall quality of composite services but also guarantee the fulfill ratio of requests and the load balance of services.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.613-620
• /
• 2006

From both techlical and economic viewpoints, DiffServ IP QoS architecture is accepted as a more practical solution because of the complexity Problem of the other IntServ architecture. In this paper, we propose several models to support DiffServ QoS in DSL broadband access networks and discuss about migration path from current best-effort DSL networks to DiffServ-enabled ones. Since DSL networks are recently and widely deployed in the world amount ot new investment, compatibility with existing QoS-unaware DSL systems, and compatibility with existing charging systems as well as effective support of various QoS services must be carefully considered when we design DiffServ QoS support models in DSL networks. The DiffServ models proposed in this paper are divided into static DiffServ models and dynamic DiffServ models which are near-term solutions and long-term solutions repecitively. The static DiffServ models include Flat DiffServ which suworts per-subscriber DiffServ QoS and Structured DiffServ which supports per-subscriber and per-service DiffServ QoS. And the dynamic DiffServ models include Direct DiffServ for P2P(Peer to Peer) applications and Indirect DiffServ for ASP(Application Service Provider) applications.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.7
• /
• pp.283-292
• /
• 2013

In order to ensure high performance, all the servers in an existing server cluster are always On regardless of number of real-time requests. They ensure QoS, but waste server power if some of them are idle. To save energy consumed by servers, the server power mode control was developed by shutdowning a server when a server is not needed. There are two types of server power mode control depending on when a server is actually turned off if the server is selected to be off: static or dynamic. In a static mode, the server power is actually turned off after a fixed time delay from the time of the server selection. In a dynamic mode, server power is actually turned off if all the services served in the server are done. This corresponds to a turn off after a variable time delay. The static mdoe has disadvantages. It takes much time to find an optimal shutdown time manually through repeated experiments. In this paper, we propose a dynamic shutdown method to overcome the disadvantages of static shutdown. The proposed method allows to guarantee user QoS with good power-saving because it automatically approaches an optimal shutdown time. We performed experiments using 30 PCs cluster. Experimental results show that the proposed dynamic shutdown method is almost same as the best static shutdown in terms of power saving, but better than the best static shutdown in terms of QoS.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.3
• /
• pp.136-142
• /
• 2006

Existing buffer management schemes for shared-memory output queueing switches can be classified into two types: In the first type, some constant amount of memory space is guaranteed to each virtual queue using static queue thresholds. The static threshold method (ST) belongs to this type. On the other hand, the second type of approach tries to maximize the buffer utilization in 머 locating buffer memories. The complete sharing (CS) method is classified into this type. In the case of CS, it is very hard to protect regular traffic from mis-behaving traffic flows while in the case of ST the thresholds can not be adjusted according to varying traffic conditions. In this paper, we propose a new buffer management method called weighted dynamic thresholds (WDT) which can process packet flows based on loss priorities for quality-of-service (QoS) functionalities with fairly high memory utilization factors. We verified the performance of the proposed scheme through computer simulations.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.319-329
• /
• 2007

This paper presents a price-based quality-of-service (QoS) control framework for two-class network services, in which circuit-switched and packet-switched services are defined as "premium service class" and "best-effort service class," respectively. Given the service model, a customer may decide to use the other class as a perfect or an imperfect substitute when he or she perceives the higher utility of the class. Given the framework, fixed-point problems are solved numerically to investigate how static pricing can be used to control the demand and the QoS of each class. The rationale behind this is as follows: For a network service provider to determine the optimal prices that maximize its total revenue, the interactions between the QoS-dependent demand and the demand-dependent QoS should be thoroughly analyzed. To test the robustness of the proposed model, simulations were performed with gradually increasing customer demands or network workloads. The simulation results show that even with substantial demands or workloads, self-adjustment mechanism of the model works and it is feasible to obtain fixed points in equilibrium. This paper also presents a numerical example of guaranteeing the QoS statistically in the short term-that is, through the implementation of pricing strategies.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.596-606
• /
• 2008

In this paper, we present a co-design methodology of dynamic optimal network-bandwidth allocation (ONBA) and adaptive control for networked control systems (NCSs) to optimize overall control performance and reduce total network-bandwidth usage. The proposed dynamic co-design strategy integrates adaptive feedback control with real-time scheduling. As part of this co-design methodology, a "closed-loop" ONBA algorithm for NCSs with communication constraints is presented. Network-bandwidth is dynamically assigned to each control loop according to the quality of performance (QoP) information of each control loop. As another part of the co-design methodology, a network quality of service (QoS)-adaptive control design approach is also presented. The idea is based on calculating new control values with reference to the network QoS parameters such as time delays and packet losses measured online. Simulation results show that this co-design approach significantly improves overall control performance and utilizes less bandwidth compared to static strategies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.3
• /
• pp.465-474
• /
• 2001

In the network with small cell radius, a mobile terminal which has large mobility should perform frequent handover. This requires that handover mechanism must be done fastly. The currently existing method for handover uses an algorithm in which the bandwidth corresponding to the adjacent cells is supposed to be allocated. However, this method leads to the problem of requiring bandwidth allocation for many-unknown cells, due to the lack of information toward moving direction in mobile terminal. In this paper, we propose an efficient dynamic bandwidth allocation algorithm for solving those problem above, based on both path rerouting handover and soft handover mechanism with wireless ATM. As for the QoS, it has been shown that proposed algorithm shows better performance than that with static bandwidth allocation algorithm.