BIFURCATED SHORTEST PATH ROUTING IN COMMUNICATION NETWORKS.

Stassinopoulos, GI; Bambos, N

dc.contributor.author	Stassinopoulos, GI	en
dc.contributor.author	Bambos, N	en
dc.date.accessioned	2014-03-01T02:47:36Z
dc.date.available	2014-03-01T02:47:36Z
dc.date.issued	1985	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33278
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0022318626&partnerID=40&md5=f59bdd1b9bd1457b3ae6357b35500cd9	en
dc.subject.other	MATHEMATICAL TECHNIQUES - Algorithms	en
dc.subject.other	COMMUNICATION NETWORKS	en
dc.subject.other	SHORTEST PATH ROUTING	en
dc.subject.other	COMPUTERS, DIGITAL	en
dc.title	BIFURCATED SHORTEST PATH ROUTING IN COMMUNICATION NETWORKS.	en
heal.type	conferenceItem	en
heal.publicationDate	1985	en
heal.abstract	The routing problem in data communication networks is examined. We propose a bifurcated routing following a shortest path rule, so that each node does not use exclusively one single path towards the destination, as happens in current shortest path implementations. Properties of the proposed routing are examined and a corresponding algorithm is given.	en
heal.publisher	North-Holland, Amsterdam, Neth	en
heal.journalName	[No source information available]	en
dc.identifier.spage	297	en
dc.identifier.epage	302	en