• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1393-1400
• /
• 2006

This paper optimizes the access probabilities (APs) in a network resource allocation scheme based on access probabilities in order that the waiting time and the blocking probability are minimized under the given constraints, and obtains its performance. In order to optimize APs, an infinite number of balance equations is reduced to a finite number of balance equations by applying Neuts matrix geometric method. And the nonlinear programming problem is converted into a linear programming problem. As a numerical example, the performance measures of waiting time and blocking probability for optimal access probabilities and the maximum utilization under the given constraints are obtained. And it is shown that the scheme with optimal APs gives more performance build-up than the strategy without optimization.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.568-580
• /
• 2014

To enhance the utilization of the traffic channels of a network (instead of allocating radio channel to an individual user), a channel or a group of channels are allocated to a user group. The idea behind this is the statistical distribution of traffic arrival rates and the service time for an individual user or a group of users. In this paper, we derive the blocking probability and throughput of a subscriber station of Worldwide Interoperability for Microwave Access (WiMAX) by considering both the connection level and packet-level traffic under a complete partition scheme. The main contribution of the paper is to incorporate the traffic shaping scheme onto the incoming turbulent traffic. Hence, we have also analyzed the impact of the drain rate of the buffer on the blocking probability and throughput.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.149-152
• /
• 2000

In this paper, the reverse link performance of an imperfect power controlled DS/CDMA cellular system that uses a base station array antenna which can effectively remove the multiple access interference is analyzed considering both beam forming algorithm and power control error in shadowing. The blocking probability of the DS/CDMA cellular system based on array parameters, Eb/No and statistics of interference is derived, and then the system capacity corresponding to a certain blocking probability is calculated. On the assumption that the blocking probability is set 1 ％, the system capacity using MCGM algorithm with 12 antenna arrays is increased about 59 % than that using 8 antenna arrays when power control error is 2.5 ㏈.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.360-368
• /
• 2008

In this paper, in order that the various QoS(Qualify of Service)s that are required by different traffic class are guaranteed in the random access channels in multi-service multi-user OFDMA systems, the backoff-based random access algorithm is proposed and corresponding performance is analyzed in terms of the access success probability, the throughput, the average delay and the blocking probability. Through the numerical analysis, it is shown that the proposed backoff-based random access algorithm can provide the differentiated QoSs to random access attempts according to their service class.

• Korean Management Science Review
• /
• v.23 no.2
• /
• pp.161-174
• /
• 2006

In this paper, we consider a network optimization problem arising from the deployment of BcN access network. BcN convergence services requires that access networks satisfy QoS meausres. BcN services have two types of traffics : stream traffic and elastic traffic. Stream traffic uses blocking probability as a QoS measure, while elastic traffic uses delay factor as a QoS measure. Incorporating the QoS requirements, we formulate the problem as a nonlinear mixed-integer Programming model. The Proposed model seeks to find a minimum cost dimensioning solution, while satisfying the QoS requirement. We propose two local search heuristic algorithms for solving the problem, and develop a network design system that implements the developed heuristic algorithms. We demonstrate the computational efficacy of the proposed algorithm by solving a realistic network design problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10A
• /
• pp.1529-1539
• /
• 2000

The contact procedure of access channel necessary to set up the originating call has a close relation with the performance and capacity of the base station system in CDMA cellular network. This paper investigates the structure and the operation of the backward channel of IS-95 CDMA standard and explains the related system parameters. We can derive the throughput of the CDMA access channel depending on the arrivals of the access probes per access channel slot, given the system parameters such as cell radius, the maximum number of retransmission, and the error rates of the access and paging channel. It shows that the performance in throughput is much better in the CDMA IS-95 access channel than in the slotted aloha channel. It also gives the reasonable number of the trafic channels in a cell with the given blocking probability.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.28-34
• /
• 2021

Internet Service Providers (ISPs) constantly endeavor to resolve network congestion, in order to provide fast and cheap services to the customers. This study suggests two models based on Markov chain, using three and four access attempts to complete the call. It involves a comparative study of four models to check the relationship between Internet Access sharing traffic, and the possibility of network jamming. The first model is a Markov chain, based on call-by-call attempt, whereas the second is based on two attempts. Models III&IV suggested by the authors are based on the assumption of three and four attempts. The assessment reveals that sometimes by increasing the number of attempts for the same operator, the chances for the customers to complete the call, is also increased due to blocking probabilities. Three and four attempts express the actual relationship between traffic sharing and blocking probability based on Markov using MATLAB tools with initial probability values. The study reflects shouting results compared to I&II models using one and two attempts. The success ratio of the first model is 84.5%, and that of the second is 90.6% to complete the call, whereas models using three and four attempts have 94.95% and 95.12% respectively to complete the call.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.250-257
• /
• 2003

As the memory access time becomes slower relative to the fast processor speed, most systems use cache memory to reduce the gap. The cache performance has an increasingly large impact on the performance of algorithms. Blocking is the well known method to utilize cache and has shown good results in multiplying matrices and search trees like d-heap. But if we use blocking in the data structures which require rotation during insertion or deletion, the execution time increases as the data movements between blocks are necessary. In this paper, we have proposed the extended pairing heap algorithms using block node and shown by experiments that our structure is superior Also in case of using block node, we use less memory space as the number of pointers decreases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.68-86
• /
• 2015

Future wireless network aims to integrate different radio access networks (RANs) to provide a seamless access and service continuity. In this paper, a new resource denotation method is proposed in the WLAN and LTE heterogeneous networks based on a concept of spectral bandwidth mapping. This method simplifies the denotation of system resources and makes it possible to calculate system residual capacity, upon which an economic model-based network selection algorithm is designed in both under-loaded and over-loaded scenarios in the heterogeneous networks. The simulation results show that this algorithm achieves better performance than the utility function-based access selection (UFAS) method proposed in [12] in increasing system capacity and system revenue, achieving load balancing and reducing the new call blocking probability in the heterogeneous networks.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.135-142
• /
• 2008

Recently, the mobile Internet is rapidly changing environment in a user's web server performance requires frequent connection is difficult because the proper response is needed to improve the performance of web services engine. Therefore, the goal of this paper is to improve the performance of web services for the installation of additional access to users regardless of tomcat servlet container and process the request and to shorten processing time of SOAP (Simple Object Access Protocol) message of the server structure to of for web mobile services. The web-sever structure is consists of user demand receiver, web document processor, SOAP protocol processor, NBTM(Non-Blocking and Thread Manager) manager, session manager. The system fully supports a standard web-service protocol, reduces the message processing time and communication overhead of mobile web-service system in Web 2.0 and overhead of server, and confirms the improvement of capability by comparing and evaluating Web 2.0 standard mobile web-service system through delaying achievement evaluation by the experiment of realization in Web 2.0 environment.