A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms

Roberts, A; Symvonis, A

dc.contributor.author	Roberts, A	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:45:29Z
dc.date.available	2014-03-01T01:45:29Z
dc.date.issued	1997	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24591
dc.subject	Deflection Routing	en
dc.subject	General Methods	en
dc.subject	Packet Routing	en
dc.subject	Routing Algorithm	en
dc.title	A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/71.605765	en
heal.identifier.secondary	http://dx.doi.org/10.1109/71.605765	en
heal.publicationDate	1997	en
heal.abstract	In this paper, we consider the deflection worm routing problem on n×n meshes. In deflection routing, a message cannot be queued and it is always moving until it reaches its destination. In worm routing, the message is considered to be a worm, a sequence of k flits which, during the routing, follow the head of the worm, which knows the	en
heal.journalName	IEEE Transactions on Parallel and Distributed Systems	en
dc.identifier.doi	10.1109/71.605765	en