A Study of Queueing Models for a Stochastic and Fuzzy Setting with Communications Framework

INTRODUCTION

In recent years, the researchers in the queuing review have researched the communications mechanism, the method of data traffic. In general, the arrival and the service processes are expected to be separate but they are interdependent in a variety of realistic circumstances. The communications network has been examined by most researchers in this field as linked queues, on the premise that Jenq[1984], Hosida[1993], Rao Srinivasa et al. are interdependent in terms of arrival and service patterns[2000]. Few attempts were made to build and evaluate interdependent communication networks which can have a major impact on device efficiency, and which are most frequently found in packet radio systems. Store and forward data or transmission of voices, teleprocessing etc. Rao Schwinivasa et al [2003] has established a network of interdependent communication networks, supposing that the mechanism of arrival and transmission at the network node is interrelated to the one in which Poisson is bi-variable and that there is a joint probability mass function (pmf). Packet arrivals are expected to be

message arrives in bulk of packets in the buffer. In the further process of creating an interdependent communications system, Rao Srinivas et al. [2006] believed that arrivals were huge. Singh T.P [2011] recently expanded Rao Srinivasa's study[2006] to develop a communication-network queue model for geometrical distribution of arrival messages. Singh T.P measured the average transmission of delays and difference in the number of packets in the buffer using the Chapmann Kolmogrov equations. Singh T.P. expanded the work further. & Kusum et al. [2012] & explored a fluid queue model of interdependence in a voice-packed communication system, statistical multiplexing under a triangular, fuzzy environment. Communication was investigated because the demand on the transmission line is volatile and uncertain, congestion in the communications system exists. The messages and the activities involved were therefore considered to be trapezoidal fluorescences in nature in the transmission of massages, service pattern, etc. Often called trapezoidal fuzzy in nature are the co- variance from the composite arrival to the completion of transmission. Our model is more practical than previous authors' work. This interdependent network will minimise the mean buffer length and buffer content variability when the environment is fluctuating. Through statistical multiplexing of the transmission network, the delay in packet switching can be minimised.

We apply an interdependence fluorescent queue model in this section to a communication system with statistical multiplexing packed data/voice integration. In an overload case, the transmission of the packet is lowered into the multiplex queue in order to relive the congestion. The arrival processes are often approximated as the amount of arrivals is divided into different random length packets in the bundled data/voice transmission. The communications, utilities and the completion of transmission were believed to be trapezoidal in nature. Fuzzy Set is a powerful method for modelling ambiguous and imprecise situations under which reliable analysis is difficult or not. In order to calculate the ambiguities of a fumbling set, Zadeh established his fluid theory. The idea of fugitious set is central to the theory, which is the common crisp set that captures progressive transitions from affiliation to non-belonging to setting. It is also theoretical and realistic to see how various characteristics of crisp collection can be generalised in the foggy situation. These spent on transfer and variability of the buffer material and is closer to the situation in the real world.

Take into account the arrival of packets and the number of transmissions. Both follow a bi-variate mechanism based on Milne [1974] & Rao Srinivasa et al [2000] that has a similar probability mass function. The buffer capacity is expected to be infinite and a random x variable is taken in the fuzzy setting for the number of packets arriving in any module. The composite arrival rate of packets and the covariance of the composite arrivals and transmission completions The covariance is created by a bit of a flux control mechanism which induces a reliance on messages from services.

The differential equation of the fuzzy system can be seen in transient form by connecting the probability consideration. as:

If the system's behaviour becomes independent of the time, the stable state is reached. The steady state equations are: Assumes the p.g.f number of the buffer packets and the number of packets that separate the message: Multiplying (2) with & summing over after simplification, we get From Use (5) in (4) we have For

Using condition Probability that the system is empty is Expanding P(z) and collecting the coefficient of zi, the probability that the system size is ‗i‘ as, This allows the interdependent contact network to enter the fugitive world without bulk arrivals. The average fluidity in the system is Values of Average number of packets (L)

Tables 1 and 2 indicate that, if they are positive and other parameters set, the average number of packets within a network as well as in the buffer is decreasing as separate parameters increase. Also, the average packet number in the fuzzy Network and buffer increases as the α value increases of . This network has a medium buffer length lower than the traditional mass-arrival network with no interdependence. But if the covariance of composite arrivals and the completion of the transmission is flat in nature, the results are not so horizontally constrained. All system parameters are floating in nature and the behaviour of the system is not inherently monotonous. The monotone behaviour of the

also indicates the same actions when defuzzing. (i) If the arrival models are crisp in terms of operation and conversion, the outcome of the model is the timing of the work carried out by the Rao Srinivasa[2006] and Singh T.P[2011]. (ii) If the data are considered in triangular fluidity rather than the trapezoidal fluid numbers, the findings are consistent with the work done by Singh T.P., Kusam et al [2012].

This section looks at how an interdependency queue model is used to interact with the statistical multiplexing bundled in voices. Approximating the arrival of packets and transmission under a bi-variable Poisson method tests the efficiency of the statistical multiplexing, assuming data packets are saved for transmission and transmitted in an uninterrupted way following the transmission of speech. The transmitter's idle time assumes the negative exponential distribution. Determined and analysed for the model are a robust solution and the device characteristics. For better understanding, table and diagram are given. Integrated data/voice transmission techniques for the optimum usage of the channel are discussed. The analysis was done with the same rating and hypothesis as in this section the world was deemed probable by some additional hypotheses and ratings. P(1,i)= Probability that i packets of voice are in buffer. P (0,i) = Probability that i packets of data are in buffer. Flow control is important since a device can transfer information at a fastened rate than it can be received and processed by the destination computer. It can be distinguished from the congestion control, which is used when the congestion actually occurs to control the data flow. This is only possible if the computer is heavily trafficed than the computer it sends or if the computer receives less computing power.

[1] Provided the data packets are stored for transmission and forwarded after voice transmission as and when the transmitter is idle.

(1) The probability that there is no arrival and no service completion during a small intervals of time ∆t, when the system is in faster rate of arrival is . (2) The probability that there is one arrival & no service completion during a small interval of time ∆t, when the system is in faster rate of arrivals, is (3) The probability that there is no arrival and one service completion during a small interval of time ∆t, when the system is either in faster or slower rate of arrival is

The transition densities of the process are given by: The Steady state Equations of Network which are written through matrix of densities [aij] are given by:

The majority of fuzzy Queueing Networks methods varies from probability theory and use fluctuating numbers for arrivals and prices. Before deriving fuzzy queueing networks, Negi and Lee propose combining randomness with fluidity in order to take advantage of both approaches. This research field of high interest follows our analysis with the use of fluid statistics to construct estimators for the probability distribution parameters of the Queueing networks. The fouzzy probabilistic method we propose combines fouzzy estimators with parallel service channels in queueing networks (M/M/S queueing models). We elaborated formulas in a simpler and more efficient way. Using fuzzy estimators, a new method has been proposed for calculating the fog efficiency of M/M/S Queueing systems. If the unsafe data has been used to build and/or analyse a queue model, the proposed method may be used. We thus remove the drawbacks of an approximate point or trust interval, if inaccurate sample information cannot estimate the distribution parameters of a Queueing network. A new method of analysing the fluttered tails called the L-R method was studied, based mainly on L-R fluttered arithmetic. For the output measurements of the model, the L-R representation was used. This approach is used to successfully measure the anticipated number of customers and the average wait times on the model FM/FM/1 and to find results in L-R representation. This representation offers a lot of details for blurry results rather than crisp results. In conventional Queuing theory, the mean value of the fuszy measure corresponds to the average. Both spreads help to make the fluid weigh lower and higher. We are optimistic that the L-R approach will support further research in the creation and assessment of fuse Queueing network performance measures to generate results for some open problems.

REFRENCES

1. O‘Brien, G.G, [1954]. ―The solution of some queuing problems‖, J.Soc.Ind., App. Math, Vol.2, pp. 133-142. 2. Ckson R.R.P. [1954]. ―Queuing systems with phase type service:, O.R. Quart, Vol 5, pp. 109-120 3. Hunt G. C., [1955] Sequential arrays of waiting lines. Operation Research. Vol. 4(6), pp. 674-683. 4. Burke, P.J. [1956] ―The output of a queuing system‖, Oper, Ress.Vol.4, pp. 699-714. 5. Jackson, R.R.P., [1956] ―Random Queuing Process with phase service‖, J.Roy, Statist. Soc.Ser.B, Vol. 18, pp. 129-132. 6. Jackson, J.R., [1956] ―An extension of Johnson‘s results in Job-lot scheduling‖, Naval Res. Log. Quart. Vol. 33, pp. 3-6. 7. Benes, V.E., [1956]‖On queuing with Poisson arrivals‖ Ann. Math. Stat.Vol.28, pp. 670-677. 8. Jackson. J.R. [1957] ―Network of waiting lines,‖ Operation Research. Vol.5 (4), pp. 518-521. 10. Cohen J W. [1957] A survey of queuing problems occurring in the telephone and telegraph traffic theory [C]. Oxford: Proceedings of the First International Conference on the Operational Research, pp. 138-145. 11. Haight F.A. [1957] ―Queuing with Balking‖ Biometric, vol.44, pp. 360- 369.

Research Scholar, Department of Mathematics, BMU, Rohtak mamtanagwan@gmail.com