Development of Time-Dependent Queuing Models. in Non-Stationary Condition

Size: px
Start display at page:

Download "Development of Time-Dependent Queuing Models. in Non-Stationary Condition"

Transcription

1 The 11th Asia Pacific Industrial Engineering and Management Systems Conference Development of Time-Dependent Queuing Models in Non-Stationary Condition Nur Aini Masruroh 1, Subagyo 2, Aulia Syarifah Hidayatullah 3, Katrin Rifanni Pamella 4 Mechanical and Industrial Engineering Department, Gadjah Mada University Jl. Grafika 2 Yogyakarta 55281, Indonesia aini@ugm.ac.id 1, subagyo@ugm.ac.id 2, aulia.syarifah.h@gmail.com 3, cutrin_901@yahoo.com 4 Abstract - The assumption of stationary increment used in conventional queuing theory has limitation in its applications. Some queuing systems such as university canteen, post office, and bank have different pattern at different time interval. In this case the stationary assumption does not apply. In the present work, models on non-stationary time-dependent queuing system are introduced. Two types of queuing environments are studied; single channel single phase and multiple channel single phase. The models are developed based on different types of data input; (i) arrival rate and service rate (ii) inter-arrival time and service rate (iii) combination of arrival rate, inter-arrival time, and service rate. The data input is modeled by using the best fitted distribution approach and the average value based on piecewise linear approximation. Performance evaluation of the models using several cases of queuing systems for both queuing environments reveals; (i) the error for non-stationary time dependent queuing models in flexible interval is smaller than time-independent queuing and non-stationary time dependent queuing in fixed interval, (ii) queuing model using combination of inter-arrival time and service rate as input provides smaller queuing parameter error, and (iii) input using average value is suitable for systems with identical inter-arrival time, while system with varied and significantly different in inter-arrival time is more suitable to use mean distribution as input. Keywords: single channel single phase, multi channel single phase, queuing theory, time-dependent queuing, non-stationary interval 1. INTRODUCTION Time dependent queuing model is commonly developed based on stationary condition, i.e. assuming to have identical independent distribution all the time. This assumption cannot be applied in some systems such as university canteen, post office, and bank. In these systems the arrival rate is a function of time and it has different pattern for different time interval. Some work on time-dependent queuing system has been done. Keller (1982) proposed time-dependent queuing algorithm for single server system. The arrival rate and service rate are assumed to follow exponential distribution with slowly changing time-dependent rates. The solution algorithm can be used to solve some queuing systems with small changing in arrival and service rate. Wulandari (2007) develop time-dependent queuing model for single : Corresponding Author. Tel Fax address: aini@ugm.ac.id channel-single phase system. The model is developed based on order 8 th Fourier series. Widiatmoko (2007) develop time-dependent queuing model for multiple channel-single phase system. The model is also developed based on order 8 th Fourier series. The drawbacks for both models are the possibility to get negative value for some queuing parameters that is impossible. Liani (2008) and Woko (2008) developed timedependent queuing models for multiple channel-single phase system and multiple channel-multiple phase system consequently. Both models are developed based on spreadsheet software. However, the previous models are developed under the stationary assumptions. As mention previously, in some cases this assumption is invalid. Hence in this work we proposed some time dependent queuing models for the system characterized by non-stationary time interval. The

2 Number of The 11th Asia Pacific Industrial Engineering and Management Systems Conference models allow each time interval to have different distribution. 2. METHODOLOGY This work consists of five main steps. The first step is determining the data pattern. Two way ANOVA test is conducted to see the effect of days and period within a day to the arrival rate. The second step is setting up the time interval. Two types of time interval are introduced; fixed interval and flexible interval. In the fixed interval, a day is divided into equal length of time, while in the flexible interval the length of interval is set based on the similarity of the condition of the respective interval. The model is developed for each time interval. The third step is model development. Two queuing environments are considered; single channel-single phase and multiple channel-single phase. The forth step is finding the best suited distribution of the arrival rate and service rate for each time interval. Three types of data input are used; (i) arrival rate and service rate (ii) inter-arrival time and service rate (iii) combination of arrival rate, inter-arrival time, and service rate. The queuing parameters are also determined using the developed models. The last step is model evaluation and implementation. In this work, four case studies (university canteen, post office, and two banks) are used to develop the model. 3. MODEL DEVELOPMENT The models are developed based on spreadsheet software. Based on two-way ANOVA test using α=0.05, for all cases there is no significant difference between days but the difference between time period within a day is statistically significant. It confirms the non-stationary assumption to be applied. Hence, the models are developed for each time period within a day. Kolmogorov-Smirnov test and Anderson-Darling test are used to test the best suited distribution Flexible time interval The idea of flexible time interval is combining several fixed intervals into single interval. For this purpose, a piecewise linear approximation method is used. The idea is to combine the adjacent intervals that have similar trend. The advantage of this method is; (i) it can reduce the number of interval, hence the number of model developed is reduced (ii) as linear approximation is used, it is possible to use average value instead of mean distribution as model s input. 3.2 Single channel-single phase model Two models are developed based in fixed interval and six models are based on flexible interval. The university canteen and post office are used as the case studies. Based on the statistical test for the data, the best length of time interval for the fixed time interval for the university canteen is 30 minutes and 45 minutes for the post office. The flexible time interval is determined by using the relationship between period and the number of arrived during the respective time period. Figure 1 shows an example of piecewise linear approximation to determine the length of interval for the university canteen queuing system. It can be seen that the first interval can be merged with the second interval hence the length of interval becomes 1 hour (instead of 30 minutes in fixed interval case). The same condition also applies to period 4 to 6 and 9 to Setting time interval Two types of time interval are considered; fixed interval and flexible interval Fixed time interval Fixed time interval is set by dividing a day into 2 to 12 intervals. For example, if a day is divided into 3 intervals it means the length of interval is 2 hours if it is assumed that the system operates 6 hours a day. For each interval the distribution of the arrival rate, inter-arrival time and service time are assessed. Interval which has the best suited distribution is selected, i.e. the spread of the data within this interval can be described well using certain distribution. Figure 1. Piecewise linear approximation for determining the length of interval (University Canteen case) The models are developed for each time interval for both fixed interval and flexible interval. Table 1 shows the description for the queuing models.

3 The 11th Asia Pacific Industrial Engineering and Management Systems Conference Table 1. Model description Model Interval Data input Arrival X Fixed Average arrival rate, Y Fixed arrival rate, A Flexible Average arrival rate, B Flexible arrival rate, C Flexible Average inter arrival time, second D Flexible inter arrival time, second E Flexible - Average arrival rate, - Average inter arrival time, second F Flexible - arrival rate, - inter arrival time, second Service rate, rate, rate, rate, The model is designed to be executed in spreadsheet (spreadsheet model) so users can use it easily. The queuing parameters considered are expected number of in the system (L), expected number of in the queue (L q ), expected waiting time per in the system (W s ), and expected waiting time per in the queue (W q ). Arrival rate for each input type can be defined as follows. a. Model with arrival rate and service rate as input (1) b. Model with inter-arrival time and service rate as input (2) c. Model with combination of arrival rate, interarrival time, and service rate input (3) The queuing parameter can be determined as follows. a. The number of in the server at the end of (4) b. The number of in the queue at the end of (5) c. The number of in the system at the end d. Expected waiting time per in the queue (6) e. Expected waiting time per in the system (7) (8) The inputs used in the spreadsheet model are: 1., duration of the observation, minutes 2., average (or mean distribution) of arrival rate, 3., average (or mean distribution) of 4., average (or mean distribution) of interarrival time, minutes 3.3 Multiple channel-single phase model As the case for single channel-single phase model, the models are also developed based on fixed interval and flexible interval. For this queuing environment, the cases of two national banks in Indonesia are used; Bank Mandiri (Bank A) and Bank BPD DIY (Bank B). The statistical test shows that for the fixed interval, the optimal length of time interval for both banks is 1 hour. The length of interval for the flexible time interval is determined by using piecewise linear approximation approach. The queuing parameters considered in multiple channel is the same as the parameters used in single channel. The only difference is in this case s number of server is used. However, because multiple server has s number of server, two approaches in determining the service rate ( are introduced. The first approach is to use the average and the second approach is to use the individual service rate. The queuing parameters for the first approach (average service rate) can be defined as follows. a. The number of in the server at the end of

4 The 11th Asia Pacific Industrial Engineering and Management Systems Conference (9) b. The number of in the queue at the end of With (18) is the actual number of in queue at time t is the predicted value of in queue n is the number of experiments (10) c. The number of in the system at the end (11) d. Expected waiting time per in the queue (12) e. Expected waiting time per in the system (13) The queuing parameters for the second approach (individual service rate) are as follows. a. The number of in the server at the end (14) b. The number of in the queue at the end (15) c. Expected waiting time per in the system = IF ( = 0, 0, ) (16) d. Traffic intensity at n (t) = IF ( = 0, 0, ) (17) The model is developed for each time interval for both fixed interval and flexible interval with the description is shown in Table MODEL EVALUATION The models accuracy is determined through the parameter s values. These values are compared to the actual values. The parameter error used is Mean Absolute Deviation (MAD) that is defined as Table 2 shows the MAD for single channel single phase model. It can be seen that models using arrival rate (number of per minute) as input enable to provide better accuracy than those using inter-arrival time as input. However, the models those use combination of arrival rate and inter-arrival time as input is more accurate than other models. It can be explained as follows. The error for model C and model D in early period is very high. This is because in the early he inter-arrival of the is very diverse and only a small number of s arrive. It can be seen that the model uses distribution (model D) provide less error than the model uses average value (C). Nevertheless the result also shows that the use of interarrival time when its value is too diverse is not recommended. For that reason model E and F are developed. The inter-arrival input is used in the period when the arrival of is very diverse otherwise arrival rate is used. Table 2. MAD for single channel-single phase model Model A B C D E F X Y Post office Univ. canteen As model E is recommended to model the post office and model F is recommended for university canteen, paired-t-test will be conducted to test the model validity. Using α=0.05, it is not sufficient evidence to say that both model are statistically different from the real value. Time independent queuing model is also used as benchmark model. The formula used is as follows. L (19) 2 L (20) q ( ) L 1 W (21) L W q (22) q Unfortunately, if equation (19) (22) are used to solve

5 ρ(t), traffic intensity Expected number of in queue The 11th Asia Pacific Industrial Engineering and Management Systems Conference these cases, it will result negative value for some parameter that is impossible. The time independent also assumed that the arrival rate follows Poisson distribution and the service rate follows exponential distribution all the time. However, in this study this assumption does not hold. In the case of multiple channel-single phase models, the models are developed based on equal service rate assumption and different service rate (individual service rate). The equal service rate assumptions said that all servers have the same service time. Table 3 shows the parameter error for the models. Table 4. MAD for time independent model Case MAD Post Office University canteen Bank A Bank B Table 3. MAD for multiple channel-single phase models Model A B C D E F X Y Equal service rate Bank A Bank B Individual service rate Bank A Bank B DETERMINING NUMBER OF SERVERS As the models have been validated, it will be used to evaluate the number of servers required. Suppose let us use the case of Bank A. In this case, model E is used to estimate the queuing parameters. Figure 2 shows the number of s in queue for Table 3 shows that the use of equal service rate assumptions looks better than the use of individual service rate. However, statistical test using α = 0.05 concludes that both approaches are not significantly different with p- value=0.112 for Bank A and p-value=0.728 for Bank B. Hence, the use of equal service rate will simplify the model. Table 3 also shows that for Bank A, model E together with model A provides smaller MAD. In this case the length of interval for fixed and flexible interval is the same, therefore model X turns out to model A. But it is not the case for Bank B. Based on the MAD value, model Y is recommended; fixed interval with mean inter-arrival distribution is used as input. It seems that join interval does not work as the model requires more detail (i.e. smaller interval required). In addition, the use of mean distribution is needed instead of average value. Further, the paired-t-test is conducted with α=0.05 and it concludes that model X and model Y are not statistically different from the real systems they described. As the case for single channel-single phase, time independent queuing model for multiple servers is also used as benchmark model. Similar to single channel-single phase environment, some parameter values have negative values that is impossible. Table 4 shows the MAD for the time independent model for both single channel and multiple channel models. Figure 2 Expected number of s in queue It can be seen from Figure 2 that the expected number of s in queue is varied. In this case the number of server required for each period is determined based on the expected number of. If time independent model is used to determine the number of server, 3 servers are recommended. However, the proposed time dependent model recommends using 3 servers for period 1-2 (8 am to 10 am) and period 6 (1 pm to 2 pm), and using 2 servers for other periods. Figure 3 and Figure 4 show the traffic Perbandingan Server Utilization Factor Model intensity and the expected number of in the queue Time Dependent dan Time Independent respectively after revising the number of server. 1,05 1 0,95 0,9 0,85 0,8 0,75 0,7 0,65 0, time independent time dependent mandiri

6 Expected number of s in queue The 11th Asia Pacific Industrial Engineering and Management Systems Conference Perbandingan Lq untuk Model Time Dependent dan Figure 3. Traffic intensity for the new scenario Time Independent 3 to use mean distribution as input. 2 1 time dependent time independent REFERENCES Figure 4. Expected number of for the new scenario Figure 3 shows that the traffic intensity for the time dependent model is higher than the time dependent but it is still no more than 1. It means that the service rate is higher than arrival rate, hence all s can be served at the respective period. Figure 4 shows an interesting point. Although time independent recommends using 3 servers all the time, but the expected number in queue for this model is higher than the time independent model. It is because in time independent, it is assumed that the arrival rate and the service rate are identical all the time. 5. CONCLUSION This work focuses on developing mathematical model for non-stationary time dependent queuing. Two queuing environments are considered; single channel-single phase and multiple channel-single phase. The model is designed to be applied in spreadsheet software. The numerical example shows that the time dependent queuing models outperform the time independent queuing model. Furthermore model with combination of arrival rate and inter arrival time as input provides better accuracy. The use of average value as input is suitable for systems with identical inter-arrival time, while system with varied and significantly different in inter-arrival time is more suitable Eick, S.G., Massey, W.A., Whitt, W., (1993), Mt/G/ With Sinusoidal Arrival Rate, AT &T Bell Laboratories, New Jersey. Hidayatullah, A.S., (2010), Development of Time Dependent Queuing Model for Single Channel Single Phase for Non-Stationary Condition, Thesis, Industrial Engineering, Gadjah Mada University, Indonesia. Jensen, P.A. dan Bard, J.F., (2003), Operations Research: Models and Method, John Willey and Sons, New York. Keller J.B., (1982), Time-Dependent Queues, SIAM Review, Vol. 24, No. 4, pp Lapin, L.L., Whisler, W.D., (2002), Quantitative Decision Making With Spreadsheet Application, Thompson Learning, Stamford. Liani, S., (2008), Development of Time Dependent Queuing Model for Single Channel Multi Phase, Thesis, Industrial Engineering, Gadjah Mada University, Indonesia. Taha, H.A., (2003), Operation Research An Introduction, 7 th edition, Prentice-Hall, Inc, New Jersey. Widiatmoko, L.D., (2007), Development of Time Dependent Queuing Model for Multi Channel Multi Phase, Thesis, Industrial Engineering, Gadjah Mada University, Indonesia. Woko, B.S., (2008), Spreadsheet Based Queuing Model for Multi Channel Multi Phase, Thesis, Industrial Engineering, Gadjah Mada University, Indonesia. Wulandari, N. E., (2007), Mathematical Model Development for Time Dependent Queuing Model, Thesis, Industrial Engineering, Gadjah Mada University, Indonesia.

Slides 11: Verification and Validation Models

Slides 11: Verification and Validation Models Slides 11: Verification and Validation Models Purpose and Overview The goal of the validation process is: To produce a model that represents true behaviour closely enough for decision making purposes.

More information

Modeling and Performance Analysis with Discrete-Event Simulation

Modeling and Performance Analysis with Discrete-Event Simulation Simulation Modeling and Performance Analysis with Discrete-Event Simulation Chapter 10 Verification and Validation of Simulation Models Contents Model-Building, Verification, and Validation Verification

More information

Read Chapter 4 of Kurose-Ross

Read Chapter 4 of Kurose-Ross CSE 422 Notes, Set 4 These slides contain materials provided with the text: Computer Networking: A Top Down Approach,5th edition, by Jim Kurose and Keith Ross, Addison-Wesley, April 2009. Additional figures

More information

Engineering Faculty, University of Gadjah Mada, Jl. Grafika no.2, Yogyakarta, Indonesia

Engineering Faculty, University of Gadjah Mada, Jl. Grafika no.2, Yogyakarta, Indonesia Advanced Engineering Forum Online: 2013-12-30 ISSN: 2234-991X, Vol. 10, pp 190-195 doi:10.4028/www.scientific.net/aef.10.190 2013 Trans Tech Publications, Switzerland USABILITY STUDY OF SELF-SERVICE SYSTEM

More information

Model suitable for virtual circuit networks

Model suitable for virtual circuit networks . The leinrock Independence Approximation We now formulate a framework for approximation of average delay per packet in telecommunications networks. Consider a network of communication links as shown in

More information

On the Role of Weibull-type Distributions in NHPP-based Software Reliability Modeling

On the Role of Weibull-type Distributions in NHPP-based Software Reliability Modeling International Journal of Performability Engineering Vol. 9, No. 2, March 2013, pp. 123-132. RAMS Consultants Printed in India On the Role of Weibull-type Distributions in NHPP-based Software Reliability

More information

Brief Literature Review of the Queuing Problem

Brief Literature Review of the Queuing Problem ISSN 2091-1521 (Print) 2091-153X (Online) International Journal of Operational Research/Nepal - IJORN - 2016, Vol. 5, Issue 1 Brief Literature Review of the Queuing Problem Yogesh Shukla 1 & Dr R.K. Shrivastav

More information

Fuzzy Queueing Model Using DSW Algorithm

Fuzzy Queueing Model Using DSW Algorithm Fuzzy Queueing Model Using DSW Algorithm R. Srinivasan Department of Mathematics, Kongunadu College of Engineering and Technology, Tiruchirappalli 621215, Tamilnadu ABSTRACT--- This paper proposes a procedure

More information

Lecture 7 Quantitative Process Analysis II

Lecture 7 Quantitative Process Analysis II MTAT.03.231 Business Process Management Lecture 7 Quantitative Process Analysis II Marlon Dumas marlon.dumas ät ut. ee 1 Process Analysis 2 Process Analysis Techniques Qualitative analysis Value-Added

More information

BANK ATM QUEUEING MODEL: A CASE STUDY Ashish Upadhayay* 1

BANK ATM QUEUEING MODEL: A CASE STUDY Ashish Upadhayay* 1 ISSN 2277-2685 IJESR/May 2017/ Vol-7/Issue-5/40-45 Ashish Upadhayay / International Journal of Engineering & Science Research BANK ATM QUEUEING MODEL: A CASE STUDY Ashish Upadhayay* 1 1 Research Scholar,

More information

Application of QNA to analyze the Queueing Network Mobility Model of MANET

Application of QNA to analyze the Queueing Network Mobility Model of MANET 1 Application of QNA to analyze the Queueing Network Mobility Model of MANET Harsh Bhatia 200301208 Supervisor: Dr. R. B. Lenin Co-Supervisors: Prof. S. Srivastava Dr. V. Sunitha Evaluation Committee no:

More information

Program for Modelling Queuing Systems in Transport

Program for Modelling Queuing Systems in Transport Logistics and Transport N o 2(15)/2012 Stavri Dimitrov Todor Kableshkov University of Transport, Sofia, Bulgaria This paper presents an example application of a software program developed using the programming

More information

Title: Proposed modifications to Performance Testing Baseline: Throughput and Latency Metrics

Title: Proposed modifications to Performance Testing Baseline: Throughput and Latency Metrics 1 ATM Forum Document Number: ATM_Forum/97-0426. Title: Proposed modifications to Performance Testing Baseline: Throughput and Latency Metrics Abstract: This revised text of the baseline includes better

More information

Using Queuing theory the performance measures of cloud with infinite servers

Using Queuing theory the performance measures of cloud with infinite servers Using Queuing theory the performance measures of cloud with infinite servers A.Anupama Department of Information Technology GMR Institute of Technology Rajam, India anupama.a@gmrit.org G.Satya Keerthi

More information

Calculating Call Blocking and Utilization for Communication Satellites that Use Dynamic Resource Allocation

Calculating Call Blocking and Utilization for Communication Satellites that Use Dynamic Resource Allocation Calculating Call Blocking and Utilization for Communication Satellites that Use Dynamic Resource Allocation Leah Rosenbaum Mohit Agrawal Leah Birch Yacoub Kureh Nam Lee UCLA Institute for Pure and Applied

More information

The Completion of Non-Steady-State Queue Model on The Queue System in Dr. Yap Eye Hospital Yogyakarta

The Completion of Non-Steady-State Queue Model on The Queue System in Dr. Yap Eye Hospital Yogyakarta Journal of Physics: Conference Series PAPER OPEN ACCESS The Completion of Non-Steady-State Queue Model on The Queue System in Dr. Yap Eye Hospital Yogyakarta To cite this article: Arum Helmi Manggala Putri

More information

Bootstrap Confidence Interval of the Difference Between Two Process Capability Indices

Bootstrap Confidence Interval of the Difference Between Two Process Capability Indices Int J Adv Manuf Technol (2003) 21:249 256 Ownership and Copyright 2003 Springer-Verlag London Limited Bootstrap Confidence Interval of the Difference Between Two Process Capability Indices J.-P. Chen 1

More information

Future-ready IT Systems with Performance Prediction using Analytical Models

Future-ready IT Systems with Performance Prediction using Analytical Models Future-ready IT Systems with Performance Prediction using Analytical Models Madhu Tanikella Infosys Abstract Large and complex distributed software systems can impact overall software cost and risk for

More information

Discrete Event Simulation and Petri net Modeling for Reliability Analysis

Discrete Event Simulation and Petri net Modeling for Reliability Analysis Discrete Event Simulation and Petri net Modeling for Reliability Analysis * Behrouz Safarinejadian Shiraz University of Technology, safarinejad@sutech.ac.ir Abstract. Analytical methods in reliability

More information

This formula shows that partitioning the network decreases the total traffic if 1 N R (1 + p) < N R p < 1, i.e., if not all the packets have to go

This formula shows that partitioning the network decreases the total traffic if 1 N R (1 + p) < N R p < 1, i.e., if not all the packets have to go Chapter 3 Problem 2 In Figure 3.43 of the text every node transmits R bps, and we assume that both network partitions consist of 1 N nodes. So the total traffic generated by the nodes 2 of each Ethernet

More information

Analyzing traffic source impact on returning visitors ratio in information provider website

Analyzing traffic source impact on returning visitors ratio in information provider website IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Analyzing traffic source impact on returning visitors ratio in information provider website To cite this article: A Prasetio et

More information

Performance Modeling of Proxy Cache Servers

Performance Modeling of Proxy Cache Servers Journal of Universal Computer Science, vol. 2, no. 9 (2006), 39-53 submitted: 3/2/05, accepted: 2/5/06, appeared: 28/9/06 J.UCS Performance Modeling of Proxy Cache Servers Tamás Bérczes, János Sztrik (Department

More information

Modelling traffic congestion using queuing networks

Modelling traffic congestion using queuing networks Sādhanā Vol. 35, Part 4, August 2010, pp. 427 431. Indian Academy of Sciences Modelling traffic congestion using queuing networks TUSHAR RAHEJA Mechanical Engineering Department, Indian Institute of Technology

More information

Two-Heterogeneous Server Markovian Queueing Model with Discouraged Arrivals, Reneging and Retention of Reneged Customers

Two-Heterogeneous Server Markovian Queueing Model with Discouraged Arrivals, Reneging and Retention of Reneged Customers International Journal of Operations Research International Journal of Operations Research Vol. 11, No. 2, 064 068 2014) Two-Heterogeneous Server Markovian Queueing Model with Discouraged Arrivals, Reneging

More information

Application of Cutting Stock Problem in Minimizing The Waste of Al-Quran Cover

Application of Cutting Stock Problem in Minimizing The Waste of Al-Quran Cover Kaunia, Vol.XII, Num., April 206, pp. 7~22 Available online at http://ejournal.uin-suka.ac.id/saintek/kaunia Application of Cutting Stock Problem in Minimizing The Waste of Al-Quran Cover Noor Saif Muhammad

More information

UNIT 4: QUEUEING MODELS

UNIT 4: QUEUEING MODELS UNIT 4: QUEUEING MODELS 4.1 Characteristics of Queueing System The key element s of queuing system are the customer and servers. Term Customer: Can refer to people, trucks, mechanics, airplanes or anything

More information

Automated Clustering-Based Workload Characterization

Automated Clustering-Based Workload Characterization Automated Clustering-Based Worload Characterization Odysseas I. Pentaalos Daniel A. MenascŽ Yelena Yesha Code 930.5 Dept. of CS Dept. of EE and CS NASA GSFC Greenbelt MD 2077 George Mason University Fairfax

More information

MPEG4 VIDEO OVER PACKET SWITCHED CONNECTION OF THE WCDMA AIR INTERFACE

MPEG4 VIDEO OVER PACKET SWITCHED CONNECTION OF THE WCDMA AIR INTERFACE MPEG4 VIDEO OVER PACKET SWITCHED CONNECTION OF THE WCDMA AIR INTERFACE Jamil Y. Khan 1, Pratik Das 2 School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW 238,

More information

Multi-threaded, discrete event simulation of distributed computing systems

Multi-threaded, discrete event simulation of distributed computing systems Multi-threaded, discrete event simulation of distributed computing systems Iosif C. Legrand California Institute of Technology, Pasadena, CA, U.S.A Abstract The LHC experiments have envisaged computing

More information

Another Proof of the Steiner Result for Three Equidistant Points in Euclidean Space and an Analogous Proof in Hyperbolic Space

Another Proof of the Steiner Result for Three Equidistant Points in Euclidean Space and an Analogous Proof in Hyperbolic Space Rose-Hulman Undergraduate Mathematics Journal Volume 5 Issue 2 Article 1 Another Proof of the Steiner Result for Three Equidistant Points in Euclidean Space and an Analogous Proof in Hyperbolic Space Diana

More information

Quantitative Models for Performance Enhancement of Information Retrieval from Relational Databases

Quantitative Models for Performance Enhancement of Information Retrieval from Relational Databases Quantitative Models for Performance Enhancement of Information Retrieval from Relational Databases Jenna Estep Corvis Corporation, Columbia, MD 21046 Natarajan Gautam Harold and Inge Marcus Department

More information

Lecture 5: Performance Analysis I

Lecture 5: Performance Analysis I CS 6323 : Modeling and Inference Lecture 5: Performance Analysis I Prof. Gregory Provan Department of Computer Science University College Cork Slides: Based on M. Yin (Performability Analysis) Overview

More information

MPEG VIDEO TRAFFIC MODELS: SEQUENTIALLY MODULATED SELF-SIMILAR PROCESSES

MPEG VIDEO TRAFFIC MODELS: SEQUENTIALLY MODULATED SELF-SIMILAR PROCESSES MPEG VIDEO TRAFFIC MODELS: SEQUENTIALLY MODULATED SELF-SIMILAR PROCESSES Hai Liu, Nirwan Ansari, and Yun Q. Shi New Jersey Center for Wireless Telecommunications Department of Electrical and Computer Engineering

More information

A New Statistical Procedure for Validation of Simulation and Stochastic Models

A New Statistical Procedure for Validation of Simulation and Stochastic Models Syracuse University SURFACE Electrical Engineering and Computer Science L.C. Smith College of Engineering and Computer Science 11-18-2010 A New Statistical Procedure for Validation of Simulation and Stochastic

More information

M. Xie, G. Y. Hong and C. Wohlin, "A Study of Exponential Smoothing Technique in Software Reliability Growth Prediction", Quality and Reliability

M. Xie, G. Y. Hong and C. Wohlin, A Study of Exponential Smoothing Technique in Software Reliability Growth Prediction, Quality and Reliability M. Xie, G. Y. Hong and C. Wohlin, "A Study of Exponential Smoothing Technique in Software Reliability Growth Prediction", Quality and Reliability Engineering International, Vol.13, pp. 247-353, 1997. 1

More information

Bloom filters and their applications

Bloom filters and their applications Bloom filters and their applications Fedor Nikitin June 11, 2006 1 Introduction The bloom filters, as a new approach to hashing, were firstly presented by Burton Bloom [Blo70]. He considered the task of

More information

Introduction and Simulation of Modified Left Algorithms to Attribute Orthogonal Codes in 3 rd Generation Systems

Introduction and Simulation of Modified Left Algorithms to Attribute Orthogonal Codes in 3 rd Generation Systems J. Basic. Appl. Sci. Res., 1(12)2950-2959, 2011 2011, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.com Introduction and Simulation of Modified Left

More information

Characterizing Internet Load as a Non-regular Multiplex of TCP Streams

Characterizing Internet Load as a Non-regular Multiplex of TCP Streams Characterizing Internet Load as a Non-regular Multiplex of TCP Streams J. Aracil, D. Morató Dpto. Automática y Computación Universidad Pública de Navarra {javier.aracil,daniel.morato}@unavarra.es http://www.tlm.unavarra.es

More information

Software Complexity Factor in Software Reliability Assessment

Software Complexity Factor in Software Reliability Assessment Software Complexity Factor in Software Reliability Assessment Meng-Lai Yin, Ph.D., ECE department, California Polytechnic University, Pomona Jon Peterson, Raytheon Company, Fullerton Rafael R. Arellano,

More information

Scheduling Real Time Parallel Structure on Cluster Computing with Possible Processor failures

Scheduling Real Time Parallel Structure on Cluster Computing with Possible Processor failures Scheduling Real Time Parallel Structure on Cluster Computing with Possible Processor failures Alaa Amin and Reda Ammar Computer Science and Eng. Dept. University of Connecticut Ayman El Dessouly Electronics

More information

Zone Recovery Methodology for Probe-Subset Selection in End-to-end Network Monitoring

Zone Recovery Methodology for Probe-Subset Selection in End-to-end Network Monitoring Zone Recovery Methodology for Probe-Subset Selection in End-to-end Network Monitoring H. Cenk Ozmutlu hco@uludag.edu.tr Dept. of Industrial Engineering School of Engineering and Architecture Uludag University

More information

Volume 5, No. 2, May -June, 2013, ISSN

Volume 5, No. 2, May -June, 2013, ISSN ABSTRACT Simulation Tool for Queuing Models: QSIM Pratiksha Saxena, Lokesh Sharma Gautam Buddha University, Department of Mathematics, School of Applied Sciences, Gautam Buddha University, Greater Noida,

More information

TELCOM 2130 Queueing Theory. David Tipper Associate Professor Graduate Telecommunications and Networking Program. University of Pittsburgh

TELCOM 2130 Queueing Theory. David Tipper Associate Professor Graduate Telecommunications and Networking Program. University of Pittsburgh TELCOM 2130 Queueing Theory David Tipper Associate Professor Graduate Telecommunications and Networking Program University of Pittsburgh Learning Objective To develop the modeling and mathematical skills

More information

Delay Analysis of ML-MAC Algorithm For Wireless Sensor Networks

Delay Analysis of ML-MAC Algorithm For Wireless Sensor Networks Delay Analysis of ML-MAC Algorithm For Wireless Sensor Networks Madhusmita Nandi School of Electronics Engineering, KIIT University Bhubaneswar-751024, Odisha, India ABSTRACT The present work is to evaluate

More information

Äriprotsesside modelleerimine ja automatiseerimine Loeng 9 Järjekorrateooria ja äriprotsessid. Enn Õunapuu

Äriprotsesside modelleerimine ja automatiseerimine Loeng 9 Järjekorrateooria ja äriprotsessid. Enn Õunapuu Äriprotsesside modelleerimine ja automatiseerimine Loeng 9 Järjekorrateooria ja äriprotsessid Enn Õunapuu enn.ounapuu@ttu.ee Kava Järjekorrateooria Näited Järeldused Küsimused Loengu eesmärk Loengu eesmärgiks

More information

Queuing Systems. 1 Lecturer: Hawraa Sh. Modeling & Simulation- Lecture -4-21/10/2012

Queuing Systems. 1 Lecturer: Hawraa Sh. Modeling & Simulation- Lecture -4-21/10/2012 Queuing Systems Queuing theory establishes a powerful tool in modeling and performance analysis of many complex systems, such as computer networks, telecommunication systems, call centers, manufacturing

More information

iscrete-event System Simulation of Queues with Spreadsheets Combined with Simple VBA Code: A Teaching Case

iscrete-event System Simulation of Queues with Spreadsheets Combined with Simple VBA Code: A Teaching Case Nithipat Kamolsuk D iscrete-event System Simulation of Queues with Spreadsheets Combined with Simple VBA Code: A Teaching Case Chairperson, Department of General Science Faculty of Engineering and Technology

More information

Usability Evaluation of Cell Phones for Early Adolescent Users

Usability Evaluation of Cell Phones for Early Adolescent Users Yassierli*, Melati Gilang Industrial Management Research Division, Faculty of Industrial Technology, Bandung Institute of Technology Jl. Ganesa 10 Bandung 40134 Indonesia ABSTRACT:. The increasing number

More information

Available online at ScienceDirect. Procedia Computer Science 59 (2015 )

Available online at  ScienceDirect. Procedia Computer Science 59 (2015 ) Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 59 (2015 ) 550 558 International Conference on Computer Science and Computational Intelligence (ICCSCI 2015) The Implementation

More information

Comparison of pre-backoff and post-backoff procedures for IEEE distributed coordination function

Comparison of pre-backoff and post-backoff procedures for IEEE distributed coordination function Comparison of pre-backoff and post-backoff procedures for IEEE 802.11 distributed coordination function Ping Zhong, Xuemin Hong, Xiaofang Wu, Jianghong Shi a), and Huihuang Chen School of Information Science

More information

Chapter 10 Verification and Validation of Simulation Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 10 Verification and Validation of Simulation Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Chapter 10 Verification and Validation of Simulation Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose & Overview The goal of the validation process is: To produce a model that

More information

Lecture: Simulation. of Manufacturing Systems. Sivakumar AI. Simulation. SMA6304 M2 ---Factory Planning and scheduling. Simulation - A Predictive Tool

Lecture: Simulation. of Manufacturing Systems. Sivakumar AI. Simulation. SMA6304 M2 ---Factory Planning and scheduling. Simulation - A Predictive Tool SMA6304 M2 ---Factory Planning and scheduling Lecture Discrete Event of Manufacturing Systems Simulation Sivakumar AI Lecture: 12 copyright 2002 Sivakumar 1 Simulation Simulation - A Predictive Tool Next

More information

QUEUEING MODELS FOR UNINTERRUPTED TRAFFIC FLOWS

QUEUEING MODELS FOR UNINTERRUPTED TRAFFIC FLOWS QUEUEING MODELS FOR UNINTERRUPTED TRAFFIC FLOWS An assignment submitted by Bhaskararao Boddu ( 06212306) Msc(Mathematics) Indian Institute of Technology Guwahati. 1 INTRODUCTION Due to increased ownership

More information

3. Data Analysis and Statistics

3. Data Analysis and Statistics 3. Data Analysis and Statistics 3.1 Visual Analysis of Data 3.2.1 Basic Statistics Examples 3.2.2 Basic Statistical Theory 3.3 Normal Distributions 3.4 Bivariate Data 3.1 Visual Analysis of Data Visual

More information

Network Load Balancing Methods: Experimental Comparisons and Improvement

Network Load Balancing Methods: Experimental Comparisons and Improvement Network Load Balancing Methods: Experimental Comparisons and Improvement Abstract Load balancing algorithms play critical roles in systems where the workload has to be distributed across multiple resources,

More information

Introduction: Two motivating examples for the analytical approach

Introduction: Two motivating examples for the analytical approach Introduction: Two motivating examples for the analytical approach Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. D. Manjunath Outline

More information

Advanced Internet Technologies

Advanced Internet Technologies Advanced Internet Technologies Chapter 3 Performance Modeling Dr.-Ing. Falko Dressler Chair for Computer Networks & Internet Wilhelm-Schickard-Institute for Computer Science University of Tübingen http://net.informatik.uni-tuebingen.de/

More information

Network Traffic Characterisation

Network Traffic Characterisation Modeling Modeling Theory Outline 1 2 The Problem Assumptions 3 Standard Car Model The Packet Train Model The Self - Similar Model 4 Random Variables and Stochastic Processes The Poisson and Exponential

More information

An algorithm for Performance Analysis of Single-Source Acyclic graphs

An algorithm for Performance Analysis of Single-Source Acyclic graphs An algorithm for Performance Analysis of Single-Source Acyclic graphs Gabriele Mencagli September 26, 2011 In this document we face with the problem of exploiting the performance analysis of acyclic graphs

More information

Adaptive Dynamic Channel Allocation Scheme for Spotbeam Handover in LEO Satellite Networks*

Adaptive Dynamic Channel Allocation Scheme for Spotbeam Handover in LEO Satellite Networks* Adaptive Dynamic Channel Allocation Scheme for Spotbeam Handover in LEO Satellite Networks* Sungrae Cho Broadband and Wireless Networking Laboratory School of Electrical and Computer Engineering Georgia

More information

END-TO-END estimation of the spare capacity along a network

END-TO-END estimation of the spare capacity along a network 130 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 16, NO. 1, FEBRUARY 2008 A Stochastic Foundation of Available Bandwidth Estimation: Multi-Hop Analysis Xiliang Liu, Kaliappa Ravindran, and Dmitri Loguinov,

More information

Using Modified Euler Method (MEM) for the Solution of some First Order Differential Equations with Initial Value Problems (IVPs).

Using Modified Euler Method (MEM) for the Solution of some First Order Differential Equations with Initial Value Problems (IVPs). Using Modified Euler Method (MEM) for the Solution of some First Order Differential Equations with Initial Value Problems (IVPs). D.I. Lanlege, Ph.D. * ; U.M. Garba, B.Sc.; and A. Aluebho, B.Sc. Department

More information

Single Slit Diffraction

Single Slit Diffraction Name: Date: PC1142 Physics II Single Slit Diffraction 5 Laboratory Worksheet Part A: Qualitative Observation of Single Slit Diffraction Pattern L = a 2y 0.20 mm 0.02 mm Data Table 1 Question A-1: Describe

More information

Two-Tier WBAN/WLAN Healthcare Networks; Priority Considerations

Two-Tier WBAN/WLAN Healthcare Networks; Priority Considerations Two-Tier WBAN/WLAN Healthcare Networks; Priority Considerations Saeed Rashwand Department of Computer Science University of Manitoba Jelena Mišić Department of Computer Science Ryerson University Abstract

More information

Error Control System for Parallel Multichannel Using Selective Repeat ARQ

Error Control System for Parallel Multichannel Using Selective Repeat ARQ Error Control System for Parallel Multichannel Using Selective Repeat ARQ M.Amal Rajan 1, M.Maria Alex 2 1 Assistant Prof in CSE-Dept, Jayamatha Engineering College, Aralvaimozhi, India, 2 Assistant Prof

More information

Chapter 16. Microscopic Traffic Simulation Overview Traffic Simulation Models

Chapter 16. Microscopic Traffic Simulation Overview Traffic Simulation Models Chapter 6 Microscopic Traffic Simulation 6. Overview The complexity of traffic stream behaviour and the difficulties in performing experiments with real world traffic make computer simulation an important

More information

Queuing Networks Modeling Virtual Laboratory

Queuing Networks Modeling Virtual Laboratory Queuing Networks Modeling Virtual Laboratory Dr. S. Dharmaraja Department of Mathematics IIT Delhi http://web.iitd.ac.in/~dharmar Queues Notes 1 1 Outline Introduction Simple Queues Performance Measures

More information

Joe Wingbermuehle, (A paper written under the guidance of Prof. Raj Jain)

Joe Wingbermuehle, (A paper written under the guidance of Prof. Raj Jain) 1 of 11 5/4/2011 4:49 PM Joe Wingbermuehle, wingbej@wustl.edu (A paper written under the guidance of Prof. Raj Jain) Download The Auto-Pipe system allows one to evaluate various resource mappings and topologies

More information

Building Roof Contours Extraction from Aerial Imagery Based On Snakes and Dynamic Programming

Building Roof Contours Extraction from Aerial Imagery Based On Snakes and Dynamic Programming Building Roof Contours Extraction from Aerial Imagery Based On Snakes and Dynamic Programming Antonio Juliano FAZAN and Aluir Porfírio Dal POZ, Brazil Keywords: Snakes, Dynamic Programming, Building Extraction,

More information

Analytic Performance Models for Bounded Queueing Systems

Analytic Performance Models for Bounded Queueing Systems Analytic Performance Models for Bounded Queueing Systems Praveen Krishnamurthy Roger D. Chamberlain Praveen Krishnamurthy and Roger D. Chamberlain, Analytic Performance Models for Bounded Queueing Systems,

More information

On Dependability in Distributed Databases

On Dependability in Distributed Databases CITI Technical Report 92-9 On Dependability in Distributed Databases Toby J. Teorey teorey@citi.umich.edu ABSTRACT Distributed database availability, reliability, and mean transaction completion time are

More information

Comparison of segmentation using fast marching and geodesic active contours methods for bone

Comparison of segmentation using fast marching and geodesic active contours methods for bone Journal of Physics: Conference Series PAPER OPEN ACCESS Comparison of segmentation using fast marching and geodesic active contours methods for bone To cite this article: A Bilqis and R Widita 206 J. Phys.:

More information

Chapter 6 Queueing Networks Modelling Software (QNs) and Computing Language(s)

Chapter 6 Queueing Networks Modelling Software (QNs) and Computing Language(s) Chapter 6 Queueing Networks Modelling Software (QNs) and Computing Language(s) 6.1 Introduction This chapter, reviews the evaluation of queueing networks software (QNs) and computing language(s) and their

More information

OBJECT-ORIENTED AND RELATIONAL APPROACHES IN DATABASE MANAGEMENT SYSTEMS (DBMSS): DESIGN, IMPLEMENTATION AND INDUSTRIAL MARKETS

OBJECT-ORIENTED AND RELATIONAL APPROACHES IN DATABASE MANAGEMENT SYSTEMS (DBMSS): DESIGN, IMPLEMENTATION AND INDUSTRIAL MARKETS International Journal of Latest Trends in Engineering and Technology pp. 109-113 DOI: http://dx.doi.org/10.21172/1.ires.14 e-issn: 2278-621X OBJECT-ORIENTED AND RELATIONAL APPROACHES IN DATABASE MANAGEMENT

More information

Journal of Asian Scientific Research FEATURES COMPOSITION FOR PROFICIENT AND REAL TIME RETRIEVAL IN CBIR SYSTEM. Tohid Sedghi

Journal of Asian Scientific Research FEATURES COMPOSITION FOR PROFICIENT AND REAL TIME RETRIEVAL IN CBIR SYSTEM. Tohid Sedghi Journal of Asian Scientific Research, 013, 3(1):68-74 Journal of Asian Scientific Research journal homepage: http://aessweb.com/journal-detail.php?id=5003 FEATURES COMPOSTON FOR PROFCENT AND REAL TME RETREVAL

More information

Modeling and Simulation (An Introduction)

Modeling and Simulation (An Introduction) Modeling and Simulation (An Introduction) 1 The Nature of Simulation Conceptions Application areas Impediments 2 Conceptions Simulation course is about techniques for using computers to imitate or simulate

More information

THE TRANSITIVE REDUCTION OF A DIRECTED GRAPH*

THE TRANSITIVE REDUCTION OF A DIRECTED GRAPH* SIAM J. COMPUT. Vol. 1, No. 2, June 1972 THE TRANSITIVE REDUCTION OF A DIRECTED GRAPH* A. V. AHO, M. R. GAREY" AND J. D. ULLMAN Abstract. We consider economical representations for the path information

More information

RAINBOW CONNECTION AND STRONG RAINBOW CONNECTION NUMBERS OF

RAINBOW CONNECTION AND STRONG RAINBOW CONNECTION NUMBERS OF RAINBOW CONNECTION AND STRONG RAINBOW CONNECTION NUMBERS OF Srava Chrisdes Antoro Fakultas Ilmu Komputer, Universitas Gunadarma srava_chrisdes@staffgunadarmaacid Abstract A rainbow path in an edge coloring

More information

A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm

A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm International Journal of Engineering Research and General Science Volume 3, Issue 4, July-August, 15 ISSN 91-2730 A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm

More information

Simulation Model Of Functional Stability Of Business Processes

Simulation Model Of Functional Stability Of Business Processes RESEARCH ARTICLE OPEN ACCESS Simulation Model Of Functional Stability Of Business Processes Yuri Monakhov*, Olga Fayman** *,**(Department of Informatics and IT Security, Vladimir State University, Russian

More information

Numerical approach estimate

Numerical approach estimate Simulation Nature of simulation Numericalapproachfor investigating models of systems. Data are gathered to estimatethe true characteristics of the model. Garbage in garbage out! One of the techniques of

More information

Volume 5, Issue 7, July 2017 International Journal of Advance Research in Computer Science and Management Studies

Volume 5, Issue 7, July 2017 International Journal of Advance Research in Computer Science and Management Studies Volume, Issue 7, July 2017 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com A Study

More information

Analysis of Air Transportation Network Delays Using Stochastic Modeling

Analysis of Air Transportation Network Delays Using Stochastic Modeling Arun Shankar Analysis of Air Transportation Network Delays Using Stochastic Modeling Abstract We model the air traffic of 1 airports (each w/1 gate) with a closed Jackson queuing network using various

More information

Analysis of Replication Control Protocols

Analysis of Replication Control Protocols Analysis of Replication Control Protocols Darrell D. E. Long University of California, Santa Cruz darrell@cis.ucsc.edu June 22, 2003 Abstract In recent years many replication control protocols have been

More information

Verification and Validation of X-Sim: A Trace-Based Simulator

Verification and Validation of X-Sim: A Trace-Based Simulator http://www.cse.wustl.edu/~jain/cse567-06/ftp/xsim/index.html 1 of 11 Verification and Validation of X-Sim: A Trace-Based Simulator Saurabh Gayen, sg3@wustl.edu Abstract X-Sim is a trace-based simulator

More information

Performance Study of Routing Algorithms for LEO Satellite Constellations

Performance Study of Routing Algorithms for LEO Satellite Constellations Performance Study of Routing Algorithms for LEO Satellite Constellations Ioannis Gragopoulos, Evangelos Papapetrou, Fotini-Niovi Pavlidou Aristotle University of Thessaloniki, School of Engineering Dept.

More information

A queueing network model to study Proxy Cache Servers

A queueing network model to study Proxy Cache Servers Proceedings of the 7 th International Conference on Applied Informatics Eger, Hungary, January 28 31, 2007. Vol. 1. pp. 203 210. A queueing network model to study Proxy Cache Servers Tamás Bérczes, János

More information

Proceedings of the 2015 Winter Simulation Conference L. Yilmaz, W. K. V. Chan, I. Moon, T. M. K. Roeder, C. Macal, and M. D. Rossetti, eds.

Proceedings of the 2015 Winter Simulation Conference L. Yilmaz, W. K. V. Chan, I. Moon, T. M. K. Roeder, C. Macal, and M. D. Rossetti, eds. Proceedings of the 2015 Winter Simulation Conference L. Yilmaz, W. K. V. Chan, I. Moon, T. M. K. Roeder, C. Macal, and M. D. Rossetti, eds. USE OF THE INTERVAL STATISTICAL PROCEDURE FOR SIMULATION MODEL

More information

8.1 Model building, verification, and validation

8.1 Model building, verification, and validation UNIT 8: VERIFICATION AND VALIDATION OF SIMULATION MODELS, OPTIMIZATION: Model building, verification and validation; Verification of simulation models; Calibration and validation of models. Optimization

More information

SENSITIVITY OF OUTPUT PERFORMANCE MEASURES TO INPUT DISTRIBUTIONS IN QUEUEING NETWORK MODELING. Donald Gross Denise M.

SENSITIVITY OF OUTPUT PERFORMANCE MEASURES TO INPUT DISTRIBUTIONS IN QUEUEING NETWORK MODELING. Donald Gross Denise M. Proceedings of the 1998 Winter Simulation Conference D.J. Medeiros, E.F. Watson, J.S. Carson and M.S. Manivannan, eds. SENSITIVITY OF OUTPUT PERFORMANCE MEASURES TO INPUT DISTRIBUTIONS IN QUEUEING NETWORK

More information

An Improved Measurement Placement Algorithm for Network Observability

An Improved Measurement Placement Algorithm for Network Observability IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 16, NO. 4, NOVEMBER 2001 819 An Improved Measurement Placement Algorithm for Network Observability Bei Gou and Ali Abur, Senior Member, IEEE Abstract This paper

More information

Computing Performance Measures of Fuzzy Non-Preemptive Priority Queues Using Robust Ranking Technique

Computing Performance Measures of Fuzzy Non-Preemptive Priority Queues Using Robust Ranking Technique Applied Mathematical Sciences, Vol. 7, 2013, no. 102, 5095-5102 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.37378 Computing Performance Measures of Fuzzy Non-Preemptive Priority Queues

More information

INTERNATIONAL TELECOMMUNICATION UNION

INTERNATIONAL TELECOMMUNICATION UNION INTERNATIONAL TELECOMMUNICATION UNION TELECOMMUNICATION STANDARDIZATION SECTOR STUDY PERIOD 21-24 English only Questions: 12 and 16/12 Geneva, 27-31 January 23 STUDY GROUP 12 DELAYED CONTRIBUTION 98 Source:

More information

An Evaluation of Deficit Round Robin Fair Queuing Applied in Router Congestion Control

An Evaluation of Deficit Round Robin Fair Queuing Applied in Router Congestion Control JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 18, 333-339 (2002) Short aper An Evaluation of Deficit Round Robin Fair ueuing Applied in Router Congestion Control Department of Electrical Engineering National

More information

Quality Improvement in the Multi-response Problem by Using Clustering Characteristic

Quality Improvement in the Multi-response Problem by Using Clustering Characteristic Proceedings of the 2007 WSEAS International Conference on Computer Engineering and Applications, Gold Coast, Australia, January 17-19, 2007 325 Quality Improvement in the Multi-response Problem by Using

More information

M. Xie, G. Y. Hong and C. Wohlin, "Modeling and Analysis of Software System Reliability", in Case Studies on Reliability and Maintenance, edited by

M. Xie, G. Y. Hong and C. Wohlin, Modeling and Analysis of Software System Reliability, in Case Studies on Reliability and Maintenance, edited by M. Xie, G. Y. Hong and C. Wohlin, "Modeling and Analysis of Software System Reliability", in Case Studies on Reliability and Maintenance, edited by W. Blischke and P. Murthy, Wiley VHC Verlag, Germany,

More information

Adaptive packet scheduling for requests delay guaranties in packetswitched computer communication network

Adaptive packet scheduling for requests delay guaranties in packetswitched computer communication network Paweł Świątek Institute of Computer Science Wrocław University of Technology Wybrzeże Wyspiańskiego 27 50-370 Wrocław, Poland Email: pawel.swiatek@pwr.wroc.pl Adam Grzech Institute of Computer Science

More information

99 International Journal of Engineering, Science and Mathematics

99 International Journal of Engineering, Science and Mathematics Journal Homepage: Applications of cubic splines in the numerical solution of polynomials Najmuddin Ahmad 1 and Khan Farah Deeba 2 Department of Mathematics Integral University Lucknow Abstract: In this

More information

Generic Graphics for Uncertainty and Sensitivity Analysis

Generic Graphics for Uncertainty and Sensitivity Analysis Generic Graphics for Uncertainty and Sensitivity Analysis R. M. Cooke Dept. Mathematics, TU Delft, The Netherlands J. M. van Noortwijk HKV Consultants, Lelystad, The Netherlands ABSTRACT: We discuss graphical

More information

Continuous Improvement Toolkit. Normal Distribution. Continuous Improvement Toolkit.

Continuous Improvement Toolkit. Normal Distribution. Continuous Improvement Toolkit. Continuous Improvement Toolkit Normal Distribution The Continuous Improvement Map Managing Risk FMEA Understanding Performance** Check Sheets Data Collection PDPC RAID Log* Risk Analysis* Benchmarking***

More information