Imbedded Markov Chains
The queueing model considered to this point is predicated on exponentially distributed service times. This is appropriate to voice communications where the holding time of a call is exponentially distributed. However, as we have seen in Chapter 2, in computer communications a frequently used technique is packet switching, in which data messages are broken up into fixed-size blocks each of which are addressed, thereby forming a packet. Packets are routed through the network as separate entities by means of the addresses. Packet switching allows facilities to be shared among many bursty data sources; each source is given full access to transmission facilities according to immediate need.
KeywordsService Time Busy Period Probability Generate Function Distribute Service Time Packet Switching
Unable to display preview. Download preview PDF.