Information Networks [microform] : A Probablistic Model for Hierarchical Message Transfer / U. Narayan Bhat and Others
- Bib ID:
- 5229136
- Format:
- Book and Microform
- Author:
- Bhat, U. Narayan
- Online Version:
- https://eric.ed.gov/?id=ED060863
Broken link? let us search Trove , the Wayback Machine , or Google for you.
- Description:
-
- [Washington, D.C.] : Distributed by ERIC Clearinghouse, 1971
- 20 p.
- Summary:
-
A strictly hierarchical message transfer scheme requires that a message follow a specified referral path unless finally it is either rejected or filled at any one of the information centers of the network. Thus at each node in the network three decisions can be made: satisfy, reject or refer the message to the succeeding node in the hierarchy. Associating probabilities and costs with each of these decisions, we develop a Markovian model for the total network cost. The mean and variance of total cost are derived. Applicability of the model is discussed by considering the problems related to the estimation of necessary parameters. In particular, a queue theoretic model is developed for estimating response time for a message at an information center. (Author)
- Notes:
-
- ERIC Note: (9 References).
- May also be available online. Address as at 14/8/18: https://eric.ed.gov/
- Reproduction:
- Microfiche. [Washington D.C.]: ERIC Clearinghouse microfiches : positive.
- Subject:
- Other authors/contributors:
- Southern Methodist Univ., Dallas, TX. Computer Science/Operations Research Center
- Available From:
- ERIC
- Copyright:
-
In Copyright
You may copy under some circumstances, for example you may copy a portion for research or study. Order a copy through Copies Direct to the extent allowed under fair dealing. Contact us for further information about copying.
Copyright status was determined using the following information:
- Material type:
- Literary Dramatic Musical
- Published status:
- Published
- Publication date:
- 1971
Copyright status may not be correct if data in the record is incomplete or inaccurate. Other access conditions may also apply. For more information please see: Copyright in library collections.
Request this item
Request this item to view in the Library’s reading room.