• Title, Summary, Keyword: distributional Little's Law

Search Result 4, Processing Time 0.026 seconds

On the Discrete-Time Version of the Distributional Little's Law (이산시간 대기행렬시스템에 대한 분포적 Little의 법칙의 활용)

  • Kim, Nam-Ki;Chae, Kyung-Chul
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.4
    • /
    • pp.374-378
    • /
    • 2001
  • We present a discrete-time version of the distributional Little's law, of which the continuous-time version is well known. Then we extend it to the queue in which two or more customers may depart at the same time. As a demonstration, we apply this law to various discrete-time queues such as the standard Geom/G/1 queue, the Geom/G/1 queue with vacations, the multi-server Geom/D/c queue, and the bulk-service Geom/$G^b$/1 queue. As a result, we obtain the probability generating functions of the numbers in system/queue and the waiting times in system/queue for those queues.

  • PDF

D-MAP 도착과정을 갖는 이산시간 대기행렬모형에서의 분포적 Little의 법칙과 D-MAP/D/c 모형에의 응용

  • Kim Nam-Gi
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • /
    • pp.1101-1103
    • /
    • 2006
  • For a broad class of discrete-time FIFO queueing systems with D-MAP (discrete-time Markovian arrival process) arrivals, we present a distributional Little's law that relates the distribution of the stationary number of customers in system (queue) with that of the stationary number of slots a customer spends in system (queue). Taking the multi-server D-MAP/D/c queue for example, we illustrate how to utilize this relation to get the desired distribution of the number of customers.

  • PDF

A simple computational procedure to obtain the queue-length distribution of the discrete-time GI/G/1 queue

  • Kim, Nam-Ki
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • /
    • pp.1129-1132
    • /
    • 2005
  • Based on a discrete-time version of the distributional Little's law, we present a simple computational procedure to obtain the queue-length distribution of the discrete-time GI/G/1 queue from its waiting-time distribution that is available by various existing methods. We also discuss our numerical experience and address a couple of remarks on possible extensions of the procedure.

  • PDF

Study on Context-Aware SOA based on Open Service Gateway initiative platform (OSGi플렛폼 기반의 상황인식 서비스지향아키텍쳐에 관한 연구)

  • Choi, Sung-Wook;Oh, Am-Suk;Kwon, Oh-Hyun;Kang, Si-Hyeob;Hong, Soon-Goo;Choi, Hyun-Rim
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.11
    • /
    • pp.2083-2090
    • /
    • 2006
  • In an proposed Context-Aware SOA(Service Oriented Architecture) based OSGi(Open Service Gateway initiative) platform, Service provider manages relative kinds of services in an integrative basis from various sensors, puts each service in a SOAP (Simple Object access Protocol) message, and register thorn to the UDDI(Universal Description Discovery and Integration) server of service registry, service requester retrivel the specified kinds of services and call them to service provider. Recently most context-aware technologies for ubiquitous home network are mainly putting emphasis on RFID/USN and location-based technology. Because of this, service-oriented architecture researches have not been made enough. Under the environment of an OSGi service platform, various context-aware services are dynamically mapping from various sensors, new services are being offered for the asking of users, and existing services are changing. Accordingly, the data sharing between services provided, management of service life cycle, and the facilitation of service distribution are needed. Taking into considering all these factors, this study has suggested an Context-Aware SOA based eclipse SOA Tools Platform using OSGi platform that can transaction throughtput of more than 546 TPS of distributional Little's Law from ATAM(Architecture Tradeoff Analysis Method) while remaining stable other condition.