• Title/Summary/Keyword: Self-similar network traffic

Search Result 52, Processing Time 0.028 seconds

Performance Evaluation of Pipelined Dynamic Bandwidth Algorithm for XG-PON (XG-PON의 Pipeline 방식의 동적대역할당 성능평가)

  • Gong, Byung Gu;Han, Man Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.148-149
    • /
    • 2014
  • This paper evaluates performance of a pipelined dynamic bandwidth allocation scheme for XG-PON (10-Gbps-capable passive optical network) system for power saving. Under self-similar traffic and balanced input loads, we evaluate performance of XG-PON systems using computer simulations.

  • PDF

Delay Control using Fast TCP Prototype in Internet Communication (인터넷 통신에서 고속 TCP 프로토타입을 이용한 지연 제어)

  • 나하선;김광준;나상동
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.6
    • /
    • pp.1194-1201
    • /
    • 2003
  • Measurements of network traffic have shown that self-similarity is a ubiquitous phenomenon spanning across diverse network environments. We have advance the framework of multiple time scale congestion control and show its effectiveness at enhancing performance for fast TCP prototype control. In this paper, we extend the fast TCP prototype control framework to window-based congestion control, in particular, TCP. This is performed by interfacing TCP with a large time scale control module which adjusts the aggressiveness of bandwidth consumption behavior exhibited by TCP as a function of "large time scale" network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by RTT. Performance evaluation of fast TCP prototype is facilitated by a simulation bench-mark environment which is based on physical modeling of self-similar traffic. We explicate out methodology for discerning and evaluating the impact of changes in transport protocols in the protocol stack under self-similar traffic conditions. We discuss issues arising in comparative performance evaluation under heavy-tailed workload. workload.

Performance Evaluation of Dynamic Bandwidth Allocation Algorithm of TWDM PON for Power Saving (TWDM PON의 전력절감용 동적대역할당 성능평가)

  • Hong, Sung Hark;Han, Man Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.150-151
    • /
    • 2014
  • This paper evaluates performance of a dynamic wavelength and bandwidth allocation algorithm of TWDM PON (time and wavelength division multiplexed passive optical network) which consists of an OLT (optical line termination) and multiple ONU (optical network unit). The allocation algorithm reduces the number of upstream wavelengths to save power. Using self-similar traffic, we simulate TWDM PON systems and measure the average packet delay and the average number of upstream wavelengths.

  • PDF

Approximate Analysis of MAC Protocol with Multiple Self-tokens in a Slotted Ring

  • Sakuta, Makoto;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.249-257
    • /
    • 2003
  • Ring networks are very commonly exploited among local area and metropolitan area networks (LAN/MAN), whereas cells or small fixed-size packets are widely used in synchronized ring networks. In this paper, we present an analytical method for evaluating the delay-throughput performance of a MAC protocol with multiple self-tokens in a slotted ring network under uniform traffic. In our analysis, we introduce the stationary probability, which indicates the number of packets in a node. Also, it is assumed that each node has a sufficiently large amount of self-tokens, and a slotted ring has the symmetry. The analytical results with respect to delay-throughput performance have similar values to computer simulated ones. Furthermore, in order to achieve fair access under non-uniform traffic, we propose an adaptive MAC protocol, where the number of self-tokens in a node dynamically varies, based on the number of packets transmitted within a specified period. In the proposed protocol, when the number of packets transmitted by a node within a specified period is larger than a specified threshold, the node decreases the number of self-tokens in a per-node distributed method. That results in creating free slots in the ring, thus all nodes can obtain an equal opportunity to transmit into the ring. Performance results obtained by computer simulation show that our proposed protocol can maintain throughput fairness under non-uniform traffic.

Congestion Control with Multiple Time Scale under Self-Similar Traffic (자기유사성 트래픽 조건에서 다중 시간 간격을 이용한 혼잡제어)

  • Park, Dong-Suk;Ra, Sang-Dong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.65-75
    • /
    • 2005
  • Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. We have advanced the framework of the multiple time scale congestion control and showed its effectiveness at enhancing performance for the rate-based feedback control. Our contribution is threefold. First, we define a modular extension of the TCP-a function called with a simple interface-that applies to various flavours of the TCP-e.g., Tahoe, Reno, Vegas and show that it significantly improves performance. Second, we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.

A Tunable Transmitter - Tunable Receiver Algorithm for Accessing the Multichannel Slotted-Ring WDM Metropolitan Network under Self-Similar Traffic

  • Sombatsakulkit, Ekanun;Sa-Ngiamsak, Wisitsak;Sittichevapak, Suvepol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.777-781
    • /
    • 2004
  • This paper presents an algorithm for multichannel slotted-ring topology medium access protocol (MAC) using in wavelength division multiplexing (WDM) networks. In multichannel ring, there are two main previously proposed architectures: Tunable Transmitter - Fixed Receiver (TTFR) and Fixed Transmitter - Tunable Receivers (FTTR). With TTFR, nodes can only receive packets on a fixed wavelength and can send packets on any wavelengths related to destination of packets. Disadvantage of this architecture is required as many wavelengths as there are nodes in the network. This is clearly a scalability limitation. In contrast, FTTR architecture has advantage that the number of nodes can be much larger than the number of wavelength. Source nodes send packet on a fixed channel (or wavelength) and destination nodes can received packets on any wavelength. If there are fewer wavelengths than there are nodes in the network, the nodes will also have to share all the wavelengths available for transmission. However the fixed wavelength approach of TTFR and FTTR bring low network utilization. Because source node with waiting data have to wait for an incoming empty slot on corresponding wavelength. Therefore this paper presents Tunable Transmitter - Tunable Receiver (TTTR) approach, in which the transmitting node can send a packet over any wavelengths and the receiving node can receive a packet from any wavelengths. Moreover, the self-similar distributed input traffic is used for evaluation of the performance of the proposed algorithm. The self-similar traffic performs better performance over long duration than short duration of the Poison distribution. In order to increase bandwidth efficiency, the Destination Stripping approach is used to mark the slot which has already reached the desired destination as an empty slot immediately at the destination node, so the slot does not need to go back to the source node to be marked as an empty slot as in the Source Stripping approach. MATLAB simulator is used to evaluate performance of FTTR, TTFR, and TTTR over 4 and 16 nodes ring network. From the simulation result, it is clear that the proposed algorithm overcomes higher network utilization and average throughput per node, and reduces the average queuing delay. With future works, mathematical analysis of those algorithms will be the main research topic.

  • PDF

Performance Lmprovements of Self-Similar Traffic Congestion Control of Multiple Time Scale Under in TCP-MT network (TCP-MT 네트워크에서 다중 시간 간격을 이용한 자기유사성 트래픽 혼잡제어 성능개선)

  • Na Ha-Sun;Kim Moon-Hwan;Ra Sang-Dong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12C
    • /
    • pp.1239-1247
    • /
    • 2005
  • It is important to improve TCP performance in Self-similar TCP network where signalling between the same end nodes through bidirectional traffic routes. In wireless link, the traffic limitation pattern occurred in two or more TCP connections is applied into MPEC video control as multi time-interval congestion control. For TCP update variable, we extend TCP and perform as function call, and we study a method of relating TCP with LTS module controlling with the information type that is overcoming the limit of feedback loop determined by RTT. For comparison, we measure the TCP throughput without LTS and verify the fairness by means of meta control. The improved TCP performance is shown by that the number of connections of traffic congestion control increases when RTT increases.

Comparative Performance Study of WDM Packet Switch for Different Traffic Arrival Approach

  • Reza, Ahmed Galib;Lim, Hyo-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.5
    • /
    • pp.551-555
    • /
    • 2011
  • Optical packet switching is a promising technology, which can integrate both data and optical network. In this paper, we present a comparative study of various traffic arrival approaches in WDM packet switches. The comparison is made based on packet loss rate and average delay under uniform and self-similar Pareto traffic. Computer simulations are performed in order to obtain the switch performance metrics. Study shows that burstiness of data traffic has a strong negative impact in the performance of WDM packet switches.

The Congestion Control using Selective Slope Control under Multiple Time Scale of TCP (TCP의 다중 시간 간격에서 선택적 기울기 제어를 이용한 혼잡 제어)

  • Kim, Gwang-Jun;Kang, Ki-Woong;Lim, Se-Jung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.2 no.1
    • /
    • pp.10-18
    • /
    • 2007
  • In this paper, we extend the multiple time scale control framework to window-based congestion control, in particular, TCP. This is performed by interfacing TCP with a large time scale control module which adjusts the aggressiveness of bandwidth consumption behavior exhibited by TCP as a function of "large time scale" network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by RTT. Performance evaluation of multiple time scale TCP is facilitated by a simulation bench-mark environment which is based on physical modeling of self-similar traffic. If source traffic is not extended exceeding, when RTT is 450ms, in self similar burst environment, performance gain of TCP-SSC is up to 45% for ${\alpha}$=1.05. However, its is acquired only 20% performance gain for ${\alpha}$=1.95 relatively. Therefore we showed that by TCP-MTS at large time scale into a rate-based feedback congestion control, we are able to improve two times performance significantly.

  • PDF

Modeling Heavy-tailed Behavior of 802.11b Wireless LAN Traffic (무선 랜 802.11b 트래픽의 두꺼운 꼬리분포 모델링)

  • Yamkhin, Dashdorj;Won, You-Jip
    • Journal of Digital Contents Society
    • /
    • v.10 no.2
    • /
    • pp.357-365
    • /
    • 2009
  • To effectively exploit the underlying network bandwidth while maximizing user perceivable QoS, mandatory to make proper estimation on packet loss and queuing delay of the underling network. This issue is further emphasized in wireless network environment where network bandwidth is scarce resource. In this work, we focus our effort on developing performance model for wireless network. We collect packet trace from actually wireless network environment. We find that packet count process and bandwidth process in wireless environment exhibits long range property. We extract key performance parameters of the underlying network traffic. We develop an analytical model for buffer overflow probability and waiting time. We obtain the tail probability of the queueing system using Fractional Brown Motion (FBM). We represent average queuing delay from queue length model. Through our study based upon empirical data, it is found that our performance model well represent the physical characteristics of the IEEE 802.11b network traffic.

  • PDF