Scribd
Upload
53 views3 pages

We Provide Only The Necessary Steps,:) 1 (1 M 1 I I) 1 (I, 2 M 1 J J) 1 (J M 1 I I

1. The time dependent equations and boundary conditions are included to follow the usual procedure of first writing time dependent equations and then steady state equations when discussing steady state analysis. 2. The scholar only provides the necessary steps for the proof of theorem 2.1 and does not give a satisfactory full proof because the conditions N and S are not yet well established. 3. The models presented have applications in computer networks and communication systems, with chapter 2 applying to CPU and I/O queueing and chapters 3-5 applying to multimedia networks.

Uploaded by

ebenesarb
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
53 views3 pages

We Provide Only The Necessary Steps,:) 1 (1 M 1 I I) 1 (I, 2 M 1 J J) 1 (J M 1 I I

1. The time dependent equations and boundary conditions are included to follow the usual procedure of first writing time dependent equations and then steady state equations when discussing steady state analysis. 2. The scholar only provides the necessary steps for the proof of theorem 2.1 and does not give a satisfactory full proof because the conditions N and S are not yet well established. 3. The models presented have applications in computer networks and communication systems, with chapter 2 applying to CPU and I/O queueing and chapters 3-5 applying to multimedia networks.

Uploaded by

ebenesarb
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1.

For the discussion about steady state analysis, why the time dependent equations
together with their boundary conditions have been included?
Usually first we write time dependent equations then steady state equations. So, we
follow the usual procedure.
2. Why the scholar does not provide a satisfactory proof of theorem 2.1? The N and S
conditions must be well established yet.
We provide only the necessary steps,
M2
M1 M1

1(1) ri (1) pj
(j1) ri
1 A (1 ) i1 2, i j1 i1
+ (1 ) 1 m1 + m1 [2 + 2 + 3 (r0 + ) + 3
M2
j
(j1)
j1
]<1
M1

1(1) ri (1)
i1 2, i
m1 [2 + 2 ] represents the mean number of customers entering orbit
due to the server being busy in both essential and optional service and
M2 M1 M2
p j (1) ri j
(j1)
j1 j j1
i1
m1 [ 3 (r0 + ) + 3 ] is the new arrivals during vacation.

A ( 1 ) 1
(1 ) (1 m1 1) refers the contribution to the orbit size due to batch arrival
during the retrial time excluding the arbitrary customer of the arriving batch whose
service commences so that he no longer belongs to the orbit.
A (1 )
provides the expected number of orbiting customers who enter service
successfully .

3. As there is no indication or justification about real life applications of the models,


the scholar is asked to clarify if any of the models has its applications in our real life
or not?
In real life these models are applied in computer networks and communication systems.

A central server queueing network is the best example of chap 2.here mode 1 represents
the CPU and nodes 2 through M represents the system I/O devices - usually disk
controllers. Jobs are visualized as receiving service at the CPU and then being routed
with prob. to I/O devices.
The number of concurrently active jobs in a computer system is usually restricted to
reduce processor contention and delays due to the processor being time sliced amongst
too many jobs. The admission of jobs usually depends on the number of available
memory partitions. which is similar to admission control.
The processor may undergo maintenance and repair after execution of a program which is
compared to vacation.
Chapter 3 to 5 has been applied in multi media networks that enables the exchange of
multi media information between end systems where multi media applications are
running. Here the routers play the role of servers and the multi media packets are the
customers. Chaper 6 is applied in wireless network communication.
4. As the compact expressions are obtained in terms input values to most of the
performance measures in each chapter, why the numerical calculations have been
made? Also the scholar has not attempted to do optimization exercises, why?
Numerical examples are used to demonstrate the validity of the proposed method.
To verify the analytical expressions
Optimization can be done as a separate research work.
5. What are the advantages of calculating fuzzy numbers for a few measures of interest
over their crisp values?
The queueing decision models under fuzzy environments permits queueing decision
models to have wider applications in practice.
6. When do we say that a retrial attempt of a customer is successful?
If the retrial customer finds free (Idle) server, then we say that a retrial attempt of a
customer is successful.
7. Why did the scholar decide on this particular research topic?
This research topic has very good scope due to recent advancement in computer network.
8. What is most interesting aspect of this research?
Multi stages of service is most interesting aspect of this research because it has wider
application in multi media networks.
9. Can the scholar describe her main findings in a few sentences?
In retrial queueing system, state dependent admission control and multi stages of service
are my new findings..
10. How would the scholar hope that this research could be followed up and taken
further?
This research may be followed by introducing some more aspects like impatient
customers, orbital search, G - Queue, If we find the waiting time distribution then we do
optimization of all models.
11. What are the roles of fuzzy sets in the queueing systems?
Whenever the uncertainty arises we apply fuzzy concept. There is uncertainty in arrival
rate and service rate. The information observed from the numerical investigation will be
very useful for designing a queueing system which involves one or more combinations of
several decisions.

12. When in the system both stochastic and fuzzy are inherited how to handle the
system?
First we formulate the queueing system by applying stochastic concept after that we
taken some queueing parameters like arrival , service rate as fuzzy no..
13. How the methodology changes in the event of single and bulk arrival?
In formulating model, the batch size of bulk arrival are assumed to follow certain
distribution function. and also there is a change in writing governing equatins.
14. How fuzzy sets add to reality in compare to randomness or vice versa?

15. A fuzzy number is an generalization of a regular, real number in the sense that it does
not refer to one single value but rather to a connected set of possible values, where
each possible value has its own weight between 0 and 1.
16.It is used in deciding the effectiveness of the system.

You might also like