Show simple item record

Fast Time-Dependent Evaluation of Integrated Services Networks

dc.contributor.authorMatta, Ibrahimen_US
dc.contributor.authorShankar, A. Udayaen_US
dc.description.abstractWe present a numerical-analytical method to evaluate integrated services networks with adaptive routing, scheduling and admission controls. We apply our method to connection-oriented networks supporting different types of real-time connections. The network dynamics is described by difference equations which can be solved for both transient and steady-state performances. Results indicate that our method is computationally much cheaper than discrete-event simulation, and yields accurate performance measures. We compare the performance of different routing schemes on the NSFNET backbone topology with a weighted fair-queueing link scheduling discipline and admission control based on bandwidth reservation. We show that the routing scheme that routes connections on paths which are both under-utilized and short (in number of hops) gives higher network throughput. (Also cross-referenced as UMIACS-TR-94-28)en_US
dc.format.extent377426 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3235.1en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-94-28en_US
dc.titleFast Time-Dependent Evaluation of Integrated Services Networksen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record