• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.501-515
• /
• 2006

The IEEE 802.11 protocol is the most mature technology for WLANs(Wireless Local Area Networks). However, as the number of stations increases, the delay and throughput performance of IEEE 802.11 MAC(Medium Access Control) degrades severely. In this paper, we present the comprehensive performance analysis of IEEE 802.11 MAC protocol by investigating the MAC layer packet service time when arrival packet sizes have a general probability distribution. We obtain the discrete probability distribution of the MAC layer service time. By using this, we analyze the system throughput and the MAC layer packet service time of IEEE 802.11 MAC protocol in wireless LAN environment. We take some numerical examples for the system throughput and the mean packet service time for several special distributions of arrival packet sizes.

• 산업경영시스템학회지
• /
• 제30권1호
• /
• pp.59-65
• /
• 2007

HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Service), nrtPS(non-real time Polling Service), and BE (Best Effort) under different QoS (Quality of Service) requirements and limited wireless channel resources, efficient packet scheduling mechanisms are necessary to increase the utilization of channels as well as to satisfy the various QoS requirements. This study regards the traffic data to be served as time series and proposes a new packet scheduling algorithm based on the nonparametric statistical test. The performance of the newly proposed algorithm is evaluated through the simulation analysis using a simulator that can evaluate the performance of packet scheduling mechanisms under various values of system parameters and measures such as packet delay time, data transmission rate, number of loss packets, and channel utilization.

• 인터넷정보학회논문지
• /
• 제18권6호
• /
• pp.65-73
• /
• 2017

Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2004년도 춘계학술대회 논문집
• /
• pp.43-48
• /
• 2004

인터넷 환경에서 실시간 서비스에 대한 제공을 위해 제안된 RTP(Real-time Transport Protocol)는 실시간 전송 프로토콜로서 스트림형 데이터 전송을 목적으로 한 프의토콜이다. RTP는 기본적으로 RTCP(Real-time Transport Control Protocol)와 쌍을 이루어 동작하며, RTCP는 현재 네트워크의 상태 정보를 전달한다. RTP는 종단 시스템에서 실행되고, 디멀티플랙싱을 제공하는 전송 프로토콜의 중요한 특성을 가지고 있다. 또한, TCP 같은 전송 프로토콜에서 제공하지 못하는 신뢰성과, 프로토콜에 정의된 흐름/혼잡제어를 제공한다. 본 논문에서는 RTP상에서 동작하는 Differentiated Service의 개념과 구조를 살펴보고, Differentiated Service상에서 효율적인 패킷전송을 위해 CBQ(Class-Based Queuing)을 사용한 패킷 전송 모델의 파라미터를 설정함으로써 각자의 서비스 큐를 적절하게 제어하고, WRR(Weighted Round Robin)과 PRR(Packet-by-packet Round Robin) 같은 패킷 스케줄링 기법을 통해서 모든 서비스 클래스들이 기아현상을 경험하지 않고 공평한 스케줄링이 이루어지도록 컴퓨터 모의실험을 통해 성능을 확인한다.

• 대한전자공학회논문지TC
• /
• 제39권12호
• /
• pp.539-546
• /
• 2002

본 논문에서의 패킷 스케줄러는 무선 채널 환경에서 실시간 비디오 트래픽과 비실시간 인터넷 트래픽을 동시에 서비스한다. 그리고 실시간 트래픽에 대한 지연을 감소 시기키 위하여 누적카운터와 SIR값을 동시에 고려하는 새로운 패킷 스케줄링 알고리즘을 제안한다. 본 알고리즘에서는 실시간 트래픽을 비실시간 트래픽에 비하여 우선적으로 처리한다. 시뮬레이션 결과를 고찰할 때, 실시간 비디오 트래픽과 같이 지연성능에 민감한 서비스의 경우에는 AC(Accumulation Counter) 방식이 기존의 M-LWDF방식보다 더 적합한 알고리즘으로 관찰되었다. 본 논문에서는 HSDPA 시스템과 유사한 구조를 채택하여 시간 축으로는 프레임 주기를 가지며 동시에 코드 축으로는 OVSF 코드를 사용할 수 있는 구조를 채택하여 모의 실험을 수행하였다.

• 한국경영과학회지
• /
• 제19권3호
• /
• pp.1-14
• /
• 1994

In this paper, an analytical model of the message delay in the DQDB (Distributed Queue Dual Bus) network is investigated. The DQDB network has been adopted as a subnetwork for the IEEE 802 MAN (Metropolitan Area Network) standard. The DQDB network consists of two high speed undirectional buses and a series of stations attached to both of the buses. Massages arriving at each station consists of severla packets according to its size. This system is approximated into " $B^{[x]}$/G/1 with exceptional first service queueing " by defining the concept of service time on a packet. The service time for a packet is defined as the time from the instant the packet arrives at the transmission buffer until the time the packet is fully transmitted. By using the BASTA property and the average work in the system, the mean message delay time is obtained.age work in the system, the mean message delay time is obtained.d.

• Journal of Communications and Networks
• /
• 제11권1호
• /
• pp.36-41
• /
• 2009

The IEEE 802.16 wireless metropolitan area network (WMAN) standard is designed to correct expensive communication costs in CDMA-based mobile communication systems and limited coverage problems in wireless LAN systems. Thus, the IEEE 802.16e standard can provide mobile high-speed packet access between mobile stations and the Internet service provider through the base station with cheap communication fees. To efficiently accommodate voice over IP (VoIP) services in IEEE 802.16 systems, an uplink quality of service packet-scheduling scheme is proposed, and its performance is evaluated with an NS-2 network simulator in this paper. Numerical results show that this proposed scheme can increase the system capacity by 100% more than in the unsolicited rand service (UGS) scheme and 30% more than the extended real-time polling service (ertPS) scheme, respectively.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 심포지엄 논문집 정보 및 제어부문
• /
• 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.

• 전자공학회논문지 IE
• /
• 제48권3호
• /
• pp.16-19
• /
• 2011

차등화 서비스는 패킷 표식에 근거하여 IP 패킷의 서비스 품질을 보장하는 기법으로 패킷들은 사용자의 요구에 따라 우선 순위가 다르게 부여된다. 혼잡한 시기에는 낮은 우선순위의 패킷들이 높은 우선순위의 패킷들보다 더 많이 폐기된다. 패킷에 표식을 달기 위한 방법을 결정하기 위해 다양한 정책 모델들이 사용된다. 본 논문은 3 색 표식을 갖는 타임 슬라이딩 윈도우의 정책 모델을 사용하는 차등화 서비스의 성능을 고찰하였다. NS-2를 이용한 실험 결과, 차등화 서비스를 적용하여 사용자가 요구하는 서비스 품질을 제공할 수 있음을 확인하였다.

• ETRI Journal
• /
• 제28권1호
• /
• pp.31-44
• /
• 2006

In a packet switching network, congestion is unavoidable and affects the quality of real-time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well-known solutions for quality-of-service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.