• Title/Summary/Keyword: 연결설정 지연

Search Result 89, Processing Time 0.023 seconds

A Threshold based Connectivity Enhancement Scheme for Mobile Ad-hoc Networks (MANET에서 경로 연속성 증대방안에 대한 연구)

  • Jang Yunchul;Park Sangioon;Kim Byunggi
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.215-219
    • /
    • 2005
  • Generally, the mobile nodes in MANET have the limited power capacity available for actual communications. Thus, the power management is very important for packet routing or forwarding. Although MTPR, MBCR and MMBCR are proposed to treat the problem of power consumption, there have been few researches resolving the link breakdown that is occurred by the power exhaustion during transmission. In this sense, the reliable scheme should be required to ensure the routing connectivity. In this paper, we propose three schemes to enforce the routing connectivity. If the signal strength is dropped below a signal threshold, the candidate route is previously selected to prepare the link breakdown. Also, on multi-channel, we propose the lifetime increment scheme of a node that it manage its available power to the needed power of a new link. The simulation results show the enforcement of the link connectivity and the performance improvements of the delay time through the effective connection management.

A Study on a Multi-path ATP Protocol at Ad-hoc Networks (Ad-hoc 네트워크에서 다중경로를 지원하는 ATP 프로토콜에 대한 연구)

  • Lee, Hak-Ju;Jang, Jae-Shin;Lee, Jong-Hyup
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.3
    • /
    • pp.123-131
    • /
    • 2009
  • Wireless networks have several unique features : node mobility, restricted bandwidth, time-variable bandwidth, large latency, and high bit error rates time due to channel fading. These features at wireless networks intend to decrease the performance TCP protocols are used in wireless networks. Lots of studies have been done for finding appropriate wireless transport protocols for current wireless communications. However, related studies have not provided good performance or some protocols have a good performance only in specific circumstances. Thus, these are not suitable for general wireless circumstance. Therefore, we propose a new wireless transport protocol which provides better performance than the previous ones. And we'd like to solve a problem that previous protocols cannot maintain their connections even though they have multiple paths until another path is successfully set up. To solve these problems, a new protocol ATP-M is proposed which is designed on already known TCP-M and ATP protocols. With NS-2 computer simulation, it is shown that this newly proposed protocol has better system throughput than TCP, TCP-M and ATP protocols.

Multiple Conference Servers Architecture using Extended Control Channel Framework (확장 제어 채널 프레임워크를 사용한 다중 컨퍼런스 서버 구조)

  • Jang, Choonseo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.7
    • /
    • pp.1335-1341
    • /
    • 2017
  • In this paper, a new architecture of multiple conference servers which use extended control channel framework in SIP(session initiation protocol) session has been presented. For this purpose, in this study, a new extended control channel framework architecture which can distribute total conference system loads to multiple servers effectively has been presented. In the implementation, extended control channels have been connected by using SIP sessions that was established between each conference servers, and extended control channel messages which can be transferred through control channels have been designed in this study. These extended control channel messages can distribute system load effectively between multiple conference servers, and conference information data format that can represent extended control channel framework has also been designed. Furthermore, exchange procedures of extended control channel messages have also been presented. The performance of the proposed system has been analysed by simulation. The analysis results show that average SIP messages delay time and average media stream delay time have improved.

Performance Analysis on Link Quality of Handover Mechanism based on the Terminal Mobility in Wired and Wireless Integrated Networks (유무선 복합망에서 이동 단말 기반 핸드오버의 링크 품질에 관한 성능 분석)

  • Park, Nam-Hun;Gwon, O-Jun;Kim, Yeong-Seon;Gam, Sang-Ha
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8S
    • /
    • pp.2608-2619
    • /
    • 2000
  • This paper proposes the Handover Scheme for the mobile and describes the result of the performance analysis. In the conventional scheme of handover request, the withdrawal of terminal may occur because handover request is performed based on fixed signal level without considering network load and terminal mobility. The proposed scheme offers the minimization of withdrawal and handover blocking probability by means of the handover request of terminal based on the network load and terminal mobility. Conventional handover scheme has the sequential procedure that network performs resource check and path rerouting on the handover by MT(Mobile Terminal). Proposed handover scheme pre-processes the resource check before the handover request by predicting the handover request timo so that handover latency can be reduced. Moreover, path optimization is executed after the completion of handover in order to reduce handover latency. The rdduction of handover latency prevents the dropping of service by minimizing backward handover blocking. In summary, we propose the prediction of handover request time and decision method based on terminal, validating the performance of proposed scheme considering various cases of simulation.

  • PDF

An ABR Service Traffic Control of Using feedback Control Information and Algorithm (피드백 제어 정보 및 알고리즘을 이용한 ABR 서비스 트래픽제어)

  • 이광옥;최길환;오창윤;배상현
    • Journal of Internet Computing and Services
    • /
    • v.3 no.3
    • /
    • pp.67-74
    • /
    • 2002
  • Asynchronous transfer mode (ATM) can be efficiently used to transport packet data services. The switching system will support voice and packet data services simultaneously from end to end applications. To guarantee quality of service (QoS) of the offered services, source rate to send packet data is needed to control the network overload condition. Most existing control algorithms are shown to provide the threshold-based feedback control technique. However, real-time voice calls can be dynamically connected and released during data services in the network. If the feedback control information delays, quality of the serviced voice can be degraded due to a time delay between source and destination in the high speed link, An adaptive algorithm based on the optimal least mean square error technique is presented for the predictive feedback control technique. The algorithm attempts to predict a future buffer size from weight (slope) adaptation of unknown functions, which are used for feedback control. Simulation results are presented, which show the effectiveness of the algorithm.

  • PDF

Performance Analysis for Call Processing in NGN Voice Services (NGN에서 음성서비스의 호 처리 성능해석)

  • 정문조;황찬식
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.11
    • /
    • pp.42-50
    • /
    • 2003
  • In this paper we propose a method of evaluating the performance of a Softswitch that provides call control to voice services in NGN (next generation network). First, we describe the architecture for voice services in NGN and anatomize the call control processes such as call initiation, call re-initiation and call release of a voice connection. kiter that we propose a method of estimating appropriate server capacity of the Softswitch using approximate queuing model. Via numerical experiments we illustrate the implication of the work

Adaptive Multipath Routing Algorithm for Low-power Lossy Networks (저전력 손실 네트워크에서의 적응형 다중경로 라우팅 알고리즘)

  • Kim, Seunghyun;Joung, Jinoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.2
    • /
    • pp.91-96
    • /
    • 2019
  • For a wireless sensor network in general, efficient routing decision is important because wireless connections are not stable, sensitive to external interference, and topology changes dynamically. RPL standard of IETF is not flexible to various environmental changes and causes packet loss and delay due to topological imbalance. Sending packets through multipath can partially remedy this problem. The multipath routing, however, can introduce significant delay overhead by allocating unnecessary timeslots. This paper proposes an RPL using multipath adaptively according to network conditions. We show by simulations that the proposed algorithm is more efficient than the basic RPL and the multipath RPL.

Minimizing Security Hole and Improving Performance in Stateful Inspection for TCP Connections (TCP연결의 스테이트풀 인스펙션에 있어서의 보안 약점 최소화 및 성능 향상 방법)

  • Kim, Hyo-Gon;Kang, In-Hye
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.4
    • /
    • pp.443-451
    • /
    • 2005
  • Stateful inspection devices must maintain flow information. These devices create the flow information also for network attack packets, and it can fatally inflate the dynamic memory allocation on stateful inspection devices under network attacks. The memory inflation leads to memory overflow and subsequent performance degradation. In this paper, we present a guideline to set the flow entry timeout for a stateful inspection device to remove harmful embryonic entries created by network attacks. Considering Transmission Control Protocol (TCP) if utilized by most of these attacks as well as legitimate traffic, we propose a parsimonious memory management guideline based on the design of the TCP and the analysis of real-life Internet traces. In particular, we demonstrate that for all practical purposes one should not reserve memory for an embryonic TCP connection with more than (R+T) seconds of inactivity where R=0, 3, 9 and $1\leqq{T}\leqq{2}$ depending on the load level.

Design of a Correlator and an Access-code Generator for Bluetooth Baseband (블루투스 기저대역을 위한 상관기와 액세스 코드 생성 모듈의 설계)

  • Hwang Sun-Won;Lee Sang-Hoon;Shin Wee-Jae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.6 no.4
    • /
    • pp.206-211
    • /
    • 2005
  • We describe the design for a correlator and an access code generator in bluetooth system. These are used for a connection setting, a packet decision and a clock synchronization between Bluetooth units. The correlator consists of two blocks; carry save adder based on Wallace tree and threshold-value decision block. It determines on an useful packet and clock-synchronization for input signal of 1.0Mbps through the sliding-window correlating. The access-code generator also consists of two blocks; BCH(Bose-Chadhuri-Hocquenghem) cyclic encoder and control block. It generates the access-codes according to four steps' generation process based on Bluetooth standard. In order to solve synchronization problem, we make use of any memory as a pseudo random sequence. The proposed correlator and access-code generator were coded with VHDL. An FPGA Implementation of these modules and the simulation results are proved by Xilinx chip. The critical delay and correlative margin based on synthesis show the 4.689ns and the allowable correlation-error up to 7-bit.

  • PDF

A dynamic resource allocation and call admission control considering 'satisfaction degree of quality of service' for the VBR video sources with QoS constraints (QoS 제약 조건을 갖는 VBR 비디오에 대한 서비스 품질 만족도를 고려한 동적 자원 할당 및 호 수락 제어)

  • Yoo, Sang-Jo;Kim, Seong-Dae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.1
    • /
    • pp.1-13
    • /
    • 2001
  • In this paper, we propose a new dynamic bandwidth allocation and call admission control for VBR video sources with QoS constraints to support an efficient resource management and at the same Lime to satisfy the user's quality or service requirements. For the dynamic bandwidth allocation, first the next amount of traffic is predicted using a modified adaptive linear prediction method that considers abrupt scene change effects. And then, we dynamically allocate the necessary bandwidth to each connection based on the currently provided quality degree by the network with respect to the user's QoS requirements in terms of average delay and loss ratio. For the admission control, we determine the acceptance or rejection or a new connection based on the quality satisfaction degrees of the existing connections. Simulation results show that our proposed dynamic schemes are able to provide a stable service, which well meets the user's quality requirements.

  • PDF