SIMULATION RESULTS FOR DYNAMIC, CENTRALIZED ROUTING IN COMMUNICATION NETWORKS.

Stassinopoulos, GI

dc.contributor.author	Stassinopoulos, GI	en
dc.date.accessioned	2014-03-01T02:47:36Z
dc.date.available	2014-03-01T02:47:36Z
dc.date.issued	1984	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33266
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0021550082&partnerID=40&md5=bf68aabdd4190e4c2fc6e789be017d01	en
dc.subject.other	COMPUTER PROGRAMMING - Algorithms	en
dc.subject.other	TELEPHONE SYSTEMS - Traffic Analysis	en
dc.subject.other	COMMUNICATION SWITCHING	en
dc.subject.other	STOCHASTIC MODELING	en
dc.subject.other	TRAFFIC CONGESTIONS	en
dc.subject.other	COMPUTERS	en
dc.title	SIMULATION RESULTS FOR DYNAMIC, CENTRALIZED ROUTING IN COMMUNICATION NETWORKS.	en
heal.type	conferenceItem	en
heal.publicationDate	1984	en
heal.abstract	The stochastic modeling of congestion appearing either from sudden changes of input traffic or from abrupt events in the network as loss of links or nodes is considered. The author examines algorithms that can solve the dynamic problem in online applications. Satisfactory solutions exist for the single destination case, while the problem with multiple destinations remains essentially open. The author extends the applicability of the above algorithms beyond the transient case, where only congestions have to be cleared, and tries to link the dynamic and static approach. Computational results are given for different ways of incorporating dynamic algorithms in the overall routing policy.	en
heal.publisher	Peter Peregrinus Ltd, London, Engl	en
heal.journalName	[No source information available]	en
dc.identifier.spage	163	en
dc.identifier.epage	167	en