• Title/Summary/Keyword: Packet/Protocol Analysis

Search Result 274, Processing Time 0.021 seconds

Performance Analysis of IP Packet over MPLS Domain (MPLS 영역에서 IP Packet의 성능 분석)

  • 박상준;박우출;이병호
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.29-32
    • /
    • 2000
  • MPLS stands for “Multi-protocol Label Switching”. It's a layer 3 switching technology aimed at greatly improving the packet forwarding performance of the backbone routers in the Internet or other large networks. We compare the performance of unlabeled IP traffic and labeled IP traffic. In this paper, by varying the packet rate and measuring throughput of the flows we analyze the performance of labeled IP packet traffic and unlabeled IP packet traffic in IP over MPLS.

  • PDF

Performance Analysis of an Enhanced DQRUMA/MC-CDMA Protocol with an LPRA Scheme for Voice Traffic

  • Park, Jae-Yoon;Nam, Seung-Yeob;Sung, Dan-Keun;Jemin Chung
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.43-48
    • /
    • 2003
  • This paper presents a comparative evaluation of a modified version (A-Protocol) of the Distributed-Queueing Request Update Multiple Access (DQRUMA)Multi-Code Code Division Multiple Access (MC-CDMA) protocol and an enhanced version (P-Protocol) of the DQRUMA/MC-CDMA protocol with a lattice pool for request accesses (LPRA) scheme in a packet-based voice traffic environment. Analytical results agree with the simulation ones and show that the P-Protocol outperforms the A-Protocol in terms of the packet loss rate for voice traffic.

  • PDF

Performance Comparisons of Two DCF Methods in the IEEE 802.11 Protocol (IEEE 802.11 프로토콜에서 두 DCF 방식의 성능 비교)

  • Park, Chul-Geun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1320-1328
    • /
    • 2007
  • In recent year, the popularity of WLAN has generated much interests on improvement and performance analysis of the IEEE 802.11 protocol. In this paper, we analyze two medium access methods of the IEEE 802.11 MAC protocol by investigating the MAC layer packet service times when arrival packet sizes have a general probability distribution. We use the M/G/1/K queueing model to analyze the throughput and the delay performance of IEEE 802.11 MAC protocol in a wireless LAN. We compare the performances of Basic access method and RTS/CTS access method. We take some numerical examples for the system throughput and the queue dynamics including the mean packet delay and packet blocking probability.

Performance Analysis of a Novel Distributed C-ARQ Scheme for IEEE 802.11 Wireless Networks

  • Wang, Fan;Li, Suoping;Dou, Zufang;Hai, Shexiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3447-3469
    • /
    • 2019
  • It is well-known that the cooperative communication and error control technology can improve the network performance, but most existing cooperative MAC protocols have not focused on how to cope with the contention process caused by cooperation and how to reduce the bad influence of channel packet error rate on the system performance. Inspired by this, this paper first modifies and improves the basic rules of the IEEE 802.11 Medium Access Control (MAC) protocol to optimize the contention among the multi-relay in a cooperative ARQ scheme. Secondly, a hybrid ARQ protocol with soft combining is adopted to make full use of the effective information in the error data packet and hence improve the ability of the receiver to decode the data packet correctly. The closed expressions of network performance including throughput and average packet transmission delay in a saturated network are then analyzed and derived by establishing a dedicated two-dimensional Markov model and solving its steady-state distribution. Finally, the performance evaluation and superiority of the proposed protocol are validated in different representative study cases through MATLAB simulations.

Performance analysis of packet transmission for a Signal Flow Graph based time-varying channel over a Wireless Network (무선 네트워크 time-varying 채널 상에서 Signal Flow Graph를 이용한 패킷 전송 성능 분석)

  • Kim, Sang-Yang;Park, Hong-Seong
    • Proceedings of the KIEE Conference
    • /
    • 2004.05a
    • /
    • pp.65-67
    • /
    • 2004
  • Change of state of Channel between two wireless terminals which is caused by noise and multiple environmental conditions for happens frequently from the Wireles Network. So, When it is like that planning a wireless network protocol or performance analysis, it follows to change of state of time-varying channel and packet the analysis against a transmission efficiency is necessary. In this paper, analyzes transmission time of a packet and a packet in a time-varying and packet based Wireless Network. To reflecte the feature of the time-varying channel, we use a Signal Flow Graph model. From the model the mean of transmission time and the mean of queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the time-varying channel.

  • PDF

An Exposed-Terminal-Eliminated Dual-Channel MAC Protocol for Exploiting Concurrent Transmissions in Multihop Wireless Networks

  • Liu, Kai;Zhang, Yupeng;Liu, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.778-798
    • /
    • 2014
  • This paper proposes a novel exposed-terminal-eliminated medium access control (ETE-MAC) protocol by combining channel reservation, collision avoidance and concurrent transmissions to improve multi-access performance of the multihop wireless networks. Based on the proposed slot scheduling scheme, each node senses the control channel (CCH) or the data channel (DCH) to accurately determine whether it can send or receive the corresponding packets without collisions. Slot reservation on the CCH can be simultaneously executed with data packet transmissions on the DCH. Therefore, it resolves the hidden-terminal type and the exposed-terminal type problems efficiently, and obtains more spatial reuse of channel resources. Concurrent packet transmissions without extra network overheads are maximized. An analytical model combining Markov model and M/G/1 queuing theory is proposed to analyze its performance. The performance comparison between analysis and simulation shows that the analytical model is highly accurate. Finally, simulation results show that, the proposed protocol obviously outperforms the link-directionality-based dual-channel MAC protocol (DCP) and WiFlex in terms of the network throughput and the average packet delay.

PER Analysis for Cooperative Multi-Hop Transmission Protocol over Nakagami-m Fading Channels

  • Duy, Tran Trung;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.12 no.3
    • /
    • pp.189-195
    • /
    • 2012
  • In this paper, we propose a novel protocol called a Multi-hop Diversity Transmission protocol in which the retransmission is realized by a relay that is Nearest to a current Source (MDTNS). We derive the mathematical expressions of the packet error rate (PER) and the average number of transmissions over Nakagami-m fading channels, and verify them by Monte Carlo simulations. The simulation results show that the MDTNS protocol improves the performance of the network in terms of PER when compared to the Multi-hop Diversity Transmission protocol in which the retransmission is done by a relay that is Nearest to Destination (MDTND) and to the conventional multi-hop transmission (CMT) protocol.

Identification of Unknown Cryptographic Communication Protocol and Packet Analysis Using Machine Learning (머신러닝을 활용한 알려지지 않은 암호통신 프로토콜 식별 및 패킷 분류)

  • Koo, Dongyoung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.32 no.2
    • /
    • pp.193-200
    • /
    • 2022
  • Unknown cryptographic communication protocols may have advantage of guaranteeing personal and data privacy, but when used for malicious purposes, it is almost impossible to identify and respond to using existing network security equipment. In particular, there is a limit to manually analyzing a huge amount of traffic in real time. Therefore, in this paper, we attempt to identify packets of unknown cryptographic communication protocols and separate fields comprising a packet by using machine learning techniques. Using sequential patterns analysis, hierarchical clustering, and Pearson's correlation coefficient, we found that the structure of packets can be automatically analyzed even for an unknown cryptographic communication protocol.

Security Exposure of RTP packet in VoIP

  • Lee, Dong-Geon;Choi, WoongChul
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.59-63
    • /
    • 2019
  • VoIP technology is a technology for exchanging voice or video data through IP network. Various protocols are used for this technique, in particular, RTP(Real-time Transport Protocol) protocol is used to exchange voice data. In recent years, with the development of communication technology, there has been an increasing tendency of services such as "Kakao Voice Talk" to exchange voice and video data through IP network. Most of these services provide a service with security guarantee by a user authentication process and an encryption process. However, RTP protocol does not require encryption when transmitting data. Therefore, there is an exposition risk in the voice data using RTP protocol. We will present the risk of the situation where packets are sniffed in VoIP(Voice over IP) communication using RTP protocol. To this end, we configured a VoIP telephone network, applied our own sniffing tool, and analyzed the sniffed packets to show the risk that users' data could be exposed unprotected.

A Simple Model for TCP Loss Recovery Performance over Wireless Networks

  • Kim, Beomjoon;Lee, Jaiyong
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.235-244
    • /
    • 2004
  • There have been a lot of approaches to evaluate and predict transmission control protocol (TCP) performance in a numerical way. Especially, under the recent advance in wireless transmission technology, the issue of TCP performance over wireless links has come to surface. It is because TCP responds to all packet losses by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance in wireless and lossy systems. By several previous works, although it has been already proved that overall TCP performance is largely dependent on its loss recovery performance, there have been few works to try to analyze TCP loss recovery performance with thoroughness. In this paper, therefore, we focus on analyzing TCP's loss recovery performance and have developed a simple model that facilitates to capture the TCP sender's behaviors during loss recovery period. Based on the developed model, we can derive the conditions that packet losses may be recovered without retransmission timeout (RTO). Especially, we have found that TCP Reno can retransmit three packet losses by fast retransmits in a specific situation. In addition, we have proved that successive three packet losses and more than four packet losses in a window always invoke RTO easily, which is not considered or approximated in the previous works. Through probabilistic works with the conditions derived, the loss recovery performance of TCP Reno can be quantified in terms of the number of packet losses in a window.