{"id":12856,"date":"2021-11-22T18:42:38","date_gmt":"2021-11-22T23:42:38","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12856"},"modified":"2026-06-02T14:59:25","modified_gmt":"2026-06-02T18:59:25","slug":"tr-96-19-many-to-one-packet-routing-via-matchings","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/tr-96-19-many-to-one-packet-routing-via-matchings\/","title":{"rendered":"TR-96-19: Many-to-One Packet Routing via Matchings"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n TR-96-19: Many-to-One Packet Routing via Matchings\n <\/h1>\n \n \n <\/header>\n\n <\/div>\n\n <\/div>\n\n <\/div>\n<\/section>\n\n

ÐÓ°ÉÔ­´´ University
\nTechnical Report<\/a> TR-96-19
\nJuly 1996<\/p>\n\n\n\n

Many-to-One Packet Routing via Matchings<\/h2>\n\n\n\n
\n
\n
\n
\n
\n
\n
Danny Krizanc & Louxin Zhang<\/div>\n<\/div>\n<\/div>\n
\n

Abstract<\/h3>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n
\n

In this paper we study the packet routing problem under the matching model proposed by Alon, Chung and Graham \\cite{ACG94}. We extend the model to allow more than one packet per origin and destination node. We give tight bounds for the many-to-one routing number for complete graphs, complete bipartite graphs and linear arrays. We also present an efficient algorithm for many-to-one routing on an trees (and therefore any graph).Finally, we give bounds for routing arbitrary relations in this model.<\/p>\n

TR-96-19.pdf<\/a><\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

ÐÓ°ÉÔ­´´ University Technical Report TR-96-19 July 1996 Many-to-One Packet Routing via Matchings Danny Krizanc & Louxin Zhang Abstract In this paper we study the packet routing problem under the matching model proposed by Alon, Chung and Graham \\cite{ACG94}. We extend the model to allow more than one packet per origin and destination node. We give […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":12155,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-12856","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12856","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12856"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12856\/revisions"}],"predecessor-version":[{"id":12857,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12856\/revisions\/12857"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12155"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12856"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12856"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}