• Title/Summary/Keyword: Synchronization algorithm

Search Result 525, Processing Time 0.027 seconds

Active Congestion Control Using Active Router′s Feedback Mechanism (액티브 라우터의 피드백 메커니즘을 이용한 혼잡제어 기법)

  • Choe, Gi-Hyeon;Jang, Gyeong-Su;Sin, Ho-Jin;Sin, Dong-Ryeol
    • The KIPS Transactions:PartC
    • /
    • v.9C no.4
    • /
    • pp.513-522
    • /
    • 2002
  • Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization which TCP congestion window size is fluctuated during congestion occurred and if RTT (Round Trip Time) is increased, three duplicate ACK packets is not a correct congestion signal because congestion maybe already disappeared and the host may send more packets until receive the three duplicate ACK packets. Recently there is increasing interest in solving end-to-end congestion control using active network frameworks to improve the performance of TCP protocols. ACC (Active congestion control) is a variation of TCP-based congestion control with queue management In addition traffic modifications nay begin at the congested router (active router) so that ACC will respond more quickly to congestion than TCP variants. The advantage of this method is that the host uses the information provided by the active routers as well as the end points in order to relieve congestion and improve throughput. In this paper, we model enhanced ACC, provide its algorithm which control the congestion by using information in core networks and communications between active routers, and finally demonstrate enhanced performance by simulation.

Throughput Performance of Slotted ALOHA Communication System with Guard Time and Capture Effect (신호점유 현상과 보호시간을 고려한 슬롯형 알로아 통신 시스템의 성능분석)

  • 이현구;곽경섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.7
    • /
    • pp.989-998
    • /
    • 1993
  • In a bursty user traffic mode, ALOHA random multiple access protocol achieves higher performance than any conventional fixed assignment technique. One of central problems in slotted ALOHA is synchronization. Because of the long propagation delay in satellite mobile communication, packet may be spilt over into adjacent slots and thus guard time may be included between packet intervals. In conventional ALOHA channels, simultaneous transmission by two or more users results in a collision : the unsuccessful packets have to be retransmitted according to some retransmission algorithm. However, in a radio environment, users are often at different distances from the receiver : therefore, their received signals have substantially different power levels. The packet arriving with the highest energy now has a good chance of being detected accurately. Similarly, in some spread-spectrum random access systems, the earliest arriving packet dominates later arriving packets and thus captures the channel. In this paper slotted ALOHA channel with non zero guard time and capture probability is studied. Using the Markovian model, the performance of slotted ALOHA with guard time and capture effects is derived and compared with that of the conventional ALOHA via numerical analysis.

  • PDF

IQ Unbalance Compensation for OPDM Based Wireless LANs (무선랜 시스템에서의 IQ 부정합 보상 기법 연구)

  • Kim, Ji-Ho;Jung, Yun-Ho;Kim, Jae-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.905-912
    • /
    • 2007
  • This paper proposes an efficient estimation and compensation scheme of IQ imbalance for OFDM-based WLAN systems in the presence of symbol timing error. Since the conventional scheme assumes perfect time synchronization, the criterion of the scheme used to derive the estimation of IQ imbalance is inadequate in the presence of the symbol timing error and the system performance is seriously degraded. New criterion and compensation scheme considering the effect of symbol timing error are proposed. With the proposed scheme, the IQ imbalance can be almost perfectly eliminated in the presence of symbol timing error. The bit error rate performance of the proposed scheme is evaluated by the simulation. In case of 54 Mbps transmission mode in IEEE 802.11a system, the proposed scheme achieves a SNR gain of 4.3dB at $BER=2{\cdot}10^{-3}$. The proposed compensation algorithm of IQ imbalance is implemented using Verilog HDL and verified. The proposed IQ imbalance compensator is composed of 74K logic gates and 6K bits memory from the synthesis result using 0.18um CMOS technology.

Fast Neighbor Discovery for IEEE 802.11s based Mobile Mesh Node (IEEE 802.11s 기반 이동형 메쉬 노드를 위한 빠른 이웃노드탐색 기법)

  • Song, Byeong-Gu;Kim, Jong-Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.9
    • /
    • pp.1873-1882
    • /
    • 2009
  • In the ad-hoc mode of IEEE 802.11 standard, beacon is used for power control and network alarming between each node, and also it is for the synchronization in controlling network as PCF. However beacon is also used to inform the neighbor nodes of itself except for original purpose in the environment of IEEE 802.11s. For this, the existing beacon's transmission mechanism can't perform a function in full. In this paper, we suggest much faster neighbor discovery reducing network congestion caused by beacon through modification of beacon transmission mechanism. And we will show that suggesting algorithm more faster full neighbor discovery than traditional neighbor discovery using for IEEE 802.11 through simulation and test in real ad-hoc network.

An Available Orthogonal Training Signal in Wireless Communication System (무선통신 시스템에 적용 가능한 직교 훈련신호)

  • Lee, Hyeong-woo;Cho, Hyung-rae;Kim, Ki-man;Son, Yun-joon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.5
    • /
    • pp.30-37
    • /
    • 2015
  • The study for enhancing the data transmission rate of the next generation wireless communication system using MIMO system operating in the frequency selective fading environment is currently actively conducted. Mixed signal from each transmitted antennas are received at antennas. The training signal with orthogonal property is needed to separate the mixed signal and enable to estimate channel and time synchronization. In this paper we introduce several training sequences used in MIMO communication system and proposed the modified WeCAN sequence with good auto-correlation property in interested area. We compared auto-correlation property of each sequence via simulation and compared the performance of sequences in doppler shift and multipath fading channel.

An Efficient Data Structure for Queuing Jobs in Dynamic Priority Scheduling under the Stack Resource Policy (Stack Resource Policy를 사용하는 동적 우선순위 스케줄링에서 작업 큐잉을 위한 효율적인 자료구조)

  • Han Sang-Chul;Park Moon-Ju;Cho Yoo-Kun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.6
    • /
    • pp.337-343
    • /
    • 2006
  • The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.

A synchronous/asynchronous hybrid parallel method for some eigenvalue problems on distributed systems

  • 박필성
    • Proceedings of the Korean Society of Computational and Applied Mathematics Conference
    • /
    • 2003.09a
    • /
    • pp.11-11
    • /
    • 2003
  • 오늘날 단일 슈퍼컴퓨터로는 처리가 불가능한 거대한 문제들의 해법이 시도되고 있는데, 이들은 지리적으로 분산된 슈퍼컴퓨터, 데이터베이스, 과학장비 및 디스플레이 장치 등을 초고속 통신망으로 연결한 GRID 환경에서 효과적으로 실행시킬 수 있다. GRID는 1990년대 중반 과학 및 공학용 분산 컴퓨팅의 연구 과정에서 등장한 것으로, 점차 응용분야가 넓어지고 있다. 그러나 GRID 같은 분산 환경은 기존의 단일 병렬 시스템과는 많은 점에서 다르며 이전의 기술들을 그대로 적용하기에는 무리가 있다. 기존 병렬 시스템에서는 주로 동기 알고리즘(synchronous algorithm)이 사용되는데, 직렬 연산과 같은 결과를 얻기 위해 동기화(synchronization)가 필요하며, 부하 균형이 필수적이다. 그러나 부하 균형은 이질 클러스터(heterogeneous cluster)처럼 프로세서들의 성능이 서로 다르거나, 지리적으로 분산된 계산자원을 사용하는 GRID 환경에서는 이기종의 문제뿐 아니라 네트워크를 통한 메시지의 전송 지연 등으로 유휴시간이 길어질 수밖에 없다. 이처럼 동기화의 필요성에 의한 연산의 지연을 해결하는 하나의 방안으로 비동기 반복법(asynchronous iteration)이 나왔으며, 지금도 활발히 연구되고 있다. 이는 알고리즘의 동기점을 가능한 한 제거함으로써 빠른 프로세서의 유휴 시간을 줄이는 것이 목적이다. 즉 비동기 알고리즘에서는, 각 프로세서는 다른 프로세서로부터 갱신된 데이터가 올 때까지 기다리지 않고 계속 다음 작업을 수행해 나간다. 따라서 동시에 갱신된 데이터를 교환한 후 다음 단계로 진행하는 동기 알고리즘에 비해, 미처 갱신되지 않은 데이터를 사용하는 경우가 많으므로 전체적으로는 연산량 대비의 수렴 속도는 느릴 수 있다 그러나 각 프로세서는 거의 유휴 시간이 없이 연산을 수행하므로 wall clock time은 동기 알고리즘보다 적게 걸리며, 때로는 50%까지 빠른 결과도 보고되고 있다 그러나 현재까지의 연구는 모두 어떤 수렴조건을 만족하는 선형 시스템의 해법에 국한되어 있으며 비교적 구현하기 쉬운 공유 메모리 시스템에서의 연구만 보고되어 있다. 본 연구에서는 행렬의 주요 고유쌍을 구하는 데 있어 비동기 반복법의 적용 가능성을 타진하기 위해 우선 이론적으로 단순한 멱승법을 사용하여 실험하였고 그 결과 순수한 비동기 반복법은 수렴하기 어렵다는 결론을 얻었다 그리하여 동기 알고리즘에 비동기적 요소를 추가한 혼합 병렬 알고리즘을 제안하고, MPI(Message Passing Interface)를 사용하여 수원대학교의 Hydra cluster에서 구현하였다. 그 결과 특정 노드의 성능이 다른 것에 비해 현저하게 떨어질 때 전체적인 알고리즘의 수렴 속도가 떨어지는 것을 상당히 완화할 수 있음이 밝혀졌다.

  • PDF

A Priority-based Feedback Control Mechanism for Scalability (확장적 우선 순위 피드백 제어 기법)

  • 정상운;정원창;김상복
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.3
    • /
    • pp.339-346
    • /
    • 1999
  • When a multicast video conference system utilizes RTP (Real Time Protocol) and RTCP (Real Time Control Protocol), the loss rate and the synchronization of transfer in RTCP affect the scalability of the system. The random delay technique introduced to resolve the problems is so simple that leads the network to meet some congestion in synchronizing feedback information when lots of people transfer the feedback information simultaneously, which reduces the scalability of system. In this paper, we propose a new feedback control algorithm that provides priority levels with the RTCP packet, which cuts down the feedback delay and increases the scalability. The criteria of providing priority Based on the decided priority level, Agent forced the session participants to provide much more RTCP packets, positively controlled, and the possible bandwidth can be measured. The simulation on this technique decreases the delay, and the feedback messages are equally distributed on a given time period.

  • PDF

Indoor Localization Scheme of a Mobile Robot Applying REID Technology (RFID 응용 기술을 이용한 이동 로봇의 실내 위치 추정)

  • Kim Sung-Bu;Lee Dong-Hui;Lee Jang-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.12
    • /
    • pp.996-1001
    • /
    • 2005
  • Recently, with the development of service robots and with the new concept of ubiquitous world, the position estimation of mobile objects has been raised to an important problem. As pre-liminary research results, some of the localization schemes are introduced, which provide the relative location of the moving objects subjected to accumulated errors. To implement a real time localization system, a new absolute position estimation method for a mobile robot in indoor environment is proposed in this paper. Design and implementation of the localization system comes from the usage of active beacon systems (based upon RFID technology). The active beacon system is composed of an RFID receiver and an ultra-sonic transmitter: 1. The RFID receiver gets the synchronization signal from the mobile robot and 2. The ultra-sonic transmitter sends out the traveling signal to be used for measuring the distance. Position of a mobile robot in a three dimensional space can be calculated basically from the distance information from. Three beacons and the absolute position information of the beacons themselves. In some case, the mobile robot can get the ultrasonic signals from only one or two beacons, because of the obstacles located along the moving path. Therefore, in this paper, as one of our dedicated contribution, the position estimation scheme with less than three sensors has been developed. Also, the extended Kalman filter algorithm is applied for the improvement of position estimation accuracy of the mobile robot.

T-DMB Automatic Emergency Alerting Service by Estimating the Location of Receiver (단말기 위치 자동 인식을 이용한 T-DMB 자동재난경보서비스)

  • Kwon, Seong-Geun;Lee, Suk-Hwan;Kim, Kang-Wook;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.5
    • /
    • pp.615-623
    • /
    • 2012
  • This paper presents T-DMB AEAS (automatic emergency alerting service) receiver model considering emergency region. The proposed receiver model determines the geographical location of the terminal by analysing the received T-DMB signal and displays the AEAS messages only if the location of terminal is similar to the emergency site. First, to determine the geographical location of the terminal, we extract the TII value from the null symbol of the SC and, based on it, calculate the location of transmitter by analysing FIG 0/22 delivering the TII-related data. The proposed algorithm sets the location of transmitter as that of receiver and displays the emergency message only in the case of the similar region. The experiment was conducted in the test environment of low power T-DMB generator based on the T-DMB AEAS messages.