• Title/Summary/Keyword: network time-delay

Search Result 1,471, Processing Time 0.029 seconds

Performance Analysis of NTT/BT Protocol (NTT/BT 프로토콜의 성능 분석)

  • 이창훈;백상엽;이동주
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.2
    • /
    • pp.99-123
    • /
    • 1997
  • Performance analysis of NTT/BT protocol is investigated, which is a GFC (Generic Flow Control) ptotocol in ATM (Asynchronous Transfer Mode ) network and is based on cyclic reset mechanism. THe mean cell delay time is proposed as a performance measure of NTT/BT protocol. The mean cell delay time is defined as the duration from the instant the cell arrives at the transmission buffer until the cell is fully transmitted. The process of cell transmission can be described as a single server queueing modle with two dependent services. By utilizing this model, mean cell delay time is obtained and sensitivity of the factors such as window size and reset period is also analysed.

  • PDF

Performance Study on ZigBee-Based Wireless Personal Area Networks for Real-Time Health Monitoring

  • Koh, Bernard Kai-Ping;Kong, Peng-Yong
    • ETRI Journal
    • /
    • v.28 no.4
    • /
    • pp.537-540
    • /
    • 2006
  • When multiple ZigBee wireless personal area networks (WPANs) are in close proximity to each other, contentions and collisions in transmissions will lead to increased packet delays. However, there is no existing study on how delay performance would be affected in a crowded real-life environment where each person walking down a busy street would be wearing a ZigBee WPAN. This letter studies the use of ZigBee WPANs in such a real-life environment for real-time heart beat monitoring. To be pragmatic, we derived a mobility pattern from the analysis of a real-life video trace. Then, we estimated the delay performance from the video trace by combining data collected from ZigBee experiments. The results show that the 300 ms packet delay requirement will not be met for only 11% of the time. When failure occurs, it will last for an average duration of 1.4 s.

  • 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
    • /
    • v.17 no.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.

Estimation and Prediction-Based Connection Admission Control in Broadband Satellite Systems

  • Jang, Yeong-Min
    • ETRI Journal
    • /
    • v.22 no.4
    • /
    • pp.40-50
    • /
    • 2000
  • We apply a "sliding-window" Maximum Likelihood(ML) estimator to estimate traffic parameters On-Off source and develop a method for estimating stochastic predicted individual cell arrival rates. Based on these results, we propose a simple Connection Admission Control(CAC)scheme for delay sensitive services in broadband onboard packet switching satellite systems. The algorithms are motivated by the limited onboard satellite buffer, the large propagation delay, and low computational capabilities inherent in satellite communication systems. We develop an algorithm using the predicted individual cell loss ratio instead of using steady state cell loss ratios. We demonstrate the CAC benefits of this approach over using steady state cell loss ratios as well as predicted total cell loss ratios. We also derive the predictive saturation probability and the predictive cell loss ratio and use them to control the total number of connections. Predictive congestion control mechanisms allow a satellite network to operate in the optimum region of low delay and high throughput. This is different from the traditional reactive congestion control mechanism that allows the network to recover from the congested state. Numerical and simulation results obtained suggest that the proposed predictive scheme is a promising approach for real time CAC.

  • PDF

Medium Access Control Protocol for Interconnection Network of Mobile System (이동통신 시스템의 상호연결망을 위한 접근제어 프로토콜)

    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.2
    • /
    • pp.95-108
    • /
    • 1999
  • The CDMA mobile system consists of several subsystems and each subsystem has many processing elements that handle voice messages and control messages for performing CDMA call processing functions through CDMA Interconnection Network(CIN). For assuring a high throughput and a short delay in the CIN, an efficient medium access control protocol should be provided. In this paper, we propose a new access control protocol of CIN for providing real time communications in CDMA mobile system. Also, we evaluate the delay performance of the proposed access control protocol and compare it with that of the existing access control protocol. Through a set of numerical examples, we show that our proposed protocol provides a better delay performance than the existing protocol.

  • PDF

Test of Fit for the Log-Normalness of the Post Dialling Delay

  • Won, Hyung-Gyoo
    • Journal of Korean Society for Quality Management
    • /
    • v.22 no.2
    • /
    • pp.79-88
    • /
    • 1994
  • Delay has influenced customer satisfaction while using a telephone. It has been ranked second after transmission impairments in annoyance to customers. Therefore, it is important to analyze its behavior not only to increase the quality of service for the customers, but to provide its information to network planners and administrators and to designers of equipment and systems. In this paper, we consider a log-normal model as a candidate for describing the statistical behavior of the post dialling delay, i.e., the time to connect a call to the telephone network after dialling. Based on the real data, the log-normalness of the post dialling delays are convinced for the long distance calls, but not supported for the local calls. Uses of graphical plotting paper and statistical test of fit art discussed.

  • PDF

Prioritized Dynamic Rate Scheduling for Interactive GEO Satellite Networks (대화형 GEO 위성 네트워크를 위한 우선권기반 동적 데이터 전송률 스케줄링 체계)

  • Chang, Kun-Nyeong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.3
    • /
    • pp.1-15
    • /
    • 2007
  • In this paper, the return link of interactive GEO satellite network providing multimedia services is considered. First, we classify data by delay characteristics, and analyze the numbers of expected lost packets and expected delay packets for each data class of each terminal. Next we mathematically formulate optimal rate scheduling model to minimize the weighted sum of the numbers of expected lost packets and expected delay packets considering priority of each data class. We also suggest a dynamic rate scheduling scheme based on Lagrangean relaxation technique and subgradient technique to solve the proposed model in a fast time. Extensive experiments show that the proposed scheme provides encouraging results.

Study on Dynamic Priority Collision Resolution Algorithm in HFC-CATV Network (HFC-CATV 망에서 동적 우선순위 충돌해결알고리즘에 관한 연구)

  • Lee, Su-Youn;Chung, Jin-Wook
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.611-616
    • /
    • 2003
  • Recently, the HFC-CATV network stand in a substructure of superhighway information network. Because of sharing up to 500 of subscribes, the Collision Resolution Algorithm needs in the upstream channel of HFC-CATV network. In order to provide Quality of Service (QoS) to users with real-time data such as voice, video and interactive service, the research of Collision Resolution Algorithm must include an effective priority scheme. In IEEE 802.14, the Collision Resolution Algorithm has high request delay because of static PNA(Priority New Access) slots structure and different priority traffics with the same probability. In order to resolve this problem, this paper proposed dynamic priority collision resolution algorithm with ternary tree algorithm. It has low request delay according to an increase of traffic load because high priority traffic first resolve and new traffic content with different probability. In the result of the simulation, it demonstrated that the proposed algorithm needs lower request delay than that of ternary tree algorithm with static PNA slots structure.

Network Monitoring Mechanism For High Quality Real-Time Streaming Service (고품질 실시간 스트리밍 서비스 제공을 위한 네트워크 모니터링 기법)

  • Kim, Yong-Sul;Kim, Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11B
    • /
    • pp.969-978
    • /
    • 2006
  • Recently, there has been explosive growth in Internet service contents, and we have witnessed the emergence of many real-time applications on the Internet. These types of applications require special support from the underlying network such as reliability, timeless, and guaranteed delivery, as well as different levels of service quality. Estimation network status and transcoding data rate are researching for QoS of multimedia service by using the RTP/RTCP. We propose two schemes that the way to calculate the one-way delay by expanding the structure of RTP/RTCP in Internet that provides us 'best effort' service and to estimate the network condition by using this in this paper. And we propose the dynamic RTCP mechanism based on one-way delay to deal with rapidly changed network situation immediately. In simulation, proposed monitoring schemes using the one-way delay has similar in performance to monitoring schemes using the GPS, proposed dynamic RTCP scheme obtain the desired result of decreased packet loss rate by sending RTCP RR packet lower than other schemes.

A Tabu Search Algorithm for Network Design Problem in Wireless Mesh Networks (무선 메쉬 네트워크에서 네트워크 설계 문제를 위한 타부 서치 알고리즘)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.6
    • /
    • pp.778-785
    • /
    • 2020
  • Wireless mesh networks consist of mesh clients, mesh routers and mesh access points. The mesh router connects wireless network services to the mesh client, and the mesh access point connects to the backbone network using a wired link and provides Internet access to the mesh client. In this paper, a limited number of mesh routers and mesh access points are used to propose optimization algorithms for network design for wireless mesh networks. The optimization algorithm in this paper has been applied with a sub-subscription algorithm, which is one of the meta-heuristic methods, and is designed to minimize the transmission delay for the placement of mesh routers and mesh access points, and produce optimal results within a reasonable time. The proposed algorithm was evaluated in terms of transmission delay and time to perform the algorithm for the placement of mesh routers and mesh access points, and the performance evaluation results showed superior performance compared to the previous meta-heuristic methods.