• Title/Summary/Keyword: M/M/s Queueing Model

Search Result 29, Processing Time 0.017 seconds

A Study on Threshold-based Admission Control Algorithm for Multicast Service (멀티캐스트 서비스 환경에서 역치 기반의 연결 수락 제어 방안 연구)

  • Jo Seng Kyoun;Choi Seong Gon;Lee Jong Min;Choi Jun Kyun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.1-8
    • /
    • 2005
  • In this paper, we study a call admission control algorithm for supporting multicast service under the BcN environment where broadcasting, communication and Internet are converging to be one. It is necessary to control service requests with a certain criteria in order to guarantee QoS because the system capacity is limited. As a possible solution, we divide one multicast service into 3 classes and set up a threshold per each class to control service request. Especially, for the purpose of system benefit, we define system pay-off rate 'GAIN' with the term 'Reward' and 'Penalty' according to admit and reject service request. And we confine the range of threshold which makes GAIN to be maximized. For the performance analysis, we model the system as M/M/m/m queueing system, investigate GAIN under various conditions and show the effectiveness of the proposed algorithm.

Performance Analysis of AAL2 Packet Dropping Algorithm using PDV on Virtual Buffer (PDV를 이용한 가상 버퍼상의 AAL2 패킷 폐기 알고리즘과 성능분석)

  • Jeong, Da-Wi;Jo, Yeong-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.1
    • /
    • pp.20-33
    • /
    • 2002
  • Usage of ATM AAL2 packets becomes dominant to increase transmission efficiency of voice traffic in the backbone network. In case of voice service that uses AAL2 mechanism, if resources of network are enough, connection of new call is accepted. However, due to packets generated by the new call, transmission delay of packets from old calls can increase sharply. To control this behavior, in this paper we present an AAL2 buffer management scheme that allocates a virtual buffer to each call and after calculating its propagation delay variation(PDV), decides to drop packets coming from each call according to the PDV value. We show that this packet dropping algorithm can effectively prevent abrupt QoS degradation of old calls. To do this, we analyze AAL2 packet composition process to find a critical factor in the process that influences the end-to-end delay behavior and model the process by K-policy M/D/1 queueing system and MIN(K, Tc)-policy M/D/1 queueing system. From the mathematical model, we derive the probability generating function of AAL2 packets in the buffer and mean waiting time of packets in the AAL2 buffer. Analytical results show that the AAL2 packet dropping algorithm can provide stable AAL2 packetization delay and ATM cell generation time even if the number of voice sources increases dramatically. Finally we compare the analytical result to simulation data obtained by using the COMNET Ⅲ package.

A MIrcroscopic Application of the Little's Formula (Little's 법칙의 미시적 활용 사례)

  • Yoon, Bong-K.;Kim, Nam-K.;Chae, Kyung-C.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.1
    • /
    • pp.125-129
    • /
    • 1999
  • The Little's formula, $L={\lambda}W$, expresses a fundamental principle of queueing theory: Under very general conditions, the average queue length is equal to the product of the arrival rate and the average waiting time. This useful formula is now well known and frequently applied. In this paper, we demonstrate that the Little's formula has much more power than was previously realized when it is properly decomposed into what we call the microscopic Little's formula. We use the M/G/1 queue with server vacations as an example model to which we apply the microscopic Little's formula. As a result, we obtain a transform-free expression for the queue length distribution. Also, we briefly summarize some previous efforts in the literature to increase the power of the Little's formula.

  • PDF

Resource Management System for Multimedia Service in Wireless Mobile Networks (무선 이동 통신망에서의 멀티미디어 서비스를 위한 자원 제어 시스템)

  • Lee, Won-Yeoul
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.9
    • /
    • pp.1153-1164
    • /
    • 2007
  • One of the most challenging technical issues in mobile communication for multimedia is Quality of Service (QoS) management of handover calls. This paper proposes a 2-level handover control system to copy with this problem. A 2-level handover control system consists of resource reservation and call admission control modules. The resource reservation module divides the network resource into Hard and Soft reserved resource. The Hard reserved resource is only for the handover calls while the Soft reserved resource is for both the handovers and the new calls. And also, the resource reservation module classifies handovers into primary and secondary handovers based on often they occur. The call admission control module deals with the primary and secondary handover calls in different ways. The new calls can use Soft reserved resource only if there is sufficient amount available in the Hard reserved resource. Proposed system is evaluated using an M/M/c/c queueing model. It is shown that proposed system allows more efficient utilization of network resource without degrading QoS comparing with the legacy handover control systems.

  • PDF

A study on the capacity analysis of wide area radio trunking system (광역 무선 Trunking 시스템의 통신용량 분석에 관한 연구)

  • 김낙명
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.4
    • /
    • pp.1-11
    • /
    • 1997
  • In this paper, modeling of the communication channel occupancy characteristics at the base station in the wide area radio trunking syste has been performed. Using the results, mathematical analysis for the switching capacity at the network switch has also been done. Specificatlly, we propose a G/M/m queueing model for the single service area modeling, and analyze changes in call blockingprobabilities accoridng to changes in the burstness characteristics of group paging calls. As a result, we have observe dthat the channel occupancy variations become larger as the burstness characteristics become more apparent, to make the call blocking probability higher. Next, based on the single service area analysis, we have anayzed mathematically the average switching capacity required to serve mobile subscribers for a wide area radio trunking sytem, where multiple switching port assignments are required when the people in the same group are distributed over several base stations. Accordingly, we have observed that the average and the variance of switching channel occupancy are closely related to the mobility characteristics of subscribers, and that we need a netowrk switch having bigger capacity as subscribers show wider distribution. Especially, with the call dropping probability within 0.2%, a switch having about 5 to 6 times bigger can be required, compared with the one when the mobility of subscribers is mostly restricte dto a single service area.

  • PDF

An Analysis on the Optimal Level of the Maintenance Float Using Absorbing Markov Chain (흡수 마코프 체인을 활용한 적정 M/F 재고 수준에 관한 연구)

  • Kim, Yong;Yoon, Bong-Kyoo
    • Journal of the military operations research society of Korea
    • /
    • v.34 no.2
    • /
    • pp.163-174
    • /
    • 2008
  • The military is an organization where reliability and availability take much more importance than in any other organization. And, in line with a recent trend of putting emphasis on 'system readiness', not only functions but also availability of a weapon system has become one of achievement targets. In this regard, the military keeps spares for important facility and equipment, which is called as Maintenance Float (M/F), in order to enhance reliability and availability in case of an unforeseen event. The military has calculated yearly M/F requirements based on the number of equipment and utilization rate. However, this method of calculation has failed to meet the intended targets of reliability and availability due to lack of consideration on the characteristics of equipment malfunctions and maintenance unit's capability. In this research, we present an analysis model that can be used to determine an optimal M/F inventory level based on queuing and absorbed Markov chain theories. And, we applied the new analysis model to come out with an optimal volume of K-1 tank M/F for the OO division, which serves as counterattack military unit. In our view, this research is valuable because, while using more tractable methodology compared to previous research, we present a new analysis model that can describe decision making process on M/F level more satisfactorily.

The Optimal Distributed Database System Design Using the Genetic Algorithm (유전자 알고리즘을 이용한 최적의 분산 데이터베이스 시스템 설계)

  • Ko, Suc-Bum;Youn, Sung-Dae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.9
    • /
    • pp.2797-2806
    • /
    • 2000
  • Recently, DDSs(Distributed Database Systems) have been implemented on V AN(V alue Added Network) as we know the amazing expansion of information network. DDS can yield significant cost and response time advantages over centralized systems for geographically distributed organizations. However, inappropriate design can result in high cost and poor response time to maintain the database at each site. In a DDS design, the main problem is how to select proper computer and how to allocate data fragment into a proper site. In this paper, we address DDS design problem of selecting the proper class of computers and the allocating data files on VAN. Also, the formulated model includes two objectives, the waited response time and the investment cost to include their relationship. Specially, the formulation of waited response time is based on M/M/1 queueing system to evaluate more precisely. GA(Genetic Algorithm), a kind of heuristic search method, is developed to search an optimal solution in the proposed design model and we show the simulation result to examine the algorithm performance.

  • PDF

The Analysis of the Transportation Process of Mokpo Port (목포항 운송과정의 분석)

  • Nam, M.U.;Lee, C.Y.;Park, G.K.;Yun, M.O.
    • Journal of Korean Port Research
    • /
    • v.9 no.1
    • /
    • pp.33-43
    • /
    • 1995
  • Korean economic and industrial structure has been seperated into some areas with the trend of the change to the bloc system of international economy: the Gyeongin including the capital area, the Middle-West, the South-West, the South-East, and the Eastern sea areas. Mokpo port has played a major role as the central one of the South-West area and the entrance of Yeong-san river of Jeonnam province gate. Some studies has been done on the Mokpo port, but there is no research of the analytical approach about it. In this paper, we analyze the data of 1994's on the domestic and oceangoing piers in the Mokpo port and simulate the transportation process of it through a queueing model. The results of the simulation are summarized as follows: The average arrival interval of the domestic vessel is 6.034 hours. The average service time and the berth utility rate are 24.056 hours and over 100%, respectively. The average arrival interval of the oceangoing vessel is 34.48 hours. The average service time and the berth utility rate are 120.04 hours and the 34.91%, respectively. The proposal to improving of the Mokpo port as follows: It is desirable to extend the capacity of domestic pier to about 50% for the optimal utility rate of 70% and in the case of oceangoing pier to be increase 65% of the vessel capacity for the optimal utility rate of 70%.

  • PDF

A Dynamic Queue Manager for Optimizing the Resource and Performance of Mass-call based IN Services in Joint Wired and Wireless Networks (유무선 통합 망에서 대량호 지능망 서비스의 성능 및 자원 최적화를 위한 동적 큐 관리자)

  • 최한옥;안순신
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5B
    • /
    • pp.942-955
    • /
    • 2000
  • This paper proposes enhanced designs of global service logic and information flow for the mass-call based IN service, which increase call completion rates and optimize the resource in joint wired and wireless networks. In order to hanve this logic implemented, we design a Dynamic Queue Manager(DQM) applied to the call queuing service feature in the Service Control Point(SCP). In order to apply this logic to wireless service subscribers as well as wired service subscribers, the service registration flags between the Home Location Register(HLR) and the SCP are managed to notify the DQM of the corresponding service subscribers’ mobility. Hence, we present a dynamic queue management mechanism, which dynamically manages the service group and the queue size based on M/M/c/K queueing model as the wireless subscribers roam the service groups due to their mobility characteristics. In order to determine the queue size allocated by the DQM, we simulator and analyze the relationship between the number of the subscriber’s terminals and the drop rate by considering the service increment rate. The appropriate waiting time in the queue as required is simulated according to the above relationship. Moreover, we design and implement the DQM that includes internal service logic interacting with SIBs(Service Independent building Blocks) and its data structure.

  • PDF