• Title/Summary/Keyword: 도착지

Search Result 605, Processing Time 0.035 seconds

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

Adaptive Antenna Array for DOA Estimation Utilizing Orthogonal Weight Searching (직교가중치 탐색방법을 이용한 도착방향 추정 적응어레이 안테나)

  • 오정호;최승원;이현배;황영준
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.8 no.2
    • /
    • pp.116-125
    • /
    • 1997
  • This paper presents a novel method, entitled Orthogonal Weights Searching(OWS), for the Direction-Of-Arrival(DOA) estimation. Utilizing the modified Conjugate Gradient Method(MCGM), the weight vector which is orthogonal to the signal subspace is directly computed from the signal matrix. The proposed method does not require the computation of the eigenvalues and eigenvectors. In addition, the new technique excludes the procedure for the detection of the number of signals under the assumption that the number of weights in the array is greater than the number of input signals. Since the proposed technique can be performed independently of the detection procedure, it shows a good performance in adverse signal environments in which the detection of the number of array inputs cannot be obtained successfully. The performance of the proposed technique is compared with that of the convectional eigen-decomposition method in terms of angle resolution for a given signal-to-noise ratio(SNR) and a required amount of computations.

  • PDF

Construction of e-Emergency Service System Infrastructure in Busan Metropolitan City (부산광역시 e-응급서비스시스템 인프라 구축)

  • Kim, Hyung-Hoi;Cho, Hune;Kim, Hwa-Sun;Cho, Suck-Ju
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.9
    • /
    • pp.1267-1276
    • /
    • 2008
  • The time taken for an ischemic heart disease patient to have a percutaneous coronary intervention because of acute myocardial infarction after arriving at the hospitals (door-to-balloon time) affects the patient's mortality significantly. To improve the emergency service system that has been previously used in the hospitals, this study focused on reducing door-data time and data-to-decision time among three time stages. The newly established e-emergency service system has set up the database of patients that had an emergency operation for acute myocardial infarction in the emergency service system of the hospital and has issued health cards for the patients that regularly visit the Busan National University Hospital. In addition, it has stored prior operation permits in the form of a certified electronic document. The new electronic system will reduce the complex treatment and operation procedures innovatively. Therefore, it is expected that this will make the life save (or the emergency patients easier and reduce the mortality. Moreover, it will also settle down the hospital staff's and patients' predicaments caused by the complex procedure of the legacy system.

  • PDF

Effect of Multiple Antennas at a Relay Node on the Performance of Physical-Layer Network Coding in Two-Way Relay Channel (양방향 중계채널에서 중계기 다중안테나가 물리계층네트워크 코딩의 성능에 미치는 영향)

  • Park, Jeonghong;Jung, Bang Chul;Ban, Tae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.8
    • /
    • pp.1438-1443
    • /
    • 2016
  • In this paper, we investigate the effect of multiple antennas at a relay node on the performance of physical-layer network coding (PNC) in the two-way relay channel (TWRC). We assume that two source nodes have a single antenna and the relay node has multiple antennas. We extend the conventional TWRC environment with a signle antenna at both relay and source nodes to the case of multiple antennas at the relay node. In particular, we consider two decoding strategies: separate decoding (SD) and direct decoding (DD). The SD decodes each packet from the two sources and performs the network coding with bit-wise exclusive OR (XOR) operation, while the DD decodes the network-coded packet from the two sources. Note that both decoding strategies are based on log-likelihood ratio (LLR) computation. It is shown that the bit error rate (BER) performance becomes significantly improved as the number of antennas at the relay node.

Analysis of an M/M/1 Queue with an Attached Continuous-type (s,S)-inventory ((s,S)-정책하의 연속형 내부재고를 갖는 M/M/1 대기행렬모형 분석)

  • Park, Jinsoo;Lee, Hyeon Geun;Kim, Jong Hyeon;Yun, Eun Hyeuk;Baek, Jung Woo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.23 no.5
    • /
    • pp.19-32
    • /
    • 2018
  • This study focuses on an M/M/1 queue with an attached continuous-type inventory. The customers arrive into the system according to the Poisson process, and are served in their arrival order; i.e., first-come-first-served. The service times are assumed to be independent and identically distributed exponential random variable. At a service completion epoch, the customer consumes a random amount of inventory. The inventory is controlled by the traditional (s, S)-inventory policy with a generally distributed lead time. A customer that arrives during a stock-out period assumed to be lost. For the number of customers and the inventory size, we derive a product-form stationary joint probability distribution and provide some numerical examples. Besides, an operational strategy for the inventory that minimizes the long-term cost will also be discussed.

Precision Time Synchronization System over Wireless Networks for TDOA-based Real Time Locating Systems (TDOA 기반의 실시간 위치 측정 시스템을 위한 정밀 무선 시각 동기 시스템)

  • Cho, Hyun-Tae;Jung, Yeon-Su;Jang, Hyun-Sung;Park, In-Gu;Baek, Yun-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1B
    • /
    • pp.86-97
    • /
    • 2009
  • RTLS is a system for automatically locating and tracking people and objects. The TDOA-based RTLS determines the location of the tag by calculating the time differences of a signal received from the tag. In TDOA-based RTLS, time synchronization is essential to calculate the time difference between readers. This paper presents a precision time synchronization method for TDOA-based RTLS over IEEE 802.15.4. In order to achieve precision time synchronization in IEEE 802.15.4 radio, we analyzed the error factors of delay and jitter. We also deal with the implementation of hardware assisted time stamping and the Kalman filtering method to minimize the error factors. In addition, this paper described the experiments and performance evaluation of the proposed precision time synchronization method in IEEE 802.15.4 radio. The results show that the nodes in a network can maintain their clocks to within 10 nanoseconds offset from the reference clock.

Analysis of Discrete-Time Geo/G/1 Queues under Workload Control and Multiple Vacations (일량제어정책과 복수휴가를 갖는 이산시간 Geo/G/1 대기행렬의 분석)

  • Lee, Se Won
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.23 no.2
    • /
    • pp.29-39
    • /
    • 2018
  • In this paper, we discuss a discrete-time queueing system with dyadic server control policy that combines workload control and multiple vacations. Customers arrive at the system with Bernoulli arrival process. If there is no customer to serve in the system, an idle single server spends a vacation of discrete random variable V and returns. The server repeats the vacation until the total service time of waiting customers exceeds the predetermined workload threshold D. In this paper, we derived the steady-state workload distribution of a discrete-time queueing system which is operating under a more realistic and flexible server control policy. Mean workload is also derived as a performance measure. The results are basis for the analysis of system performance measures such as queue lengths, waiting time, and sojourn time.

Design and Implementation of AR-based Notification View System at Subway Arrival Stations (증강현실 기반의 지하철 도착역 알림 View 시스템의 설계 및 구현)

  • Lee, Ki-Young;Kim, Sung-Bae;Kwak, Yun-Seol;Kim, Hee-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.135-140
    • /
    • 2013
  • With the advent of smart phones recently, users have experienced a new way of communicating using a smart phone without the constraints of time and space. As a result, users are ubiquitous around the user's own resources and a variety of natural interaction that was required. In particular, the interaction between the user and the content in the virtual reality and augmented reality, otherwise your content or service in the real world and the virtual direct and intuitive interaction can be. In this paper, we use Augmented Reality smart-phone sitting in the subway system that allows people to know the arrival station is designed to offer.

Busy Period Analysis of an M/G/1/K Queue with the Queue-Length-Dependent Overload Control Policy (고객수 기반의 오버로드 제어 정책이 있는 M/G/1/K 대기행렬의 바쁜기간 분석)

  • Lim, Heonsang;Lim, Dae-Eun
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.3
    • /
    • pp.45-52
    • /
    • 2018
  • We consider the busy period of an M/G/1/K queueing system with queue-length-dependent overload control policy. A variant of an oscillating control strategy that was recently analyzed by Choi and Kim (2016) is considered: two threshold values, $L_1({\leq_-}L_2)$ and $L_2({\leq_-}K)$, are assumed, and service rate and arrival rate are adjusted depending on the queue length to alleviate congestion. We investigate the busy period of an M/G/1/K queue with two overload control policies, and present the formulae to obtain the expected length of a busy period for each control policy. Based on the numerical examples, we conclude that the variability and expected value of the service time distribution have the most influence on the length of a busy period.

LMS-Wiener Model for Resources Prediction of Handoff Calls in Multimedia Wireless IP Networks (멀티미디어 무선 IP 망에서 핸드오프 호의 자원예측을 위한 LMS-위너 모델)

  • Lee, Jin-Yi;Lee, Kwang-Hyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.2A
    • /
    • pp.26-33
    • /
    • 2005
  • Exact prediction of resource demands for future calls enhances the efficiency of the limited resource utilization in resource reservation methods for potential calls in wireless IP networks. In this paper, we propose a LMS-Wiener resource(bandwidth) prediction for future handoff calls, and then an the proposed method is compared with an existing Wiener-based method in terms of prediction error through our simulations. In our simulations, we assume that handoff call arrivals follow a non-Poisson process and each handoff call has an non-exponentially distributed channel holdingtime in the cell, considering that handoff call arrival pattern is not Poisson distribution but non-Poisson for long periods of time in wireless picocellular IP networks. Simulation results show that the prediction error in the proposed method converges to the lower value while in an existing method increase as time is passed. Therefore we may conclude that the proposed method improves the efficiency of resource utilization by more exactly predicting resource demands for future handoff calls than an existing method.