An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method

Symvonis, A; Tidswell, J

dc.contributor.author	Symvonis, A	en
dc.contributor.author	Tidswell, J	en
dc.date.accessioned	2014-03-01T01:44:14Z
dc.date.available	2014-03-01T01:44:14Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24307
dc.subject	Disjoint Paths	en
dc.subject	Empirical Study	en
dc.subject	Optimal Solution	en
dc.subject	Packet Routing	en
dc.title	An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/12.509915	en
heal.identifier.secondary	http://dx.doi.org/10.1109/12.509915	en
heal.publicationDate	1996	en
heal.abstract	In this paper we present the multistage off-line method, a new and rather natural way tomodel off-line packet routing problems, which reduces the problem of off-line packet routingto that of finding edges disjoint paths on a multistage graph. The multistage off-line methodcan model any kind of routing pattern on any graph and can incorporate the size of themaximum queue allowed	en
heal.journalName	IEEE Transactions on Computers	en
dc.identifier.doi	10.1109/12.509915	en