• Title/Summary/Keyword: packet data

Search Result 1,636, Processing Time 0.025 seconds

Admission Control for Voice and Stream-Type Data Services in DS-CDMA Cellular System (직접 대역확산 부호분할 시스템에서 음성 및 흐름형 데이터 서비스를 위한 호 수락제어 기법)

  • Chang Jin-weon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9A
    • /
    • pp.737-748
    • /
    • 2005
  • Two flexible admission control schemes for integrated voice and stream-type data services are proposed in DS-CDMA systems. Most Previous studies on admission control have focused on integration of short, bursty Packet-type data services and conventional voice services. However, stream-type data services with a relatively long service holding time are expected to be a considerable portion of data traffic in future generation cellular systems. Scheme I is a basic scheme that accommodates both voice and data services with full bandwidth. However, voice services are given priority over data services using the duration difference between the holding times for these services. Scheme ll uses a different method to efficiently give priority to voice services over stream-type data services. An additional interference margin for voice services is provided by suppressing interference from stream-type data services according to voice access requests and a varying interference status. Performance of the two schemes is evaluated by developing Markovian models. Numerical results show that the voice capacity is highly sensitive to the service holding time of data services while the performance measures of data services are not highly sensitive. Scheme H is a significant improvement over Scheme I for accommodating voice and stream-type data services

Design to Realtime Test Data Topic Utilize of Data Distribution Service (데이터 분산 서비스를 활용한 실시간 시험자료 토픽 설계)

  • Choi, Won-gyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.7
    • /
    • pp.1447-1454
    • /
    • 2017
  • The realtime test data topic means that process for the data efficiently from many kinds of measurement device at the test range. There are many measurement devices in test range. The test range require accurate observation and determine on test object. In this realtime test data slaving framework system, the system can produce variety of test informations and all these data also must be transmitted to test information management or display system in realtime. Using RTI DDS(Data Distribution Service) middle ware Ver 5.2, we can product the efficiency of system usability and QoS(Quality of Service) requirements. So the application user enables to concentrate on applications, not middle ware. As the reason, Complex function is provided by the DDS, not the application such as Visualization Software. In this paper, I suggest the realtime test data topic on slaving framework of realtime test data based on DDS at the test range system.

Motion Vector Recovery Based on Optical Flow for Error Concealment (전송 오류를 은닉하기 위한 옵티컬 플로우 기반의 움직임 벡터 복원)

  • Suh, Jae-Won;Ho, Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.6
    • /
    • pp.630-640
    • /
    • 2002
  • The compressed video bitstream is very sensitive to transmission errors. If we lost packet or received with errors during the transmission, not only the current frame will be corrupted, but also errors will propagate to succeeding frames. Error concealment is a data recovery technique that enables the decoder to conceal effects of transmission errors by predicting the lost or corrupted video data from the previously reconstructed error free information. Motion vection recovery and motion compensation with the estimated motion vector is a good approach to conceal the corrupted macroblock data. In this paper, we prove that it is reasonable to use the estimated motion vector to conceal the lost macroblock by providing macroblock distortion models. After we propose a new motion vector recovery algorithm based on optical flow fields, we compare its performance to those of conventional error concealment methods. The proposed algorithm has smaller computational complexity than those of conventional algorithms.

A Push-Caching and a Transmission Scheme of Continuous Media for NOD Service on the Internet (인테넷상에서 NOD 서비스를 위한 연속미디어 전송 및 푸쉬-캐싱 기법)

  • Park, Seong-Ho;Im, Eun-Ji;Choe, Tae-Uk;Jeong, Gi-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.6
    • /
    • pp.1766-1777
    • /
    • 2000
  • In multimedia new service on the internet, there are problems such as server overload, network congestion and initial latency. To overcome these problems, we propose a proxy push-caching scheme that stores a portion of continuous media stream or entire stream, and a transmission scheme of NOD continuous media, RTP-RR and RTP-nR to exploit push-caching scheme. With the proposed push-caching scheme, NOD server pushes fixed portion of stream to a proxy when new data is generated, and the cached size of each stream changes dynamically according to the caching utility value of each stream. As a result, the initial latency of client side could be reduced and the amount of data transmitted fro ma proxy server to client could be increased. Moreover, we estimate a caching utility value of each stream using correlation between disk space occupied by the stream and the amount of data stream requested by client. And we applied the caching utility value ot replacement policies. The performance of the proxy push-caching and continuous media transmission schemes proposed were compared with other schemes using simulations. In the simulation, these schemes show better results than other schemes in terms of BHR (Byte Hit Rate), initial latency, the number of replacement and packet loss rate.

  • PDF

Performance Modelling of Adaptive VANET with Enhanced Priority Scheme

  • Lim, Joanne Mun-Yee;Chang, YoongChoon;Alias, MohamadYusoff;Loo, Jonathan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.4
    • /
    • pp.1337-1358
    • /
    • 2015
  • In this paper, we present an analytical and simulated study on the performance of adaptive vehicular ad hoc networks (VANET) priority based on Transmission Distance Reliability Range (TDRR) and data type. VANET topology changes rapidly due to its inherent nature of high mobility nodes and unpredictable environments. Therefore, nodes in VANET must be able to adapt to the ever changing environment and optimize parameters to enhance performance. However, there is a lack of adaptability in the current VANET scheme. Existing VANET IEEE802.11p's Enhanced Distributed Channel Access; EDCA assigns priority solely based on data type. In this paper, we propose a new priority scheme which utilizes Markov model to perform TDRR prediction and assign priorities based on the proposed Markov TDRR Prediction with Enhanced Priority VANET Scheme (MarPVS). Subsequently, we performed an analytical study on MarPVS performance modeling. In particular, considering five different priority levels defined in MarPVS, we derived the probability of successful transmission, the number of low priority messages in back off process and concurrent low priority transmission. Finally, the results are used to derive the average transmission delay for data types defined in MarPVS. Numerical results are provided along with simulation results which confirm the accuracy of the proposed analysis. Simulation results demonstrate that the proposed MarPVS results in lower transmission latency and higher packet success rate in comparison with the default IEEE802.11p scheme and greedy scheduler scheme.

Bypass Generation Mechanism using Mobility Prediction for Improving Delay of AODV in MANET (AODV의 전송 지연 향상을 위한 이동성 예측을 이용한 우회 경로 생성 기법)

  • Youn, Byungseong;Kim, Kwangsoo;Kim, Hakwon;Roh, Byeong-Hee
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.12
    • /
    • pp.694-699
    • /
    • 2014
  • In mobile ad-hoc networks (MANET), the network topology and neighboring nodes change frequently, since MANET is composed of nodes that have mobility without a fixed network infrastructure. The AODV routing protocol is advantageous for MANET, but AODV has a delay in the transmission of data packets because AODV can not transmit data during route recovery. This paper proposes solving the above problem of AODV by using a bypass generation mechanism for data transmission during route recovery. For further improvement, additional mechanisms that coordinate the reception threshold of a hello packet are proposed in order to improve the accuracy of the information obtained from the neighboring nodes when the bypass is generated due to a link failure and the immediacy of the route recovery. Simulation results show that the proposed technique improves the performance in terms of the delay in transmission compared to traditional AODV.

Internet Audio Broadcasting Technology Using MPEG-2 AAC Streaming (MPEG-2 AAC 스트리밍을 이용한 인터넷 오디오 방송기술)

  • 이태진;홍진우
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.2
    • /
    • pp.93-101
    • /
    • 2002
  • This paper presents the Internet audio broadcasting technology based on the streaming technology. In this paper, we choose the MPEG-2 AAC for multimedia data, and for the streaming of this data we use RTP/RTCP protocol. We use RTSP protocol for the control of streaming data and TCP/IP for the exchange of information between server and client. By using all of these protocols and MPEBG-2 AAC, we explain the implementation method for the unicast/multicast streaming server/client system. Our system was tested by ETRI intranet, which is connected by 2000 researchers. Experimental result show that our system can be process the packet loss and jitter by retransmission and variable length buffer. Multicast streaming server can be used for the audio broadcasting service inside the company, unicast streaming server can be used for the AOD (Audio On Demand) service.

Performance Analysis of Group Scheduling with Look-Ahead Algorithm for Optical Burst Switching Networks (광 버스트 스위칭 네트워크에서 Look-Ahead 알고리즘을 적용한 그룰 스케줄링의 성능 분석)

  • Shin, Jong-Dug;Jang, Won-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12B
    • /
    • pp.1037-1043
    • /
    • 2006
  • There has been proposed an algorithm to reduce data burst processing delay in group scheduling in core nodes of optical burst switching networks. Since, in this algorithm, look-up tables containing all the void time information in scheduling windows are generated as soon as the primary group scheduling session terminates, it becomes faster to reassign dropped data bursts to proper voids in different data channels by referring to the tables. The group scheduling with this algorithm showed almost the same channel utilization as the one without using the algorithm but performed a little better in both burst loss probability and wavelength conversion rate. On the other hand, per-burst processing time has been reduced dramatically in the load region of higher than 0.8, showing a factor of 2.1 reduction at 0.9.

An Adaptive UDT Rate Control Method on Network Traffic Condition (네트워크 트래픽 상태에 적응적인 UDT Rate Control 기법)

  • An, Do-Sik;Wang, Gi-Cheol;Kim, Seung-Hae;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.3
    • /
    • pp.19-27
    • /
    • 2011
  • Due to the growth of optical fiber network technologies, most networks recently support several tens of Gb/s bandwidth. UDT(UDP-based Data Transfer protocol) is an optimized protocol for bulk data transmission on the network, which has the high bandwidth and long delay time. It periodically controls the sending rate on the fixed sync-interval, 0.01 sec. Here, if the network traffic status varies quickly, available network bandwidth is not able to be properly utilized in-between the sync-intervals. In this paper, we propose an adaptive rate control method with considering the network traffic status in-between the sync-interval periods. The network traffic status is determined based on the RTT variances. With dividing the network status into four classes, the proposed method performs a new rate control by adjusting the inter-packet sending period for a corresponding class. As a simulation result, the proposed method improves the message delivery throughput as well as stability than that of the existing UDT Protocol.

Distance and Probability-based Real Time Transmission Scheme for V2V Protocol using Dynamic CW allocation (V2V 프로토콜에서 실시간 전송을 위한 동적 CW 할당 기법)

  • Kim, Soo-Ro;Kim, Dong-Seong;Lee, Ho-Kyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.2
    • /
    • pp.80-87
    • /
    • 2013
  • This paper proposes a CW (Contention window) allocation scheme for real-time data transmission of emergency data on VANET (Vehicle to vehicle Ad hoc Network, V2V) protocol. The proposed scheme reduces the probability of packet collisions on V2V protocol and provides bandwidth efficiency with short delay of emergency sporadic data. In the case of high density traffic, the proposed scheme provides a decrease of recollision probability using dynamic CW adjustments. For the performance analysis, a throughput, end-to-end delays, and network loads were investigated on highway traffic. Simulation results show the performance enhancements in terms of the throughput, end-to-end delays, and network loads.