• Journal of Information Processing Systems
• /
• v.5 no.2
• /
• pp.97-104
• /
• 2009

In this paper we propose a Differentiated Services Based Admission Control and Routing Algorithm for IPv6 (ACMRA). The basic DiffServ architecture lacks an admission control mechanism, the injection of more QoS sensitive traffic into the network can cause congestion at the core of the network. Our Differentiated Services Based Admission Control and Routing Algorithm for IPv6 combines the admission control phase with the route finding phase, and our routing protocol has been designed in a way to work alongside DiffServ based networks. The Differentiated Services Based Admission Control and Routing Algorithm for IPv6 constructs label switched paths in order to provide rigorous QoS provisioning. We have conducted extensive simulations to validate the effectiveness and efficiency of our proposed admission control and routing algorithm. Simulation Results show that the Differentiated Services Based Admission Control and Routing Algorithm for IPv6 provides an excellent packet delivery ratio, reduces the control packets' overhead, and makes use of the resources present on multiple paths to the destination network, while almost each admitted flow shows compliance with its Service Level Agreement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4724-4747
• /
• 2016

To efficiently reduce on-grid energy consumption, the admission control algorithm in the hybrid energy powered cellular network (HybE-Net) with base stations (BSs) powered by on-grid energy and solar energy is studied. In HybE-Net, the fluctuation of solar energy harvesting and energy consumption may result in the imbalance of solar energy utilization among BSs, i.e., some BSs may be surplus in solar energy, while others may maintain operation with on-grid energy supply. Obviously, it makes solar energy not completely useable, and on-grid energy cannot be reduced at capacity. Thus, how to control user admission to improve solar energy utilization and to reduce on-grid energy consumption is a great challenge. Motivated by this, we first model the energy flow behavior by using stochastic queue model, and dynamic energy characteristics are analyzed mathematically. Then, fuzzy logic based admission control algorithm is proposed, which comprehensively considers admission judgment parameters, e.g., transmission rate, bandwidth, energy state of BSs. Moreover, the index of solar energy utilization balancing is proposed to improve the balance of energy utilization among different BSs in the proposed algorithm. Finally, simulation results demonstrate that the proposed algorithm performs excellently in improving solar energy utilization and reducing on-grid energy consumption of the HybE-Net.

• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1273-1281
• /
• 2004

There have been a number of researches on real-time packet scheduling based on EDF algorithm to support end-to-end delay bound guarantees for real-time traffic transmission. However, EDF-based packet scheduler could not guarantee the real-time requirements of real-time traffic if there exist non-real-time traffic. In this paper, we propose a new admission control algorithm and packet scheduling scheme considering non-real-time traffic in the real -time packet scheduler based on EDF policy. Proposed admission control algorithm has pseudo-polynomial time complexity, but we show through simulation that it can be used with little run-time overhead.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.464-468
• /
• 2007

In cognitive radio systems, secondary users, unlicensed users, can use primary users' spectrum to increase spectrum efficiency. At that time, the systems must satisfy primary users' QoS. When secondary users use cognitive radio systems, secondary users communication can be terminated, because of satisfying primary users' QoS. However, secondary users' communication terminating is not good for both secondary users and whole systems. So, cognitive radio systems need an efficient algorithm for secondary users of admission control and keeping connections. In this paper, we present an algorithm which consist of two part, admission control and connections control.

• Journal of Internet Computing and Services
• /
• v.6 no.3
• /
• pp.121-128
• /
• 2005

Recently, as the research of effective resource management for supporting of various next generation internet service, the admission control mechanisms using the dynamic provisioning methods in differentiated service networks are studied. However, even though admission control mechanism is applied to the network, there exits the unfairness of call blocking probability among the different bandwidth requested services. In this paper, we propose the new admission control policy heuristic algorithm that provides fairness of call blocking probability between the large bandwidth requested service and the small bandwidth requested service. The simulation results show that the proposed algorithm provides not only blocking probability fairness but also high bandwidth utilization.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.173-181
• /
• 2009

The growth of the World Wide Web and web-based applications is creating demand for high performance web servers to offer better throughput and shorter user-perceived latency. This demand leads to widely used cluster-based web servers in the Internet infrastructure. Load balancing algorithms play an important role in boosting the performance of cluster web servers. Previous load balancing algorithms suffer a significant performance drop under dynamic and database-driven workloads. We propose an estimation-based load balancing algorithm with admission control for cluster-based web servers. Because it is difficult to accurately determine the load of web servers, we propose an approximate policy. The algorithm classifies requests based on their service times and tracks the number of outstanding requests from each class in each web server node to dynamically estimate each web server load state. The available capacity of each web server is then computed and used for the load balancing and admission control decisions. The implementation results confirm that the proposed scheme improves both the mean response time and the throughput of clusters compared to rival load balancing algorithms and prevents clusters being overloaded even when request rates are beyond the cluster capacity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9B
• /
• pp.771-777
• /
• 2004

In a COMA system, the capacity is variable and mainly depends on multiple access interference. The multiple access interference has a deep relationship with transmitted or received power. The capacity of COMA2000 system is considered to be limited by the forward link capacity. In this paper, we show that the forward link cell load can be represented by the total transmitted power of base station and we propose a forward link call admission control (CAC) strategy for COMA2000 system. The proposed call admission scheme adopts the rate control algorithm for data call. This call admission scheme enables the system to utilize radio resource dynamically by controlling data rate according to the cell load status, and enhance the system throughput and grade of service (GoS). quality of service(QoS) such as blocking and outage probability.

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.69-75
• /
• 2012

In this paper, to provide various services of QoS, and moreover applying traffic ratio to CAC(Call Admission Control) algorithm tested how long average data rate and the average packet delay time. When CAC algorithm is not applied, traffic mixture ratio is 1:1:4:4, the FTP Service 0.4, web services 0.6, streaming service 0.7, the packet delay requirements are not satisfied. On the other hand CAC Algorithm is applied, all the service of packet delay are satisfied with arrival rate. Therefore, we can make sure that applying of CAC of traffic control WWW, FTP, Video, VoIP can guarantee the various services of QoS.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.163-164
• /
• 2008

In this paper, we study a dynamic price-based call admission control algorithm for communication networks. When a call arrives at the network, the network calculates the price for the call such that its expected revenue is maximized. The optimal price is dynamically adjusted based on some information of the call, and the congestion level of the network. If the call accept the price, it is admitted. Otherwise, it is rejected. Simulation results show that our dynamic pricing algorithm provides higher call admission ratio and lower price than the static algorithm [1][2], even though they provide almost the same revenue.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9A
• /
• pp.1013-1021
• /
• 2004

In the WCDMA mobile multimedia communication system, the adaptive array antenna IS adopted to improve the performance of the system by reducing inter-user interference using antenna beam control. Usually, the interference resulted from the higher data rate users is much more significant to the lower data rate users than the other way around, so the overall performance can be enhanced by reducing the interference from higher data rate users. In order to maximize the efficiency of adaptive antenna operation, an optimal call admission control, especially during handoff, adaptive to the data rates is a critical problem. In this paper, We propose a call admission control algorithm based on the Soft QoS concept for the efficient processing of the handoff of higher data rate calls, and an adaptive handoff control mechanism according to the data rates. The proposed algorithm has been evaluated by computer simulation that it accommodates high data rate users among many lower data rate users much better, and the average call blocking probability for lower rate users becomes much lower than the conventional call admission control algorithm.