• Title/Summary/Keyword: End-to-End Delay

Search Result 762, Processing Time 0.044 seconds

Efficient Multi-hop Resource Reservation Scheme in WiMedia D-MAC for Multi-hop N-Screen Services (멀티 홉 N-스크린 서비스를 위한 WiMedia D-MAC에서의 효율적인 멀티 홉 자원 예약 기술)

  • Hur, Kyeong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.5
    • /
    • pp.1091-1096
    • /
    • 2015
  • In this paper, WiMedia Distributed-MAC protocol is adopted for development of multi-hop N-screen wireless services. Furthermore, to provide the multi-hop OSMU (One Source Multi Use) N-screen service through P2P streaming in the D-MAC protocol, a new multi-hop resource reservation scheme is proposed and analyzed to reduce end to end delay. For this Multi-hop resource reservation scheme, a new MSCDRP (Multi-Stage Cooperative DRP) IE is proposed. Simulation results show that our multi-hop MSCDRP scheme reduces the end to end delay and increases throughput at various multi-hop N-screen network environment.

Wavelength Assignment Method using Upstream Bandwidth Wavelength Division of EPON (EPON의 상향 대역폭 파장 분할 방식을 이용한 파장 배정 방법)

  • Seo, Chang-Jin;Jang, Yong-Suk
    • Journal of Digital Convergence
    • /
    • v.10 no.4
    • /
    • pp.251-256
    • /
    • 2012
  • In this paper, we addressed the problem of upstream bandwidth in EPONs. We presented a wavelength division EPON supporting QoS in the differentiated services framework. It was shown that the bandwidth allocation by priority scheduling, under our assumptions for traffic behavior, will result in an unexpected behavior for high priority class and we suggested the use of weighted priority scheduling to alleviate this problem. Our wavelength division EPON supporting QoS allocates effectively and fairly bandwidths and wavelengths between ONUs in the differentiated services framework. Moreover, we showed better performance in terms of average and maximum end-to-end delay, as well as network throughput, utilization compared with some other algorithms. We used simulation experiments to study the performance and validate the effectiveness of the proposed network and algorithm.

Advanced AODV Routing Performance Evaluation in Vehicular Ad Hoc Networks (VANET에서 Advanced AODV 라우팅 성능평가)

  • Lee, Jung-Jae;Lee, Jung-Jai
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.6
    • /
    • pp.1011-1016
    • /
    • 2020
  • Rapid change in network topology in high-speed VANET(: Vehicular Ad Hoc Network) is an important task for routing protocol design. Selecting the next hop relay node that affects the performance of the routing protocol is a difficult process. The disadvantages of AODV(: Ad Hoc On-Demand Distance Vector) related to VANET are end-to-end delay and packet loss. This paper proposes the AAODV (Advanced AODV) technique to reduce the number of RREQ (: Route Request) and RREP (: Route Reply) messages by modifying the AODV routing protocol and adding direction parameters and 2-step filtering. It can be seen that the proposed AAODV reduces packet loss and minimizes the effect of direction parameters, thereby increasing packet delivery rate and reducing end-to-end delay.

A Design of Peer-to-Peer Based IPTV System using Multiple Chain Architecture (다중 체인구조를 이용한 Peer-to-Peer 기반 IPTV 시스템 설계)

  • Kim, Ji-Hoon;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.12
    • /
    • pp.74-82
    • /
    • 2008
  • In this paper, we propose a P2P based IPTV system using a multiple chain architecture. Proposed system is robust to the peer churn. As opposed to the internet the IPTV network managed by a single ISP has fewer bandwidth constraints and end-to-end connectivity. So, we emphasize preferentially robustness of a P2P network in IPTV environment. A single chain structure which was proposed previously emphasizes simplicity, however there exists considerable delay time at the end part of peers as the number of peers increasing. As a solution to the problem, we propose the scheme which seperates the chain into several levels and again divides each level into spans to diminish a delay time. Though the chain is separated into level and span, basic structure of proposed scheme is still a chain structure. So the scheme simplifies the recovery procedure caused by join or departure of peers. We will show the improved performance of proposed scheme rather than single chain structure with respect to the delay time and reliability.

Impact of Mobility on the Ad Hoc Network Performance (이동성이 Ad Hoc 망의 성능에 미치는 영향)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.5
    • /
    • pp.201-208
    • /
    • 2010
  • Mobile Ad Hoc Network(MANET) has highly dynamic topology, hence presents a great challenge on the network performance evaluation and network protocol design. We proposed total path break up time, $\sum_{i}T_i$, as a metric to measure the performance of the total system as well as an individual connection. In this paper, we evaluate and analyze the performance of three mobility models(Random Waypoint, Manhattan, Blocked Manhattan) by applying the total path break up metric, investigate why network parameters such as packet delivery ratio, end-to-end delay, etc. vary by mobility models. We also present analysis result how much AODV Buffer improve packet delivery ratio and increase the end-to-end delay in spite of the path break up.

Measurement of End-to-End Forward/Backward Delay Variation (종단간 순방향/역방향 전송 지연 측정)

  • Hwang Soon-Han;Kim Eun-Gi
    • The KIPS Transactions:PartC
    • /
    • v.12C no.3 s.99
    • /
    • pp.437-442
    • /
    • 2005
  • The measurement of RTT (Round Trip Time) can be used for the analysis of Internet congestion. However, simple measuring of RTT which measures only hun around time of a packet can not infer a packet forward/backward delay variation. In this thesis, we present a new algorithm which can be used for the estimation of forward/backward delay variation of packets. These delay variations are implication of network congestion state. In this algorithm, the reference forward/backward delay can be determined based on the minimum RTT value. The delay variation of each packet can be calculated by comparing reference delay with the packet delay. We verified our proposed algorithm by NS-2 simulation and delay measuring in a real network.

Reliable Hybrid Multicast using Multi-layer Transmission Path (다계층 전송경로를 이용한 신뢰성 있는 하이브리드 멀티캐스트)

  • Gu, Myeong-Mo;Kim, Bong-Gi
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.1
    • /
    • pp.35-40
    • /
    • 2019
  • It is important to constantly provide service in real-time multimedia applications using multicast. Transmission path reconstruction occurs in hybrid multicast using Internet Protocol (IP) multicast and ALM in order to adapt the network status to things like congestion. So, there is a problem in which real-time QoS is reduced, caused by an increase in end-to-end delay. In this paper, we want to solve this problem through multi-layer transmission path construction. In the proposed method, we deploy the control server and application layer overlay host (ALOH) in each multicast domain (MD) for hybrid multicast construction. After the control server receives the control information from an ALOH that joins the MD, it makes a group based on the hop count and sends it to the ALOH in each MD. The ALOH in the MD performs the role of sending the packet to another ALOH and constructs the multi-layered transmission path in order of priority by using control information that is received from the control server and based on the delay between neighboring ALOHs. When congestion occurs in, or is absent from, the ALOH in the upper MD, the ALOH selects the path with the highest priority in order to reduce end-to-end delay. Simulation results show that the proposed method could reduce the end-to-end delay to less than 289 ms, on average, under congestion status.

A Study on the Traffic Delay Control for real-time Communication in Broadband Network (광대역망에서 실시간 통신을 위한 트래픽 지연제어에 관한 연구)

  • Jang, Hyok;Kim, Kwang-Jun;Na, Sang-Dong;Cho, Hyeon-Seob;Jang, Sung-Whan;Bae, Chul-Soo
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.06c
    • /
    • pp.351.1-355
    • /
    • 1998
  • Network-based real-time multimedia applications require guaranteed performances of communication service. Also according to increased bandwidth and processing performance in the future high speed networks, it is possible to make multimedia real-time applications such as distributed real-time applications including video conference, medical imaging, and video education. These applications have characteristics of stringent performance requirements in terms of delay, delay jitter and maximum loss rate. This paper proposes a new delay control for Broadband networks with FCFS queueing. The delay control provides an alternative solution to a current problem in real-time communication; traffic distortion, which makes it difficult to meet such real-time requirements. In simulations, it shows that the proposed delay control can guarantee local and end-to-end delay.

  • PDF

End-to-End Method for Improving TCP Performance for MANET (MANET용 TCP의 성능 개선을 위한 단-대-단 방법)

  • Yim Jaegeol
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.2 s.302
    • /
    • pp.1-10
    • /
    • 2005
  • The current implementation of TCP for the Internet is not efficient when used for Mobile Ad hoc Networks (MANENTs). This is because TCP assumes that all packet losses are caused by congestion, whereas transmission errors are a main reason for packet losses in wireless networks. To remedy this situation and increase performance, we propose an end-to-end method of using propagation delays and the differences between propagation delays to distinguish the causes for packet losses. The proposed method has two characteristics: Firstly, it is energy-efficient because this solution is only initiated when a packet loss is detected. Secondly, our approach considers only the one way propagation delay and is more accurate in determining causes for packet losses than existing methods which consider round trip time. Petri net models of the proposed TCP and of the standard TCP have been built and simulations have been performed on them. Our simulation results show that the proposed approach increases throughput and reduces propagation delay compared with standard TCP.