• Title/Summary/Keyword: Distributed Retransmission

Search Result 22, Processing Time 0.02 seconds

The Mechanism for Reliable Group Communication Based on CORBA in Distributed Environment (분산환경에서 CORBA를 기반으로 한 신뢰성 있는 그룹통신기법)

  • 안계호;이재완
    • Journal of Internet Computing and Services
    • /
    • v.3 no.2
    • /
    • pp.79-85
    • /
    • 2002
  • In open communication architecture, application systems consist of objects distributed in lots of computing nodes. To reduce complexity of development. and management of distributed software, to manage efficiently distributed objects and to provide realtime service, the mechanisms for object group management and communication are needed in distributed environment. In this paper we compose object groups and provide reliable group communication mechanism based on CORBA which can adopt a new service without lots of changes on existing system. Group consist of some subgroups that subgroup manager manages for improving the efficiency of group management and message ordering is kept by using sequencer, Communication method among groups uses multicast based on paint to point communication as well as IP multicast and we provide high performance by using selective retransmission of message through message history, We analyze the performance of the proposed mechanism through simulation in distributed environment.

  • PDF

Desing of the High-Perfrimance Group Transport Protocol To support QoS for Distributed Multimedia Application over ATM (ATM 상에서 분산 멀티미디어 응용을 위한 서비스 품질을 지원하는 고성능 그룹 트랜스포트 프로토콜 설계)

  • Song, Byeong-Gwon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.4
    • /
    • pp.1059-1075
    • /
    • 1997
  • The transprot layer protocol for distrubuted multimedia applications in high speed network should gurantee the Quality of Serivce(QoS)requested by uwer.,The QoS Parmenters can be divied into two calssifications:those depend on the speed of a network such as bandiwidth,end-to-end transmission delay and throughput;and net- woek independent parameters such as various typed of group communications, retransmission method based on multimeda characteristic,acceptable packet wrror rate and transmission priority.In this proposed protocol,we divided user's QoS into performance redated parmeters and non-performance related parameters.The perform- ance-related paramenters are mapped into ATM traddic paramenters by the Distributed QoS Manger(DQM),the QoS manager,and the non-performance redlted paramenters are supported by the Distributed Multimedia Trans-port protocol(DMTP),a high-performance group transport protocol.Especially,becaues the DMTP is designed with considering the IP protocol,it can be efficiently used as an underlying protocol not onlu in ATM,but also in Ethernet,Token ring and FDDI LAN.

  • PDF

Enhancements of the Modified PCF in IEEE 802.11 WLANs

  • Kanjanavapastit Apichan;Landfeldt Bjorn
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.313-324
    • /
    • 2005
  • The success of the IEEE 802.11 standard has prompted research into efficiency of the different medium access methods and their support for different traffic types. A modified version of the point coordination function (PCF) called modified PCF has been introduced as a way to improve the efficiency over the standard method. It has been shown through a simulation study and a mathematical analysis that channel utilization can be much improved compared to the standard, in case there is no so-called hidden station problem. However, under the hidden station problem, the efficiency of the modified PCF would obviously decrease. In this paper, some enhancements of the modified PCF are introduced. Firstly, we propose a retransmission process to allow frames involved in collisions to be retransmitted. Then, we propose a collision resolution mechanism to reduce the frame collision probability due to the hidden station problem. In addition, we propose a priority scheme to support prioritization for different traffic types such as interactive voice and video, and real-time data traffic in the modified PCF. To prevent the starvation of one low priority traffic, minimum transmission period is also guaranteed to each traffic type via an admission control algorithm. We study the performance of the modified PCF under the hidden station problem and the performance of the modified PCF with priority scheme through simulations. To illustrate the efficiency of the priority scheme, we therefore compare its simulation results with those of some standardized protocols: The distributed coordination function (DCF), the enhanced distributed channel access (EDCA), the PCF, and our previously proposed protocol: The modified PCF without priority scheme. The simulation results show that the increment of delay in the network due to the hidden station problem can be reduced using the proposed collision resolution mechanism. In addition, in a given scenario the modified PCF with priority scheme can provide better quality of service (QoS) support to different traffic types and also support a higher number of data stations than the previous proposals.

A Modified DCF Protocol for Real-Time Multimedia Data (Real-Time MultiMedia Data 전송을 위한 새로운 방식의 DCF 프로토콜)

  • 신세영;심승섭;조경익;윤석진
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.157-163
    • /
    • 2003
  • IEEE 802.11a Distributed Coordination Function(DCF) Protocol을 사용하여 Real-Time MultiMedia Data의 전송을 수행할 경우, DCF Protocol의 적합하지 못한 Mechanism에 의하여, Data 전송의 극대화를 이루지 못한다. Retransmission이 반복되는 경우, Binary Slotted Exponential Backoff Mechanism은 거대한 Packet Delay와 Jitter의 원인이 되며 Automatic Repeat Request(ARQ) 방식의 Ack Mechanism은 MultiMedia Data를 전송하기에 적합하지 못하다. 본 논문은 위와 같은 문제점을 해결하기 위하여 Real-Time MultiMedia Data을 주로 전송하는 STA에 따른 Real-Time/Non-Real-Time(RT/NRT) Station(STA)의 구분과 보내고자 하는 Real-Time MultiMedia Data의 Network Traffic Load(The Required Bandwidth)를 고려하여, Modified DCF(mDCF) Protocol의 Modified Backoff(mBackOff), Modified BlockAck(mBlockAck) Mechanism을 제시함으로서, Data 전송의 극대화를 제공하며, 또한 IEEE 802.11a와의 호환성을 제공한다.

  • PDF

Variable Backoff Stage(VBS) Algorithm to Reduce Collisions in IEEE 802.11 DCF (IEEE 802.11 DCF 에서의 충돌 감소를 위한 가변 백오프 스테이지(VBS) 알고리즘)

  • Kang, Seongho;Choo, Young-yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.6
    • /
    • pp.1333-1340
    • /
    • 2015
  • IEEE 802.11 MAC(Media Access Control) defines DCF(Distributed Coordination Function) for data transmission control. BEB(Binary Exponential Backoff) algorithm of DCF has a problem that if the number of stations connected are over a certain threshold, it degrades network performance because of packet collisions caused from the minimum contention window size. To cope with this problem, we proposed a novel algorithm, named as VBS(Variable Backoff Stage) algorithm, which adjusts the rate of backoff stage increment depending on the number of stations associated with an AP(Access Point). Analytic model of proposed algorithm was derived and simulations on the BEB and the VBS algorithms have been conducted on the OFDM (Orthogonal Frequency Division Multiplexing) method. Simulation results showed that when the rate of backoff state increment was 5 and 10, the number of retransmission were reduced to 1/5 and 1/10 comparing to that of BEB, respectively. Our algorithm showed improvement of 19% and 18% in network utilization, respectively. Packet delay was reduced into 1/12.

Multicasting Multiple Description Coding Using p-cycle Network Coding

  • Farzamnia, Ali;Syed-Yusof, Sharifah K.;Fisal, Norsheila
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.3118-3134
    • /
    • 2013
  • This paper deliberates for a multimedia transmission scheme combining multiple description coding (MDC) and network coding (NC). Our goal is to take advantage from the property of MDC to provide quantized and compressed independent and identically distributed (iid) descriptions and also from the benefit of network coding, which uses network resources efficiently to recover lost data in the network. Recently, p-cycle NC has been introduced to recover and protect any lost or distorted descriptions at the receiver part exactly without need of retransmission. So far, MDC have not been explored using this type of NC. Compressed and coded descriptions are transmitted through the network where p-cycle NC is applied. P-cycle based algorithm is proposed for single and multiple descriptions lost. Results show that in the fixed bit rate, the PSNR (Peak Signal to Noise Ratio) of our reconstructed image and also subjective evaluation is improved significantly compared to previous work which is averaging method joint with MDC in order to conceal lost descriptions.

Broadcasting Message Reduction Methods in VANET

  • Makhmadiyarov, Davron;Hur, Soojung;Park, Yongwan
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.4 no.1
    • /
    • pp.42-49
    • /
    • 2009
  • Most Vehicular Ad hoc Network (VANET) applications rely heavily on broadcast transmission of traffic related information to all reachable nodes within a certain geographical area. Among various broadcast approaches, flooding is the first broadcasting technique. Each node rebroadcasts the received message exactly once, which results in broadcast storm problems. Some mechanisms have been proposed to improve flooding in Mobile Ad hoc Networks (MANET), but they are not effective for VANET and only a few studies have addressed this issue. We propose two distance-based and timer-based broadcast suppression techniques: 15P(15percent) and slotted 15P. In the first (distance based) scheme, node's transmission range is divided into three ranges (80%,15%and5%). Only nodes within 15% range will rebroadcast received packet. Specific packet retransmission range (15%) is introduced to reduce the number of messages reforwarding nodes that will mitigate the broadcaststorm. In the second (timer-based) scheme, waiting time allocation for nodes within 15% range isused to significantly reduce the broadcaststorm. The proposed schemes are distributed and reliedon GPS information and do not requireany other prior knowledge about network topology. To analyze the performance of proposed schemes, statistics such as link load and the number of retransmitted nodes are presented. Our simulation results show that the proposed schemes can significantly reduce link load at high node densities up to 90 percent compared to a simple broadcast flooding technique.

  • PDF

Throughput analysis of DCF protocol for packet applied to the nonmarkov process in the wireless LAN (비 마르코프 과정을 적용한 무선 LAN의 DCF 패킷 처리율 분석)

  • Ha, Eun-Sil
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.6
    • /
    • pp.1410-1418
    • /
    • 2007
  • This paper analyzes the throughput of DCF protocol at the MAC layer in the 802.11a wireless LAN. The throughput of DCF protocol is related on probability of backoff, depends on retransmission of each terminal. This paper applied to nonmarcov discrete model for each terminal BER in the base station versus the packet throughput is progressing with the data rate of 6,12,24,54 Mbps, We find the fact that the less the data rate be the higher the throughput. We also find from the throughput calculation by means of traffic intensity in OFDM wireless LAN.

  • PDF

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.

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