?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=https%3A%2F%2Fpure.iiasa.ac.at%2Fid%2Feprint%2F4401%2F&rft.title=Shortest+Expected+Delay+Routing+for+Erlang+Servers&rft.creator=Adan%2C+I.J.B.F.&rft.creator=Wessels%2C+J.&rft.description=The+queueing+problem+with+a+Poisson+arrival+stream+and+two+identical+Erlang+servers+is+analysed+for+the+queueing+discipline+based+on+shortest+expected+delay.+This+queueing+problem+may+be+represented+as+a+random+walk+on+the+integer+grid+in+the+first+quadrant+of+the+plane.+In+the+paper+it+is+shown+that+the+equilibrium+distribution+of+this+random+walk+can+be+written+as+a+countable+linear+combination+of+product+forms.+This+linear+combination+is+constructed+in+a+compensation+procedure.+In+this+case+the+compensation+procedure+is+essentially+more+complicated+than+in+other+cases+where+the+same+idea+was+exploited.+The+reason+for+the+complications+is+that+in+this+case+the+boundary+consists+of+several+layers+which+in+turn+is+caused+by+the+fact+that+transitions+starting+in+inner+states+are+not+restricted+to+end+in+neighbouring+states.+Good+starting+solutions+for+the+compensation+procedure+are+found+by+solving+the+shortest+expected+delay+problem+with+the+same+service+distributions+but+with+instantaneous+jockeying.+It+is+also+shown+that+the+results+can+be+used+for+an+efficient+computation+of+relevant+performance+criteria.&rft.publisher=Eindhoven+University+of+Technology&rft.date=1993-11-26&rft.type=Other&rft.type=NonPeerReviewed&rft.format=text&rft.language=en&rft.rights=cc_by&rft.identifier=https%3A%2F%2Fpure.iiasa.ac.at%2Fid%2Feprint%2F4401%2F1%2F453579.pdf&rft.identifier=++Adan%2C+I.J.B.F.+%26+Wessels%2C+J.+%3Chttps%3A%2F%2Fpure.iiasa.ac.at%2Fview%2Fiiasa%2F2510.html%3E++(1993).++Shortest+Expected+Delay+Routing+for+Erlang+Servers.++++Eindhoven+University+of+Technology+%2C+Eindhoven%2C+Netherlands.+++++