Jointly Optimal Admission and Routing Controls at a Network Node

Simple item page
dc.contributor.authorLambadaris, Ioannis E.en_US
dc.contributor.authorNarayan, Prakeshen_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:47:32Z
dc.date.available2007-05-23T09:47:32Z
dc.date.issued1991en_US
dc.description.abstractWe consider the problem of jointly optimal admission and routing at a data network node. Specifically, a message arriving at the buffer of a node in a data network is to be transmitted over one of two channels with different propagation times. Under suitably chosen criteria, two decisions have to be made: Whether or not to admit an incoming message into the buffer, and under what conditions should the slower channel be utilized. A discounted infinite-horizon cost as well as an average cost are considered. These costs consist of a linear combination of the blocking probability and the queuing delay at the buffer. The optimal admission and routing strategies are shown to be characterized almost completely by means of "switching curves".en_US
dc.format.extent1151678 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5070
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1991-21en_US
dc.subjectnetwork managementen_US
dc.subjectqueuing networksen_US
dc.subjectCommunication en_US
dc.subjectSignal Processing Systemsen_US
dc.titleJointly Optimal Admission and Routing Controls at a Network Nodeen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_91-21.pdf
Size:
1.1 MB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports