• 제목/요약/키워드: Mean Packet Delay

검색결과 65건 처리시간 0.026초

Delay Analysis for Packet Forward Scheme in Wireless Packet Networks

  • Koh, Seung-Kwang;Park, Cheon-Won
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 추계종합학술대회 논문집
    • /
    • pp.121-124
    • /
    • 1999
  • In a packet-switched wireless cellular network, a packet destined to a mobile station is queued at a base station and then broadcast over the base station's cell. When an active mobile station leaves a cell, there re-main packets which are destined to the mobile and not yet delivered to it at the cell's base station. For application which are sensitive to packet losses, such back- logged packets must be forwarded to the new base station. Otherwise, an end-to-end retransmission may be required. However, an increase in packet delay is incurred by employing the packet forward scheme, since a packet may be forwarded many times before it is delivered to the destined mobile station. For an enhanced quality-of-service level, it is preferred to reduce tile packet delay time. In this paper, we develop an analytical approximation method for deriving mean packet delay times. Using the approximation and simulation methods, we investigate the effect of network parameters on the packet delay time.

  • PDF

시변 패킷 기반 무선 링크에서 정지-대기 ARQ 기반 메시지의 지연 시간 분석 (Delay Analysis of a Message based on the Stop-and-Wait ARQ in a Time- Varying Radio Link)

  • 정명순;박홍성
    • 한국통신학회논문지
    • /
    • 제28권9A호
    • /
    • pp.684-693
    • /
    • 2003
  • 본 논문에서는 시변 패킷 기반 무선 링크에서 메시지와 패킷의 전송 지연 시간을 분석하였다. 메시지는 베르누이(Bernoulli) 프로세스에 따라 도착하고 생성되는 메시지의 길이는 지수 분포를 가진다고 가정하였다. 또한 시간 변이성을 가지는 무선 링크의 특성을 반영하기 위하여 2-상태 마코프 모델을 사용하여 해석하였다. 이 마코프 모델로부터, 패킷의 도착율과 패킷 전송 서비스 시간, 무선 링크의 평균 PER(packet error rate)의 항으로 패킷의 평균 전송 지연 시간과 평균 큐 길이를 해석적으로 분석하였고, 이러한 패킷의 성능 지표들로부터 메시지의 전송지연 시간 및 큐 길이를 유도하였다. 수치적 결과로부터 시변 패킷 기반 무선 링크의 안정적 동작과 전송 성능을 보장하기 위해서는 PER에 따라 메시지 도착율 및 길이가 제한되어야 한다는 것을 알 수 있었다. 또한 성능에는 각 상태의 머무는 시간보다 PER의 영향이 큼을 알 수 있었다.

THE MAC LAYER PACKET SERVICE TIME DISTRIBUTIONS OF DCF IN THE IEEE 802.11 PROTOCOL

  • Han Dong-Hwan;Park Chul-Geun
    • 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.

DQDB (Distributed Queue Dual Bus) 프로토콜의 성능분석 (Performance Analysis of the DQDB Protocol)

  • 이창훈;박광만;홍정완
    • 한국경영과학회지
    • /
    • 제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.

  • PDF

평균패킷지연시간과 노드연결성 제약된 네트워크 설계를 위한 Scatter Search 알고리즘 (A Scatter Search Algorithm for Network Design with Mean Packet Delay and Node Connectivity Constraints)

  • 이한진;염창선
    • 산업경영시스템학회지
    • /
    • 제34권1호
    • /
    • pp.33-41
    • /
    • 2011
  • This paper considers a topological optimization of a network design with mean packet delay and node connectivity constraints. The objective is to find the topological layout of links, at minimal cost. This Problem is known to be NP-hard. To efficiently solve the problem, a scatter search algorithm is proposed. An illustrative example is used to explain and test the proposal approach. Experimental results show evidence that the proposal approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic approach.

End-to-End Quality of Service Constrained Routing and Admission Control for MPLS Networks

  • Oulai, Desire;Chamberland, Steven;Pierre, Samuel
    • Journal of Communications and Networks
    • /
    • 제11권3호
    • /
    • pp.297-305
    • /
    • 2009
  • Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks without rerouting already admitted flows. We propose two mathematical programming models for this problem. The first model includes end-to-end delay constraints and the second one, end-to-end packet loss constraints. These end-to-end QoS constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. The objective function of both models is to minimize the end-to-end delay for the new flow. Numerical results show that considering end-to-end delay (or packet loss) constraints for all flows has a small impact on the flow blocking rate. Moreover, we reduces significantly the mean end-to-end delay (or the mean packet loss rate) and the proposed approach is able to make its decision within 250 msec.

QUEUEING ANALYSIS OF GATED POLLING SYSTEM FOR DYNAMIC BANDWIDTH ALLOCATION SCHEME IN AN EPON

  • Park, Chul-Geun;Kim, Ba-Ra;Han, Dong-Hwan
    • Journal of applied mathematics & informatics
    • /
    • 제16권1_2호
    • /
    • pp.469-481
    • /
    • 2004
  • In this paper, we investigate the mean queue length and the mean packet delay of a dynamic bandwidth allocation(DBA) scheme in an Ethernet passive optical network(EPON). We focus on the interleaved polling system with a gated service discipline. We assume that input packets arrive at an optical network unit(ONU) according to Poisson process. We use a continuous time queueing model in order to find the queue length distribution of the gated interleaved polling system with the first stage input queue and the second stage transmission queue. We give some numerical results to investigate the mean queue lengths and mean packet delays for the symmetric polling system with statistically identical stations.

Delay analysis for a discretionary-priority packet-switching system

  • Hong, Sung-Jo;Takagi, Hideaki
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
    • /
    • pp.729-738
    • /
    • 1995
  • We consider a priority-based packet-switching system with three phases of the packet transmission time. Each packet belongs to one of several priority classes, and the packets of each class arrive at a switch in a Poison process. The switch transmits queued packets on a priority basis with three phases of preemption mechanism. Namely, the transmission time of each packet consists of a preemptive-repeat part for the header, a preemptive-resume part for the information field, and a nonpreemptive part for the trailer. By an exact analysis of the associated queueing model, we obtain the Laplace-Stieltjes transform of the distribution function for the delay, i.e., the time from arrival to transmission completion, of a packet for each class. We derive a set of equations that calculates the mean response time for each class recursively. Based on this result, we plot the numerical values of the mean response times for several parameter settings. The probability generating function and the mean for the number of packets of each class present in the system at an arbitrary time are also given.

  • PDF

분산 무선망에서 CSMA를 사용한 무선 통신 시스템의 모델링 및 성능 분석 (Modeling and Evaluation of Wireless Communication System using CSMA inthe Distributed Packet Radio Network)

  • 조병록;최형진;박병철
    • 한국통신학회논문지
    • /
    • 제18권10호
    • /
    • pp.1508-1517
    • /
    • 1993
  • 본 논문에서는 분산 무선망에서 CSMA프로토콜을 사용한 무선통신 시스템을 모델링하고, 컴퓨터로 시뮬레이션을 수행하여 패킷의 도착율(arrival rate) 함수에 의한 평균 END-to-END 지연특성을 살펴보았고, 또 모델링 을 수학적으로도 해석하였다. 이 무선 통신시스템은 단방향 통신방식으로 비동기식 1-persistent CSMA프로토콜을 사용하였으며, 또 모든 무선 통신시스템들이 근거러 영역에 적절하게 위치하고 있다고 가정하였고, 트래픽이 공용채널에 포아송 분포를 이루고 있다고 가정하였다. 이 모델의 해석에서는 무선 통신시스템이 breakdown 특성을 갖는 M/D/1 모델을 기본으로 하였다. 결과적으로 본 논문의 모델에 기초한 무선망은 패킷도착율이 2(packet/sec) 미만인 경우 평균지연시간이 패킷전송시간의 2배정도로 잘 동작됨을 확인할 수 있다.

  • PDF

QUEUEING ANALYSIS OF GATED-EXHAUSTIVE VACATION SYSTEM FOR DBA SCHEME IN AN EPON

  • HAN DONG HWAN;PARK CHUL GEUN
    • Journal of applied mathematics & informatics
    • /
    • 제17권1_2_3호
    • /
    • pp.547-557
    • /
    • 2005
  • In this paper, we investigate the packet delay distribution of a dynamic bandwidth allocation(DBA) scheme in an Ethernet passive optical network(EPON). We focus on the gated-exhaustive vacation system. We assume that input packets arrive at an optical network unit(ONU) according to general interarrival distribution. We use a discrete time queueing model in order to find the packet delay distribution of the gated-exhaustive system with the primary transmission queue and the secondary input queue. We give some numerical examples to investigate the mean packet delays of the proposed queueing model to analyze the DBA scheme in an EPON.