Show simple item record

dc.contributor.authorRai, Idris A.en_US
dc.contributor.authorAlanyalı, Muraten_US
dc.coverage.spatialHelsinki, Finland
dc.date.accessioned2016-02-08T11:57:57Z
dc.date.available2016-02-08T11:57:57Z
dc.date.issued2001-06en_US
dc.identifier.issn0536-1486
dc.identifier.urihttp://hdl.handle.net/11693/27616
dc.descriptionDate of Conference: 11-14 June 2001
dc.descriptionConference name: ICC 2001- IEEE International Conference on Communications. Conference
dc.description.abstractThis paper concentrates on obtaining uniform weighted round robin schedules for input queued packet switches. The desired schedules are uniform in the sense that each connection is serviced at regularly spaced time slots, where the spacing is proportional to the inverse of the guaranteed data rate. Suitable applications include ATM networks as well as satellite switched TDMA systems that provide per packet delay guarantees. Three heuristic algorithms are proposed to obtain such schedules under the constraints imposed by the unit speedup of input queued switches. Numerical experiments indicate that the algorithms have remarkable performance in finding uniform schedules.en_US
dc.language.isoEnglishen_US
dc.source.titleICC 2001- IEEE International Conference on Communications. Conferenceen_US
dc.relation.isversionofhttps://doi.org/10.1109/ICC.2001.936945
dc.subjectAlgorithmsen_US
dc.subjectAsynchronous transfer modeen_US
dc.subjectHeuristic methodsen_US
dc.subjectQueueing networksen_US
dc.subjectSchedulingen_US
dc.subjectTime division multiple accessen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectPacket networksen_US
dc.titleUniform weighted round robin scheduling algorithms for input queued switchesen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.citation.spage2028en_US
dc.citation.epage2032en_US
dc.identifier.doi10.1109/ICC.2001.936945
dc.publisherIEEE


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record