Thesis (M.S.)--Ohio University, August, 1994. / Title from PDF t.p.

M.Ing. / The Internet is evolving into a global communication infrastructure that is expected to support an overabundance of new applications such as IP telephony, interactive TV, and e-commerce. The existing best effort service is no longer sufficient. It is not enough to provide differentiated services and to meet QoS requirements of these different traffic types. As a result, there is an urgent need to provide more services that are powerful such as guaranteed services, flow protection etc, merged in one IP network, referred to as Integrated Services Packet-Switching Network (ISPN) in this thesis. To provide these services, QoS aware network architectures are required to implement the services. This dissertation presents a survey on two network architectures: Fair Queuing (FQ) and Scalable Core (SCORE), which attempt to provide QoS solutions in ISPN. We theoretically analyse scheduling as an important element in providing QoS in these architectures. The important thread in scheduling is performance and implementation complexity. SCORE based scheduling have less implementation complexity but cannot exactly match the high performance of FQ solutions, which suffer implementation complexity. The contribution of this work is a feedback protocol that minimises congestion in SCORE scheduling scheme called Core stateless fair queuing (CSFQ). The flow rates are adjusted by sending rate signal to a transmitting node from a receiving node, to adjust ill-behaved flow rate during congestion to a fair share rate of receiving node. We use CSFQ based theoretical analysis and simulations to demonstrate the performance of the feedback protocol.