Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Performance of ARQ Schemes on Token Ring Networks

Published: 01 July 1988 Publication History
  • Get Citation Alerts
  • Abstract

    Token ring networks differ in the manner in which acknowledgements are handled. In Newhall rings, acknowledgements of data packets are either sent as independent packets or piggybacked on returned data packets. In acknowledgement rings, there is an acknowledgement field in each data packet. The authors present an empirical formula that predicts the average network access delay in networks where the sender is allowed to transmit only one packet each time it seizes the token and discuss its validity. The performance of the stop-and-wait ARQ (automatic-repeat-request) scheme in token ring networks is treated. The average access delay, optimum window size, and maximum achievable throughput as functions of network and protocol parameters in Newhall rings when the continuous ARW scheme is used are studied. Tradeoffs between average access delay and average buffer occupancy time are examined.

    References

    [1]
    {1} W. Stallings, Local Networks, 2nd ed. New York: Macmillan, 1987, pp. 80-163.
    [2]
    {2} D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987, pp. 254-275.
    [3]
    {3} J. L. Hammond and D. J. P. O'Railly, Performance Analysis of Local Computer Networks. Reading, MA: Addison-Wesley, 1986, pp. 193-379.
    [4]
    {4} W. Bux, "Local-area subnetworks: A performance comparison," IEEE Trans. Commun., vol. COM-25, pp. 1465-1473, Oct. 1981.
    [5]
    {5} IEEE Computer Society, Draft IEEE Project 802.1 (Part 1): Overview and Architecture, Oct. 1982.
    [6]
    {6} D. E. Carlson, "Bit-oriented data link control procedures," IEEE Trans. Commun., vol. COM-28, pp. 455-467, Apr. 1980.
    [7]
    {7} W. D. Farmer and E. E. Newhall, "An experimental distributed switching system to handle bursty computer traffic," in Proc. ACM Symp. Problems Optimization Data commun., 1969, pp. 1-33.
    [8]
    {8} D. J. Farber, "A ring network," Datamation, pp. 44-48, Feb. 1975.
    [9]
    {9} W. Y. Cheng, S. Ray, R. Kolstad, J. Luhukay, R. Campbell, and J. WS. Liu, "ILLINET-A 32 Mb/sec. local-area network," in NCC 1981 Proc., 1981, pp. 209-214.
    [10]
    {10} IEEE, "Token-ring access method and physical layer specifications," American National Standard, ANSI/IEEE Standard 802.5, 1985.
    [11]
    {11} D. Towsley, "A statistical analysis of ARQ protocols operating in a nonindependent error environment," IEEE Trans. Commun., vol. COM-29, July 1981.
    [12]
    {12} D. Towsley, "The stutter go back-N ARQ protocol," IEEE Trans. Commun. , vol. COM-27, pp. 869-875, June 1979.
    [13]
    {13} L. W. Yu and J. C. Majithia, "An analysis of one direction of window mechanism," IEEE Trans. Commun., vol. COM-27, pp. 778-788, May 1979.
    [14]
    {14} A. G. Gatfield, "ARQ error control on satellite channel," in Conf. Rec. Int. Conf. Commun., 1974, pp. 22B-1-22B-5.
    [15]
    {15} M. J. Miller and S. Lin, "The analysis of some selective-repeat ARQ schemes with finite receiver buffer," IEEE Trans. Commun., vol. COM-29, Sept. 1981.
    [16]
    {16} W.-Y. Cheng, "Queueing models of token control networks," Tech. Rep. UIUCDCS-R-81-1066, Dep. Comput. Sci., Univ. Illinois, Urbana, IL, 1981.
    [17]
    {17} W. Bux, "Token access performance: Impact of service disciplines, message segmenting and asymmetric traffic flow," presented at IEEE Project 802 Traffic Handling Characteristics, Cambridge, MA, July 1981.
    [18]
    {18} A. Konheim and B. Meister, "Waiting lines and times in a system with polling," J. ACM, vol. 21, pp. 470-490, July 1974.
    [19]
    {19} C. B. Swartz, "Polling in a ring system," J. ACM, vol. 27, pp. 42- 59, Jan. 1980.
    [20]
    {20} M. Eisenbeg, "Queues with periodic service and changeover time," Oper. Res., vol. 19, pp. 440-451, 1972.
    [21]
    {21} P. Mevert, "Two-class priority systems with set-up times," Tech. Memo 72, Oper. Res. Group, Case Instit. Technol., Nov. 1966.
    [22]
    {22} J. S. Sykes, "Simplified analysis of an alternating priority queueing model with set up times," Oper. Res., vol. 18, pp. 1182-1192, 1970.
    [23]
    {23} M. A. Leibowitz, "An approximate method for treating a class of multiqueue problems," IBM J., no. 5, pp. 204-209, 1961.
    [24]
    {24} P. J. Kuehn, "Multiqueue systems with nonexhaustive cyclic service," Bell Syst. Tech. J., vol. 58, no. 3, pp. 671-698, 1979.
    [25]
    {25} O. Hashida and K. Ohara, "Line accommodation capacity of a communication control unit," Rev. Electron. Commun. Lab., Nippon Telegraph and Telephone Public Corp., vol. 20, pp. 231-239, 1972.
    [26]
    {26} S. Halfin, "An approximate method for calculating delays for a family of cyclic-type queues," Bell Syst. Tech. J., vol. 54, pp. 1733-1754, 1975.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image IEEE Transactions on Computers
    IEEE Transactions on Computers  Volume 37, Issue 7
    July 1988
    135 pages

    Publisher

    IEEE Computer Society

    United States

    Publication History

    Published: 01 July 1988

    Author Tags

    1. ARQ schemes
    2. Newhall rings
    3. acknowledgement rings
    4. automatic-repeat-request
    5. average network access delay
    6. computer networks
    7. data packets
    8. optimum window size
    9. performance evaluation
    10. protocol
    11. protocols.
    12. token ring networks

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 0
      Total Downloads
    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 29 Jul 2024

    Other Metrics

    Citations

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media