• Title/Summary/Keyword: Message Retransmission

Search Result 42, Processing Time 0.018 seconds

An Efficient Router Assistance Mechanism for Reliable Multicast (신뢰성 보장을 위한 멀티캐스트에서의 효율적인 라우터 지원)

  • 최종원;최인영
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.2
    • /
    • pp.224-232
    • /
    • 2004
  • To guarantee the reliability in multicast transmission, researches providing reliability through hierarchical control tree which is independent on data channel tree are known to provide high scalability. However, the logical control tree in transport layer constructed without topology information of the corresponding network layer tree may inefficiently use the network resources because the logical control tree is not closely related to the tree topology of the network layer. A router assisted control tree mechanism presented in this paper would improve the efficiency of the link as well as it would remove the replicated data. In addition, it requires to a router a small change which examines the message type of the control tree.

Design and Analysis of Reliable Multicast Protocol using Meta-Groups (메타 그룹을 이용한 신뢰성 있는 멀티캐스트 프로토콜의 설계 및 분석)

  • 이동춘;김배현;송주석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.104-113
    • /
    • 2000
  • In this paper, we propose a protocol that makes use of a concept of a meta-group based on propagation trees to deal with duplicated members of the same multicast group. It is shown that, if multicast tree is composed ofthese meta-groups, the depth of the tree can be shortened and the ordering of the multicast that communicatesbetween multiple senders and receivers can be easier. In the protocol, we assign a Designated Manager(DM) toeach meta-group and make each DM do the role of the representative receiver of the meta group. In this Paper,the DM's are supposed to handle ACK and retransmission for the members in the same meta group. Hence, theDM's distribute the ACK from senders, and they can reduce the burden of senders by shortening commit delaytime. We also show, through a simulation analysis, that the new multicast protocol outperforms the existing onesnot only in message costs but also in commit delay times.

  • PDF

The Overload Control Scheme Using a Delay Queue in the SIP Signalling Networks (SIP 시그널링 네트워크에서 지연 큐를 이용한 과부하 제어 방법)

  • Lee, Jong-Min;Jeon, Heung-Jin;Kwon, Oh-Jun
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.8
    • /
    • pp.1038-1047
    • /
    • 2012
  • The SIP(Session Initation Protocol) is an application layer protocol that is used to establish, release, and change the call session of the IP telephony. In the SIP signalling networks, when the number of the UA(User Agent) requested the call session increase, the number of messages to be processed by SIP proxy server increase. It often will be caused the overload of the SIP proxy server. In this paper, we proposed the overload control method with a normal queue and a delay queue in the SIP proxy server. When it is estimated the overload of the server by the excess of the high threshold in the normal queue, new INVITE messages will be put into the delay queue to reduce the load of the server. It results in some delay of the call session from the INVITE message. Subsequently when the number of messages in the normal queue is reduced below the low threshold, the INVITE messages in the delay queue is processed. The simulation results showed that the number of the retransmission messages by our proposed method was 45% less than the one by the method with single queue. The results also showed that the average call success rate by the proposed method was 2% higher than the one by the method with single queue.

Modeling of the Distributed Broadcasting in IEEE 802.11p MAC Based Vehicular Networks (IEEE 802.11p MAC 기반 차량 네트워크에서의 분산된 브로드캐스팅 모델링)

  • Jeong, Daein
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.11
    • /
    • pp.924-933
    • /
    • 2013
  • In this paper, we propose a modeling of the broadcasting in the IEEE 802.11p MAC protocol for the VANET(Vehicular Ad hoc Networks). Due to the fact that the beacon message which is needed for the safety services is shared via broadcasting, the analytical modeling of the broadcasting is crucial for the optimum design of the services. Two characteristics specific to the IEEE 802.11p are reflected in the modeling; the time limited CCH interval caused by the channel switching between the CCH and SCH, and no retransmission of the broadcasted messages. In the proposal, we assumed no restriction on the moment of generation of the beacon messages. We allow the messages to be generated and broadcasted within the whole CCH interval. Simulation results prove the accuracy of the proposed modeling. Noticeable improvements are also observed in terms of the performance indices such as the successful delivery ratio, transmission delay, and the variation of the delay.

Distance and Random-based Broadcast Scheme for Vehicle Safety Communication (차량 안전 통신을 위한 거리와 랜덤 기반 브로드캐스트 기법)

  • You, Jong-Duck;Jung, Sou-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.11
    • /
    • pp.69-76
    • /
    • 2008
  • Safety-related messages are propagated in form of broadcasting among vehicles in vehicle safety communication. There is the broadcast storm problem in high density vehicle environments. To solve this problem, a distance-based broadcast scheme has been proposed. It causes a serious problem such as retransmission delay in low density vehicle environments since it requires additional defer time to rebroadcast messages. This paper proposes a distance and random-based broadcast scheme. The proposed scheme selects a random time from zero to the defer time that estimated depending on the distance between sending and receiving vehicles. Simulation results show that the proposed scheme requires shorter defer time and less rebroadcasting message than existing schemes.

Performance Analysis of the Encryption Algorithms in a Satellite Communication Network based on H-ARQ (H-ARQ 기반 위성통신망에서 암호화 알고리즘에 따른 성능 분석)

  • Jeong, Won Ho;Yeo, Bong-Gu;Kim, Ki-Hong;Park, Sang-Hyun;Yang, Sang-Woon;Lim, Jeong-Seok;Kim, Kyung-Seok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.45-52
    • /
    • 2015
  • Since the broadcast message in satellite signals the security of the data is extremely poor compared to other communication technologies such as the broadcast signal. Thus, encryption of the communication satellite has become a very important issue, an analysis of the communication performance of a general service is always required. In this paper, In order to analyze the encrypted communication the turbo code in an IP-based satellite communication applies the code rate compatible punctured and The wireless channel in consideration of the actual satellite communication was constructed by placing a weight on the Rayleigh fading and the Rician fading two channels. Retransmission-based error control scheme were constructed in the best performance of H-ARQ Type-II, III scheme of a number of ways that are recently considered. we analyzed the effects of normal service against a satellite communication network The security services were configured with encryption algorithms AES, ARIA (CTR, CBC mode).

A Cluster Maintenance Scheme to Reduce the Control Overhead in Mobile Ad hoc Networks (Ad hoc 네트워크에서 제어메시지 부하를 감소시키는 클러스터 유지 방법)

  • 왕기철;방상원;조기환
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.62-69
    • /
    • 2004
  • The cluster structure reduces the number of retransmission messages, when a broadcast to all hosts in ad hoc network is needed. A cluster maintenance scheme is employed to preserve this advantage from time to time. However, most of the cluster maintenance schemes require additional control messages for cluster reformation as well as control messages for acquiring neighbor information. This mitigates the advantages of employing cluster structure in ad hoc network. In this paper, a cluster maintenance scheme which forces only clusterheads to broadcast control messages during hello time is proposed. When the cluster reformation is needed, the proposed scheme employs a strategy to reduce the control messages to a minimum. In these processes, the proposed scheme doesn't violate the definition of 2-cluster and produces the clusters in fully distributed method. The simulation results prove that our scheme is better than LCC(1).

Performance Improvement of ARQ Protocol using HARQ Feedback Information in IEEE 802.16m Systems (IEEE 802.16m 시스템에서 HARQ 피드백 정보를 이용한 ARQ 프로토콜 성능 개선)

  • Lee, Jong-Min;Hong, Dae-Hyoung;So, Jae-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1136-1144
    • /
    • 2010
  • In this paper, the effects of HARQ feedback error are evaluated in IEEE 802.16m system when the HARQ and ARQ interactions that utilize the HARQ feedback information is used. Also, the HARQ and ARQ interaction scheme considering HARQ feedback errors are proposed. The HARQ and ARQ interaction scheme improve the system throughput by using the HARQ feedback information instead of the ARQ feedback message, which reduce retransmission time. However, errors in the HARQ feedback information generate severe performance degradation. Especially, the local NAK errors between HARQ feedback error critically degrade the performance, because the local NAK errors lead the loss of ARQ blocks. We propose a channel state-based schemes for HARQ and ARQ interactions to mitigate the throughput degradation due to HARQ feedback errors. Simulation results show that the proposed scheme improves the throughput and the delay performance.

Detection of Disguised Packet and Valid Reconstruction Identification Using Network Coding in IoT Environment (IoT 환경에서 네트워크 코딩의 위장패킷 탐지와 유효한 복구의 식별 알고리즘)

  • Lee, Yong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.1
    • /
    • pp.29-37
    • /
    • 2020
  • Work to improve network throughput has been focused on network coding as the utilization of IoT-based application services increases and network usage increases rapidly. In network coding, nodes transform packets received from neighboring nodes into a combination of encoded packets for transmission and decoding at the destination. This scheme is based on trust among nodes, but in the IoT environment where nodes are free to join, a malicious node can fabricate the packet if it legally participates in the configuration. It is difficult to identify the authenticity of the encoded packet since the packet received at destination is not a single source but a combination of packets generated by several nodes. In this paper, we propose a method to detect "look-like-valid" packets that have been attacked and disguised in packets received at destination, and to identify valid messages in the reconstructions. This method shows that network coding performance is significantly improved because the destination can reconstruct a valid message with only received packets without retransmission with a high probability, despite the presence of disguised packets.

An E2E Mobility Management and TCP Flow Control Scheme in Vertical Handover Environments (버티컬 핸드오버 환경에서 종단간 이동성 관리 및 TCP 흐름 제어기법)

  • Seo Ki-nam;Lim Jae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.6B
    • /
    • pp.387-395
    • /
    • 2005
  • In this paper, we propose an end-to-end mobility management and TCP flow control scheme which considers different link characteristics for vertical handover environments. The end-to-end mobility management is performed by using SIP protocol. When a mobile node moves to a new network, it informs its movement of the correspondent node by sending SIP INFO message containing a new IP address which will be used in the new network. And then the corresponding node encapsulates all packets with the new IP address and sends them to the mobile node. in general, RTT of WLAN is shorter than RTT of cdma2000. when the MN moves from WLAN network to cdma2000 network, TCP retransmission timeout will be occurred in spite of non congestion situations. Thus, TCP congestion window size will be decreased and TCP throughput will be also decreased. To prevent this phenomenon, we propose a method using probe packets after handover to estimate a link delay of the new network. We also propose a method using bandwidth ratio of each network to update RTT. It is shown through NS-2 simulations that the proposed schemes can have better performance than the previous works.