• Title/Summary/Keyword: network delay

Search Result 2,881, Processing Time 0.03 seconds

Anatomy of Delay for Voice Service in NGN

  • Lee, Hoon;Baek, Yong-Chang
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.172-175
    • /
    • 2003
  • In this paper we propose a method fur the evaluation of the quality of service for VoIP services in NGN. Specifically, let us anatomize the elements of delay of a voice connection in the network in an end-to-end manner and investigate expected value at each point. We extract the delay time in each element in the network such as gateway, network node, and terminal equipment, and estimate an upper bound fur the tolerable delay in each element.

  • PDF

Signaling for Inter-Switching Handoff on ATM-based Wired/Wireless Integraed Network (ATM기반 유무선 통합망에서 교환기간 핸드오프 처리를 위한 시그널링 방안)

  • 장경훈;강경훈;박상현;안영화;김덕진
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.1
    • /
    • pp.39-51
    • /
    • 1998
  • In this paper, we propose signaling procedures amon network elements for a connection rerouting method which can reduce inter-switch handoff processing delay reduces the delay in the connection re-routing by reserving VPI/VCIs for possible inter-switch handoff calls in advance. Additionally, we mathematically analyze the signaling procedures and then suggest solutions to the relations with cluser size, network topoloty, handoff-request rete and handoff delay. With simulation, the solutions are validated. From numerical examples, we concluded taht handoff delay, one of the handoff QoSs, can be satisfied by adjusting the cluster size and network topology according to the handoff -request rate of service area. With our proposed signaling and analytic methods, we concluded that the connection rerouting method using cluster-sectoring effectively reduces the delay of inter-switch handoff processing than dynamic connection rerouting method. Our solutions are useful in guaranteeing the requested handoff delay (especially, inter-switch handoff delay) when the connection rerouting method is applied to ATM-based wireless/wired integrated network.

  • PDF

A Delay-guaranteed Overlay Network for P2P Streaming Service (P2P 스트리밍 서비스를 위한 지연시간 보장 오버레이 네트워크)

  • Park, Seung-Chul
    • Journal of Information Technology Services
    • /
    • v.9 no.3
    • /
    • pp.83-93
    • /
    • 2010
  • P2P streaming technology has advantages of scalability and availability comparing to the popular IP multicast. This paper proposes an approach to apply the P2P streaming technology to the delay-sensitive multimedia multicast applications. In order for the P2P streaming to be applied to the delay-sensitive applications, prior construction of delay-guaranteed overlay network is necessarily required. Moreover, the delay-guaranteed overlay network should be able to be kept even when the hand-overs occur owing to the departures of the intermediate P2P peers. This paper proposes a delay-guaranteed overlay network construction method by using the bandwidth and end-to-end delay based admission control and the backup peer based hand-over control mechanism.

Novel Section-Based Joint Network Coding and Scheduling Scheme in WMNs: JNCS

  • Cha, Jae Ryong;Baek, Gwang Hun
    • ETRI Journal
    • /
    • v.37 no.2
    • /
    • pp.380-386
    • /
    • 2015
  • Guaranteeing quality of service over a multihop wireless network is difficult because end-to-end (ETE) delay is accumulated at each hop in a multihop flow. Recently, research has been conducted on network coding (NC) schemes as an alternative mechanism to significantly increase the utilization of valuable resources in multihop wireless networks. This paper proposes a new section-based joint NC and scheduling scheme that can reduce ETE delay and enhance resource efficiency in a multihop wireless network. Next, this paper derives the average ETE delay of the proposed scheme and simulates a TDMA network where the proposed scheme is deployed. Finally, this paper compares the performance of the proposed scheme with that of the conventional sequential scheduling scheme. From the performance analysis and simulation results, the proposed scheme gives more delay-and energy-efficient slot assignments even if the NC operation is applied, resulting in a use of fewer network resources and a reduction in ETE delay.

Analysis of the Position Control Performance under the Time Delay in the Controller Area Network (CAN 시간지연에 대한 아라고 진자의 위치제어 성능분석)

  • Park, Tae-Dong;Lee, Jae-Ho;Youn, Su-Jin;Park, Ki-Heon
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • pp.354-356
    • /
    • 2006
  • In this paper, the position control performance of networked control systems is analyzed when time delay through the network is considered. Integrating a control system into a network has great advantages over the traditional control system which uses point to point connection: it allows remarkable reduction in wiring, makes it easy to install and maintain the system, and improves compability. However, a networked control system has the critical defect that network uncertainties, such as time delay, can degrade the control system's performance. Therefore, the major concern of a networked control system is analyzing the effect of network uncertainties. This paper is concerned with PID controller performance for stability region, critical stability region and unstability region under the time delay in the Controller Area Network.

  • PDF

Optimal Stochastic Policies in a network coding capable Ad Hoc Networks

  • Oh, Hayoung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4389-4410
    • /
    • 2014
  • Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.

Development of Coordinated Scheduling Algorithm and End-to-end Delay Analysis for CAN-based Distributed Control Systems (CAN기반 분산 제어시스템의 종단 간 지연시간 분석과 협조 스케줄링 알고리즘 개발)

  • 이희배;김홍열;김대원
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.7
    • /
    • pp.501-508
    • /
    • 2004
  • In this paper, a coordinated scheduling algorithm is proposed to reduce end-to-end delay in distributed control of systems. For the algorithm, the analysis of practical end-to-end delay in the worst case is performed priory with considering implementation of the systems. The end-to-end delay is composed of the delay caused by multi-task scheduling of operating systems, the delay caused by network communications, and the delay caused by asynchronous timing between operating systems and network communications. Through some simulation tests based on CAN(Controller Area Network), the proposed worst case end-to-end delay analysis is validated. Through the simulation tests, it is also shown that a real-time distributed control system designed to existing worst case delay cannot guarantee end-to-end time constraints. With the analysis, a coordinated scheduling algorithm is proposed here. The coordinated scheduling algorithm is focused on the reduction of the delay caused by asynchronous timing between operating systems and network communications. Online deadline assignment strategy is proposed for the scheduling. The performance enhancement of the distributed control systems by the scheduling algorithm is shown through simulation tests.

The Study of Measuring Method for Signal Processing Delay to Dual Mode Signal Transmission for Satellite DMB System (위성 DMB Dual Mode 신호전송에 따른 신호변환 Delay 측정 방법에 관한 연구)

  • Lee Young-Su;Choi Gyeong-Ho;Lee Byung-Suk;Cho Sung-Min;Ihm Tae-Jong
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.31-34
    • /
    • 2004
  • 본 논문에서는 현재 위성 DMB 국내 표준으로 채택되어 있는 System E 방식의 Dual Mode 신호 전송에 따른 신호변환시 Time Delay측정 방법에 대해서 제안을 하였다. 제안된 방식의 경우 아날로그 방식이 아닌 디지털 방식으로 정확한 Time Delay 측정이 가능하다. 그리고 위성 DMB Gap Filler System의 입 출력 단자를 통하여 측정이 가능함으로 측정값에 대한 신뢰성 확보가 가능하며 자동측정 방식임으로 측정시 발생될 수 있는 Human Error를 최소화 할 수 있다는 장점을 가지고 있다.

  • PDF

Performance Evaluations of the Computer Networks for the Voice/Data Coexisted Network Design (음성/데이터 통합망 설계를 위한 이행 단계별 성능평가)

  • Eom, Ki-Bok;Yoe, Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.4
    • /
    • pp.678-683
    • /
    • 2003
  • This study presents a result of performance with the design of network topology for voice and data integration under computer network. This network is consisted of FastEthernet, other LANs and ATM WAN(wide area network), and performance evaluation of delay in a PBX+IP network, delay in a VoIP network and delay in a IP+ATM network will be shown. We use parameters including network bandwidth, number of packet, routing protocol(IGRP, OSPF). We simulate integrated of voice and data used PBX. we will study further about the case of integrated of voice and data environments using PBX. and, evaluate IP+ATM WAN average measured network delay and average delay of VoIP network.

An Efficient Routing Algorithm for extreme networking environments (극단적인 네트워크 환경을 위한 효율적인 라우팅 알고리즘)

  • Wang, Jong Soo;Seo, Doo Ok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.1
    • /
    • pp.47-53
    • /
    • 2012
  • Sensor networks and car networks that have different structure from that of conventional TCP/IP network require extreme network environment due to frequent change of connectivity. Because such extreme network environment has characteristics like unreliable link connectivity, long delay time, asymmetrical data transfer rate, and high error rate, etc., it is difficult to perform normally with the conventional TCP/P-based routing. DTNs (delay and disruption tolerant network) was designed to support data transfer in extreme network environment with long delay time and no guarantee for continuous connectivity between terminals. This study suggests an algorithm that limits the maximum number of copying transferred message to L by improving the spray and wait routing protocol, which is one of the conventional DTNs routing protocols, and using the azimuth and density data of the mobile nods. The suggested algorithm was examined by using ONE, a DTNs simulator. As a result, it could reduce the delay time and overhead of unnecessary packets compared to the conventional spray and wait routing protocol.