• Title/Summary/Keyword: Throughput and Delay Performance

Search Result 535, Processing Time 0.07 seconds

Performance Evaluation of a Switch Router with Output-Buffer (출력 버퍼를 장착한 스위치 라우터의 성능 분석)

  • Shin Tae-zi;Yang Myung-kook
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.244-253
    • /
    • 2005
  • In this paper, a performance evaluation model of the switch router with the multiple-buffered crossbar switches is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the crossbar switch. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. The performance of the multiple-buffered crossbar switch is analyzed. Steady state probability concept is used to simplify the analyzing processes. Two important parameters of the network performance, throughput and delay, are then evaluated. To validate the proposed analysis model, the simulation is carried out on a network that uses the multiple buffered crossbar switches. Less than $2\%$ differences between analysis and simulation results are observed. It is also shown that the network performance is significantly improved when the small number of buffer spaces is given. However, the throughput elevation is getting reduced and network delay becomes increasing as more buffer spaces are added in a switch.

Performance Evaluation of a Multistage Interconnection Network with Output-Buffered ${\alpha}{\times}{\alpha}$ Switches (출력 버퍼형${\alpha}{\times}{\alpha}$스위치로 구성된 다단 연결망의 성능 분석)

  • 신태지;양명국
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.6
    • /
    • pp.738-748
    • /
    • 2002
  • In this paper, a performance evaluation model of the Multistage Interconnection Network(MIN) with the multiple-buffered crossbar switches is Proposed and examined. Buffered switch technique is well known to solve the data collision problem of the MIN. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. The performance of the multiple-buffered${\alpha}{\times}{\alpha}$ crossbar switch is analyzed. Steady state probability concept is used to simplify the analyzing processes, Two important parameters of the network performance, throughput and delay, are then evaluated, To validate the proposed analysis model, the simulation is carried out on a Baseline network that uses the multiple buffered crossbar switches. Less than 2% differences between analysis and simulation results are observed. It is also shown that the network performance is significantly improved when the small number of buffer spaces is given. However, the throughput elevation is getting reduced and network delay becomes increasing as more buffer spaces are added in a switch.

Performance Improvements of DFSA(Dynamic Frame Slotted Aloha) Algorithm through Estimation of Intial frame Size (초기 프레임 크기 예측을 통한 DFSA(Dynamic Frame Slotted Aloha) 알고리즘 성능 개선)

  • Lee, Kang-Won;Lee, Moon-Hyung;Lee, Hyun-Kyo;Lim, Kyoung-Hee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.8
    • /
    • pp.1517-1530
    • /
    • 2017
  • Traditional anti-collision algorithms determine slot size of initial frame based on the information of number of collision slots, idle slots, and success slots. Since there is no information about collision at the beginning of tag information collection, traditional anti-collision algorithms can not determine the initial frame size. Considering that performance of anti-collision algorithm is very sensitive to initial slot size traditional anti-collision algorithms need some improvements. In this study two methods are proposed to determine slot size of initial frame efficiently, through which we can improve the performance of dynamic frame slotted aloha algorithm. To verify the performance of proposed algorithms, 2.4GHz RFID system is used. Throughput and delay time are derived through simulation, which is developed using JAVA. We have seen that proposed algorithm improves throughput by 9.6% and delay time by 9.8%.

Performance Analysis of Channel Multiple Access Technique for the Multimedia Services via OBP Satellite (OBP(On-Board Processing)위성의 멀티미디어 서비스를 위한 채널 다중접속 방식의 성능 분석)

  • 김덕년;이정렬
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.2
    • /
    • pp.83-88
    • /
    • 2001
  • In this paper, System performance parameters such as throughput, blocking probability and delay have been analyzed and expressed as a function of demanding traffic and service terminating probability, and we centers our discussion at particular downlink port of satellite switch which is capable of switching the individual spot beam and processing the information signals in the packet satellite communications with demand assigned multiple access technique. Delay versa throughput as a function of traffic parameters with several service terminating probability can be derived via mathematical formulation and simulation and the relative change of transmission delay was compared.

  • PDF

Relaying Protocols and Delay Analysis for Buffer-aided Wireless Powered Cooperative Communication Networks

  • Zhan, Jun;Tang, Xiaohu;Chen, Qingchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3542-3566
    • /
    • 2018
  • In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.

Performance Analysis of HomePNA 2.0 MAC Protocol (HomePNA 2.0 MAC 프로토콜의 성능 분석)

  • Kim, Jong-Won;Kim, Dae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.10A
    • /
    • pp.877-885
    • /
    • 2005
  • The Home Phoneline Networking Alliance (HomePNA) 2.0 technology can establish a home network using existing in-home phone lines, which provides a channel rate of 4-32 Mbps. HomePNA 2.0 Medium Access Control(MAC) protocol adopts an IEEE 802.3 Carrier Sense Multiple Access with Collision Detection (CSMA/CD) access method, Quality of Service(QoS) algorithm, and Distributed Fair Priority Queuing(DFPQ) collision resolution algorithm. In this paper, we propose some mathematical models about the important elements of HomePNA 2.0 MAC protocol performance, which are Saturation Throughput, Packet Delay and Packet Jitter. Then, we present an overall performance analysis of HomePNA 2.0 MAC protocol along with simulations.

Routing considering Channel Contention in Wireless Communication Networks with Multiple Radios and Multiple Channels (다수 라디오와 채널을 갖는 무선통신망에서 채널경쟁을 고려한 라우팅)

  • Ko, Sung-Won;Kang, Min-Su;Kang, Nam-Hi;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.7-15
    • /
    • 2007
  • In wireless communication networks, single-radio single-channel architecture degrades throughput and end-to-end delay due to half-duplex transmission of wireless node and route intra interference. Also, In contention-based MAC (Medium Access Control) architecture, channel contention reduces throughput and packet collision enlarges end-to-end delay. In this paper, we use multi-radio multi-channel architecture which will make wireless node to operate in full duplex mode, and exclude route intra interference. Based on this architecture, we propose a new link metric, ccf which reflects the characteristics of a contention-based wireless link, and propose a routing path metric MCCR considering channel switching delay and route intra interference. MCCR is compared with MCR by simulation, the performance of a route established by MCCR outperforms the performance of a route by MCR in terms of throughput and end-to-end delay.

Performance Evaluation of Energy Efficient Packet Transmissions for Wi-Fi System (Wi-Fi 시스템을 위한 에너지 효율적 패킷 전송 방법의 성능 평가)

  • Shin, Taehyu;Kim, Jongwoo;Park, Suwon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.3
    • /
    • pp.38-46
    • /
    • 2014
  • Wi-Fi STAs in power saving mode described in the Wi-Fi specification can deteriorate the system performance such as throughput, time delay when they receive data frames from a Wi-Fi AP. This problem is caused by data frame reception failure due to the channel state, and it increases re-transmissions. In this paper, we propose a modified power saving mode of Wi-Fi system in order to solve the problem. Also, we evaluate its performance in terms of throughput and time delay by simulation.

A Rule for Reducing Error Remains in Multicopy Transmission ARQ

  • Shin, Woo-Cheol;Park, Jin-Kyung;Ha, Jun;Choi, Cheon-Won
    • Journal of IKEEE
    • /
    • v.7 no.1 s.12
    • /
    • pp.97-106
    • /
    • 2003
  • In ARQ based error control, imperfect error detection leaves error remains on a packet. Aiming for a reduction of error remains in multicopy transmission ARQ system, we propose a rule of requesting a retransmission and deciding a correct copy, (identified as $(m, \;{\sigma})$rule). While the probability of error remains is reduced by the employment of the $(m, \;{\sigma})$ rule at multicopy transmission ARQ, delay and throughput performance may be degraded in comparison with those of conventional single copy transmission ARQ. Thus, we develop an analytical method to evaluate the performance trade-off in multicopy transmission ARQ following the $(m, \;{\sigma})$ rule. From the numerical results obtained by the analytical method, we investigate the effect of channel characteristics on the performance of error remains, packet loss, throughput, and packet delay, and confirm that the adaptability of the $(m, \;{\sigma})$ rule to conform to various QoS requirements with ease.

  • 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.