Flit-Serial Packet Routing on Meshes and Tori

Makedon, F; Symvonis, A

dc.contributor.author	Makedon, F	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:44:22Z
dc.date.available	2014-03-01T01:44:22Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24342
dc.subject	Packet Routing	en
dc.subject	and Forward	en
dc.title	Flit-Serial Packet Routing on Meshes and Tori	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/BF01192690	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BF01192690	en
heal.publicationDate	1996	en
heal.abstract	In this paper, we consider the flit-serial packet routing problem, where each packet consists of a sequenceof k flits and is, thus, called a snake. Based on the properties of the snake during the routing, we give aformal definition of three different packet routing models, namely, the store-and-forward model, the cutthrough model, and the cut-through with partial cuts model. Surprisingly,	en
heal.journalName	Theory of Computing Systems / Mathematical Systems Theory	en
dc.identifier.doi	10.1007/BF01192690	en