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

Search Result 762, Processing Time 0.034 seconds

Performance Management and Analysis for Guaranteed End-to-End QoS Provisioning on MPLS-based Virtual Private LAN Service(VPLS)

  • Kim, Seong-Woo;Kim, Chul;Kim, Young-Tak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2B
    • /
    • pp.144-156
    • /
    • 2003
  • Internet/Intranet has been continuously enhanced by new emerging IP technologies such as differentiate service(DiffServ), IPSec(IP Security) and MPLS(Multi-protocol Label Switching) traffic engineering. According to the increased demands of various real-time multimedia services, ISP(Internet Service Provider) should provide enhanced end-to-end QoS(quality of service) and security features. Therefore, Internet and Intranet need the management functionality of sophisticated traffic engineering functions. In this paper, we design and implement the performance management functionality for the guaranteed end-to-end QoS provisioning on MPLS-based VPLS(Virtual Private LAN Service). We propose VPLS OAM(Operation, Administration and Maintenance) for efficient performance management. We focus on a scheme of QoS management and measurement of QoS parameters(such as delay, jitter, loss, etc.) using VPLS OAM functions. The proposed performance management system also supports performance tuning to enhance the provided QoS by re-adjusting the bandwidth of LSPs for VPLS. We present the experimental results of performance monitoring and analysis using a network simulator.

A Study on Bandwidth Provisioning Mechanism using ATM Shortcut in MPLS Networks

  • Lee, Gyu-Myoung;Park, Jun-Kyun
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.529-532
    • /
    • 2000
  • This paper addresses how to be connected with end-to-end shortcut using ATM Switched Virtual Connection (SVC) in ATM-based Multi-Protocol Label Switching (MPLS) Networks. Without additionally existing ATM Ships-in-the-Night (SIN) mode, when the stream is continuously transmitted at the same destination with the lapse of determined aging time, the connection is changed with end-to-end shortcut connection using ATM signaling. An ATM direct short circuit is performed an IP and ATM effective integration. An ATM shortcut has a number of advantages, like higher throughput, shorter end-to-end delay, reduced router load, better utilization of L2 Quality of Service (QoS) capabilities, and route optimization. In particular between other MPLS domains, this can be efficiently improved the performance of networks.

  • PDF

End-to-End Congestion Control of High-Speed Gigabit-Ethernet Networks based on Smith's Principle

  • Lee, Seung-Hyub;Cho, Kwang-Hyun
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.101-104
    • /
    • 2000
  • Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith's principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

  • PDF

Matrix completion based adaptive sampling for measuring network delay with online support

  • Meng, Wei;Li, Laichun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.7
    • /
    • pp.3057-3075
    • /
    • 2020
  • End-to-end network delay plays an vital role in distributed services. This delay is used to measure QoS (Quality-of-Service). It would be beneficial to know all node-pair delay information, but unfortunately it is not feasible in practice because the use of active probing will cause a quadratic growth in overhead. Alternatively, using the measured network delay to estimate the unknown network delay is an economical method. In this paper, we adopt the state-of-the-art matrix completion technology to better estimate the network delay from limited measurements. Although the number of measurements required for an exact matrix completion is theoretically bounded, it is practically less helpful. Therefore, we propose an online adaptive sampling algorithm to measure network delay in which statistical leverage scores are used to select potential matrix elements. The basic principle behind is to sample the elements with larger leverage scores to keep the traits of important rows or columns in the matrix. The amount of samples is adaptively decided by a proposed stopping condition. Simulation results based on real delay matrix show that compared with the traditional sampling algorithm, our proposed sampling algorithm can provide better performance (smaller estimation error and less convergence pressure) at a lower cost (fewer samples and shorter processing time).

End-to-end Delay Guarantee in IEEE 802.1 TSN with Non-work conserving scheduler (비작업보존 스케줄러를 갖는 IEEE 802.1 TSN에서 단대단 지연시간 보장)

  • Joung, Jinoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.6
    • /
    • pp.121-126
    • /
    • 2018
  • IEEE 802.1 TSN TG is developing standards for end-to-end delay bounds and zero packet loss based on Ethernet technology. We focus on packet forwarding techniques. TSN packet forwarding techniques can be classified into Synchronous and Asynchronous framework. Synchronous approach allocates fixed time period for a class, yet is complex for large networks. Asynchronous approach provides delay guarantee by regulator-scheduler pair, yet is unnecessarily complex, too. We propose network components for TSN Asynchronous architecture, which remove the complexity of maintaining flow state for regulation decisions. Despite such a simplicity, the proposed architecture satisfies the TSN's delay requirements provided the limited high priority traffic's maximum packet length.

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.

A Dynamic Priority-based QoS Control Scheme for Wireless Mobile Networks

  • Kang, Moon-Sik
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.57-60
    • /
    • 2005
  • In this paper, a dynamic priority-based QoS (DPQoS) provision scheme is proposed for the required QoS from one end of the network to the other in wireless mobile networks. The DPQoS model is used to meet diversity multimedia traffic requirements. This model is come up with a framework for the wireless network of which consists of a core-IP network and also a number of wireless access networks. For the true end-to-end QoS, it is required that the core network is able to support the required QoS for the wireless users. This paper shows a solution to optimize the performance for different traffic classes according to the traffic characteristics. The performance of the proposed scheme is evaluated at delay aspects such as delay and throughput.

  • PDF

Design and Implementation of OPNET Ethernet PON Simulation Model for Maximizing Network Efficiency by Changing the Number of ONU (Ethernet PON에서의 ONU 개수 변화에 따른 망 효율 극대화를 위한 OPNET 시뮬레이션 모델의 설계 및 구현)

  • 장용석;엄종훈;류상률;김승호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.169-171
    • /
    • 2002
  • Ethernet PON(Passive Optical Network)은 지금까지 연구되고 있는 가입자 망 가운데 인터넷 트래픽에 가장 적합한 모델이다. 본 논문에서는 Ethernet PON의 성능분석을 위해서 OPNET을 이용하여 Ethernet PON 시뮬레이션 모델을 설계 및 구현한다 또한, 이 모델에 대한 End to end Ethernet delay, Queuing delay, Throughput과 Utilization 분석을 통해서 하나의 OLT(Optical Line Termination)가 수용 할 수 있는 최적의 ONU(Optical Network Unit) 개수를 산정하고 Ethernet PON을 설치할 때 망의 효율을 극대화하는 방안을 제안한다.

  • PDF

Performance Evaluation for Multicasting Video over OpenFlow-based Small-scale Network

  • Thi, Thuyen Minh;Huynh, Thong;Kong, In-Yeup;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.9
    • /
    • pp.1084-1091
    • /
    • 2014
  • When demand for transmitting multimedia data increases, network congestion is more likely to occur and users will suffer high loss rate as well as high delay. In order to enhance quality-of-service (QoS) of video multicasting, we need to raise transmission reliability and reduce end-to-end delay. This paper proposes a routing mechanism for a OpenFlow-based small-scale network in order to multicast video reliably with low delay. In our method, multipath routing will be applied to Multiple Description (MD) Coded video to exploit its multi-description property. Through performance evaluation, our method shows improvement on loss rate, delay and video distortion.

Real-Time Traffic Connection Admission Control of Queue Service Discipline (큐 서비스 방식에서 실시간 트래픽 연결 수락 제어)

  • 나하선;나상동
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.5C
    • /
    • pp.445-453
    • /
    • 2002
  • We propose a cell-multiplexing scheme for the real-time communication service in ATM network and a new service discipline guarantee end-to-end delay based on pseudo-isochronous cell switching. The proposed scheme consists of two level frame hierarchy, upper and lower frame, which is used to assign the bandwidth and to guarantee the requested delay bound, respectively. Since the proposed algorithm employs two level frame hierarchy, it can overcome the coupling problem which is inherent to the framing strategy. The proposed scheme consists of two components, traffic controller and scheduller, as the imput traffic description model and regulates the input traffic specification. The function of the traffic controller is to shape real-time traffic to have the same input pattern at every switch along the path. The end-to-end delay is bounded by the scheduller which can limit the delay variation without using per-session jitter controllers, and therefore it can decrease the required buffer size. The proposed algorithm can support the QoS's of non-real time traffic as well as those of real time traffic