• Title/Summary/Keyword: early arrival scheme

Search Result 7, Processing Time 0.019 seconds

MARKOVIAN EARLY ARRIVAL DISCRETE TIME JACKSON NETWORKS

  • Aboul-Hassan A.;Rabia S.I.
    • Journal of the Korean Statistical Society
    • /
    • v.35 no.3
    • /
    • pp.281-303
    • /
    • 2006
  • In an earlier work, we investigated the problem of using linear programming to bound performance measures in a discrete time Jackson network. There it was assumed that the system evolution is controlled by the early arrival scheme. This assumption implies that the system can't be modelled by a Markov chain. This problem was resolved and performance bounds were calculated. In the present work, we use a modification of the early arrival scheme (without corrupting it) in order to make the system evolves as a Markov chain. This modification enables us to obtain explicit expressions for certain moments that could not be calculated explicitly in the pure early arrival scheme setting. Moreover, this feature implies a reduction in the linear program size as well as the computation time. In addition, we obtained tighter bounds than those appeared before due to the new setting.

Financing Problem for an Early Retirement Scheme (조기은퇴제도를 위한 자금조달문제)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.3
    • /
    • pp.151-157
    • /
    • 2021
  • This paper deals with financing an early retirement scheme problem(FERSP) with minimum initial cash and filling up maximum financial interest. For this problem, Guéret et al. programming the Mosel, and Edvall merely realize the CPLEX Branch-and-Cut MIP Solver program to get the optimal solution. But there is no clear rule to finding the solution. This paper suggests calculation formula of bond number decision-making that the reverse from long arrival due date to short. Then we optimize and confirm the bonds number in accordance with continuative effect of the arrival due date. The shortage prepare with the principal and interest of one year deposit(saving) reversely calculation formula.

On the Modified Supplementary Variable Technique for the Discrete-Time GI/G/1/K Queue (이산시간 GI/G/1/K 대기행렬에 대한 수정부가변수법)

  • Chae, Kyung-Chul;Lee, Doo-Ho;Kim, Nam-Ki
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.1
    • /
    • pp.107-115
    • /
    • 2008
  • We consider the discrete-time GI/G/1/K queue under the early arrival system. Using a modified supplementary variable technique(SVT), we obtain the distribution of the steady-state queue length. Unlike the conventional SVT, the modified SVT yields transform-free results in such a form that a simple two-moment approximation scheme can be easily established.

Ecological Notes on Narcissus Flycatcher, Musciapa narcissina zanthopygia HAY - With special reference to the breeding process and feeding habits of nestlings during their nesting period- (흰눈섭황금새(Muscica narcissina zanthopygia HAY)의 생태-특히 번식경과와 육령기의 식습성)

  • WON, Pyong-Oh;RHEE, Kyung-Jho
    • The Korean Journal of Zoology
    • /
    • v.8 no.2
    • /
    • pp.89-127
    • /
    • 1965
  • 1. This report is on the outcome of observation made up the breeding process of Narcissus flycatcher, Muscicapa narcissina zanthopygia, using 15 ness-boxes at Seoul and Kwang Nung Experimental forest in 1964, and the relevant feeding habit was studied by the collar method of wrapping the necks of thenestlings for 50-60 minutes or more in some cases from 1963 to 1964. 2. The Narcissus flycatcheris a common summer resident throughout Korea arriving at the end of April. The earliest data of arrival of this species in Seoul, is April 26, 1964. They migrate southward from the later part of September to early part of October. 3. In a week after their arrival , they start to build nest after a brief courtship. Male and female prepare their nest ina nestboxes in 4 or 5 days. Nests are usually found in the moss, which provide definite frame-work. The inner side of the nest is usually composed of roots of Gramineae or leaves of pine, oak or other broad leave tree. 4. The laying period is generally from the later part of April to the middle of June : and the number of eggs laid is from 3 to 8 , therefore 5 in average : eggs are pink with traces of milky yellow blending of light auburn and orange red spots and chicken-egg-like in shape. 5.The incubation takes place for 7-12 days from the middle part of May to the middle of June, in the order of male and female . The hatching rate tends to increase in proportion to clutch size. 6. The feeding period usually lasts 15 days in average from the early part of June to the middle of July and the feeding urge tends to increase in proportion to brood size. 7. The animals invading into their nest-boxes are red ants, chipmunks, bees , barkbeetles and philippine red-tailed shirkes, etc. 8. On the basis of analysis covering 714 birds in 31 nests, the food they consumed during the nesting period of nestlings were mostly of animal matters composing of : insect larvae form-39. 88% insect adult form 36.26%, insect pupae-0.19%, spider-17.75% and other animal matters 5.92% , Besides a small amount of plant pieces were found . As to the insect larvae, Lepidoptera was the largest in the content followed by Hymenoptera , Orthoptera and Coleoptera. As to the insect adult, Diptera was the largest in the content followed by Coleoptera, and Hymenoptera. In view of forest protection, noxious insect was of 69.38%, useful insect 4.39%, and spider 17.75%. 9. The rich assortment of its food, the ability of acquiring various insect (adults as well as larvae), its destruction of great numbers of harmful insects , and its quick assimilation artificial nesting with the nest-boxes of 2.5-3cm entrance hole employed, allow us to conclude that the flycatcher may be successfully employed in the elimination of fores pests. The above results are only that part obtained near Seoul in the middle of Korea, however, if we would extend the scheme to other broad areas using similar techniques, the nest-boxes could not only be well used by the birds, but also it would help to prevent the increase of harmful. insects.

  • PDF

A Packet Dropping Algorithm based on Queue Management for Congestion Avoidance (폭주회피를 위한 큐 관리 기반의 패킷 탈락 알고리즘)

  • 이팔진;양진영
    • Journal of Internet Computing and Services
    • /
    • v.3 no.6
    • /
    • pp.43-51
    • /
    • 2002
  • In this paper, we study the new packet dropping scheme using an active queue management algorithm. Active queue management mechanisms differ from the traditional drop tail mechanism in that in a drop tail queue packets are dropped when the buffer overflows, while in active queue management mechanisms, packets may be dropped early before congestion occurs, However, it still incurs high packet loss ratio when the buffer size is not large enough, By detecting congestion and notifying only a randomly selected fraction of connection, RED causes to the global synchronization and fairness problem. And also, it is the biggest problem that the network traffic characteristics need to be known in order to find the optimum average queue length, We propose a new efficient packet dropping method based on the active queue management for congestion control. The proposed scheme uses the per-flow rate and fair share rate estimates. To this end, we present the estimation algorithm to compute the flow arrival rate and the link fair rate, We shows the proposed method improves the network performance because the traffic generated can not cause rapid fluctuations in queue lengths which result in packet loss

  • PDF

TCP Performance Analysis of Packet Buffering in Mobile IP based Networks (모바일 IP 네트워크에서 패킷 버퍼링 방식의 TCP 성능 분석)

  • 허경;노재성;조성준;엄두섭;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5B
    • /
    • pp.475-488
    • /
    • 2003
  • To prevent performance degradation of TCP due to packet losses in the smooth handoff by the route optimization extension of Mobile IP protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers those packets dropped during handoff by forwarding buffered packets at the old base station to the mobile user. But, when the mobile user moves to a congested base station in a new foreign subnetwork, those buffered packets forwarded by the old base station are dropped and TCP transmission performance of a mobile user in the congested base station degrades due to increased congestion by those forwarded burst packets. In this paper, considering the general case that a mobile user moves to a congested base station, we analyze the influence of packet buffering on TCP performance according to handoff arrival distribution for Drop-tail and RED (Random Early Detection) buffer management schemes. Simulation results show that RED scheme can reduce the congestion increased by those forwarded burst packets comparing Drop-Tail, but RED scheme cannot avoid Global Synchronization due to forwarded burst packets by the old base station and new buffer management scheme to avoid it is needed in Mobile IP based networks.

Field Application Analysis of Center Control Emergency Vehicle Preemption System (중앙제어방식 긴급자동차 우선신호 현장적용성 분석)

  • Lee, Young-Hyun;Han, Seung-Chun;Jeong, Do-Young;Kang, Jin-Dong
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.6
    • /
    • pp.137-154
    • /
    • 2019
  • This study analysed the center control emergency vehicle preemption[EVP] test result on the 1.782 km section around Gangbuk Fire Station. The pros and cons between center control and site control EVP was compared through the review of existing research. The test site was selected based on the higher link speed for choosing low congested area and 4 to 6 lane road. EVP operates green extension under the estimated arrival time to each intersection. This study is about EVP system field application and its evaluation by analyzing EVP operation result with the emergency vehicle's trace, GPS data. The impact on the surrounding traffic was analysed in delay from the queue length survey. Analysis showed the decrease in averge travel time 41.81%, but the increase in delay of surrounding traffic slightly. It is expected that EVP can be applied to the expanded area by researching EVP compensation scheme.