• 제목/요약/키워드: Traffic transmission scheme

검색결과 317건 처리시간 0.028초

Traffic and Resource Management for Provisioning QoE in Mobile Communication Networks

  • Lee, Moon-Ho;Lee, Jong-Chan
    • Journal of the Korea Society of Computer and Information
    • /
    • 제21권11호
    • /
    • pp.65-71
    • /
    • 2016
  • This paper proposes a novel traffic and resource management scheme based on Service Level Agreement (SLA) which allows to guarantee the quality of experience (QoE) for various high-quality mobile multimedia service users to a certain level. For this purpose, QoE-SLA coupling structure is considered and a novel scheme is suggested to suppress the processing delay of the mobile terminal and to decrease the transfer delay in the transmission network. According to simulation results, our proposed scheme can increase the total throughput and decrease the average delay by adjusting SLA.

Space and Time Priority Queues with Randomized Push-Out Scheme (확률적 밀어내기 정책을 가지는 공간-시간 우선순위 대기행렬)

  • Kilhwan Kim
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • 제46권2호
    • /
    • pp.57-71
    • /
    • 2023
  • In this study, we analyze a finite-buffer M/G/1 queueing model with randomized pushout space priority and nonpreemptive time priority. Space and time priority queueing models have been extensively studied to analyze the performance of communication systems serving different types of traffic simultaneously: one type is sensitive to packet delay, and the other is sensitive to packet loss. However, these models have limitations. Some models assume that packet transmission times follow exponential distributions, which is not always realistic. Other models use general distributions for packet transmission times, but their space priority rules are too rigid, making it difficult to fine-tune service performance for different types of traffic. Our proposed model addresses these limitations and is more suitable for analyzing communication systems that handle different types of traffic with general packet length distributions. For the proposed queueing model, we first derive the distribution of the number of packets in the system when the transmission of each packet is completed, and we then obtain packet loss probabilities and the expected number of packets for each type of traffic. We also present a numerical example to explore the effect of a system parameter, the pushout probability, on system performance for different packet transmission time distributions.

An Improved DWRR Cell Scheduling Algorithm based on the QoS of Delay (지연 특성을 고려한 개선된 DWRR 셀 스케쥴링 알고리즘)

  • 곽지영;김체훤;김두현;남지승
    • Proceedings of the IEEK Conference
    • /
    • 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
    • /
    • pp.81-84
    • /
    • 2000
  • Scheduling algorithm proposed in this paper is based on both DWRR(Dynamic Weighed Round Robin) method and QLT(Queue Length Threshold) method. The proposed scheduling algorithm guarantees delay property of realtime traffic, not considered in previous DWRR method, with serving realtime traffic preferentially by using RR(Round Robin) method which service each channel equally and QLT algorithm that is dynamic time priority method. Proposed cell scheduling algorithm may increase some complexity over conventional DWRR scheme because of delay priority based cell transmission method. However, due to reliable ABR service and congesition avoidance capacity, proposed scheduling algorithm has good performance over conventional DWRR scheme. Also, delay property based cell transmission method in proposed algorithm minimizes cell delay and requires less temporary buffer size

  • PDF

An Energy Saving Scheme for Multilane-Based High-Speed Ethernet

  • Han, Kyeong-Eun;Yang, Choong-Reol;Kim, Kwangjoon;Kim, Sun-Me;Lee, Jonghyun
    • ETRI Journal
    • /
    • 제34권6호
    • /
    • pp.807-815
    • /
    • 2012
  • In this paper, we propose a scheme for partially dynamic lane control for energy saving in multilane-based high-speed Ethernet. In this scheme, among the given transmission lanes, at least one lane is always operating, and the remaining lanes are dynamically activated to alleviate the network performance in terms of queuing delay and packet loss in the range of acceptance. The number of active lanes is determined by the decision algorithm based on the information regarding traffic and queue status. The reconciliation sublayer adjusts the transmission lane with the updated number of lanes received from the algorithm, which guarantees no processing delay in the media access control layer, no overhead, and minimal delay of the exchanging control frames. The proposed scheme is simulated in terms of queuing delay, packet loss rate, lane changes, and energy saving using an OPNET simulator. Our results indicate that energy savings of around 55% (or, when the offered load is less than 0.25, a significant additional savings of up to 75%) can be obtained with a queuing delay of less than 1 ms, a packet loss of less than $10^{-4}$, and a control packet exchange time of less than $0.5{\mu}s$ in random traffic.

RASE Acquisition Algorithm of Ultra Wideband System for Car Positioning and Traffic Light Control (차량 위치추적기반 교통신호등 제어용 UWB 시스템의 Acquisition 알고리즘 연구)

  • Hwang, In-Kwan;Park, Yun-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제30권10C호
    • /
    • pp.992-998
    • /
    • 2005
  • In this paper, An Ultra Fast Acquisition Algorithm of low transmission rate ultra-wideband(UWB) systems for car positioning and traffic light controling is proposed. Since the acquisition algorithms for CDMA system are not fast enough to access the low transmission rate UWB systems, the new ultra fast acquisition scheme which can be implemented with low cost and simplified circuit is required. The proposed algorithm adopted the Recurrent Sequential Estimation scheme and trinomial M-sequence. Therefore, The proposed scheme can reduce the average acquisition time in $1\~3{\mu}sec$ with simple circuit, even for the UWB systems which use long pseudo-noise(PN) sequence and transmit low power below the FCC EIRP emission limits. The simulation results for the average acquisition time of the proposed scheme are compared with the ones of the existing acquisition schemes.

Prediction-Based Reliable Data Forwarding Method in VANET (차량 네트워크에서 예측 기반의 안정적 데이터 포워딩 기법)

  • Kim, Minho;Joo, Changhee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제42권1호
    • /
    • pp.128-139
    • /
    • 2017
  • Vehicular Ad hoc Network (VANET) is one of technologies to realize various ITS services for safe driving and efficient traffic control. However, data delivery in VANETs is complicated due to high mobility and unreliable wireless transmission. In this paper, we develop a novel forwarding scheme to deliver packets in a reliable and timely manner. The proposed forwarding scheme uses traffic statistics to predict the encounter of two vehicles, and optimize its forwarding decision by taking into consideration the probability of successful transmission between them at the encounter place. We evaluate our scheme through simulations and show that our proposed scheme provides reliable data delivery in VANETs.

Dual Mode Packet Transmission Scheme using a Dynamic Switching Threshold in the IMT-2000 (IMT-2000에서 동적 스위칭 임계점을 이용하는 이중 모드 패킷 전송방식)

  • 김장욱;반태원;오창헌;조성준
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제7권5호
    • /
    • pp.907-915
    • /
    • 2003
  • A very efficient packet transmission scheme is needed in the radio environment where radio resource is insufficient as compared with the environment of the wired communication. In general, dual mode packet transmission scheme is used broadly. Packets are transmitted through the dedicated or common chamois according to a switching criterion. The general criteria are the length and generation frequency of packet, that is, large and frequent packets are transmitted using a dedicated channel and small and infrequent packets are transmitted using a common channel. The performance of dual mode packet transmission scheme is closely related to the switching criteria. However, it is very difficult to find the optimal switching point because that is not fixed but variable according to the environment such as traffic load, length of generated packets, and the number of channels. In this paper, a new scheme for the dual mode packet transmission scheme using a dynamic switching threshold is proposed where the switching threshold is not fixed but variable according to the network environment. The performance of the proposed method is analyzed using a simulation. From the simulation results, it is shown that the performance of the proposed scheme is not very influenced by the network environment unlike the conventional dual mode packet transmission scheme.

A Study on the Performance Enhancements of Video Streaming Service in MPLS Networks (MPLS 망을 통한 Video Streaming Service의 성능 개선에 관한 연구)

  • Kim Choong-Hyun;Kim Young-Beom
    • Journal of the Institute of Convergence Signal Processing
    • /
    • 제7권2호
    • /
    • pp.60-64
    • /
    • 2006
  • In typical video streaming services such as MPEG encoded video, the transmission data sizes change depending on the frame types and the required bandwidth for QoS support also changes as time passes. Accordingly, in video streaming services using the Internet it could happen that the video services stop occasionally due to instantaneous deficiencies of the required bandwidth under unexpected congestion even if the highest priority is allocated to the service by network administration. In this paper, we investigate several methods for bandwidth allocation and traffic engineering to support MPEG video traffic and propose a new method to reduce the transmission delay and enhance the throughput, there by provisioning the QoS requirements. In the proposed scheme, LSPs are established based on temporal variation patterns of the Internet traffic and the CQ_LLQ policing scheme is applied for traffic shaping at the ingress routers. Finally we verified the performance of the proposed scheme via computer simulations using OPNET.

  • PDF

Differentiated Channel Access Scheme for Assuring QoS of Medical Traffic in WLAN-based e-Healthcare Systems (무선랜 기반 e-Healthcare 시스템에서의 의료용 트래픽의 서비스 품질 보장을 위한 채널 접속 차별화 방안)

  • Kim, Young Boo;Park, Eun-Chan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • 제20권6호
    • /
    • pp.676-688
    • /
    • 2014
  • The IEEE 802.11e EDCA (Enhanced Distributed Channel Access) mechanism has been proposed to improve the QoS (Quality of Service) of various services in WLANs (Wireless Local Area Networks). By differentiating the channel access delay depending on ACs (Access Categories), this mechanism can provide the relative service differentiation among ACs. In this paper, we consider that WLAN is deployed in medical environments to transfer medical traffic and we reveal that the quality of the medical traffic (in particular, ECG signals) is significantly deteriorated even with the service differentiation by IEEE 802.11e EDCA. Also, we analyze the reason for performance degradation and show that IEEE 802.11e EDCA has difficulty in protecting the transmission opportunity of high-priority traffic against low-priority traffic. In order to assure medical-grade QoS, we firstly define the service priority of medical traffic based on their characteristics and requirements, and then we propose the enhanced channel access scheme, referred to as DIFF-CW. The proposed scheme differentiates CW (Contention Window) depending on the service priority and modifies the channel access procedure for low-priority traffic. The simulation results confirm that the DIFF-CW scheme not only assures the QoS of medical traffic but also improves the overall channel utilization.

A channel assignment scheme considering traffic characteristics in the CDMA cellular system (트래픽 특성을 고려한 CDMA 셀룰러 시스템에서의 채널 할당 방법)

  • 권수근;조무호;전형구;안지환;조경록
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제21권11호
    • /
    • pp.2817-2827
    • /
    • 1996
  • In this paper, we propose a new channel assignment scheme considering traffic characteristics in the CDMA cellular system. The object of proposed method is to reduce the hard handoff of data calls which are very sensitive to transmission errors. In this algorithm, we use three channel assignment policies. First, all of the data calls are assigned to the primary CDMA channel if possible. Second, priority for primary CDMA channel is given to data calls by assigning some primary CDMA traffic channels exclusively for data calls. Third, data calls are assigned to the CDMA channel most served by neighbor cells, when all of the primary CDMA traffic channels are used. A performance analysis shows the minimum soft handoff probability of data calls in handoff which is guarantied any cellconfiguration is increased above 40% by the adopting proposed algorithm.

  • PDF