A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Filters
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks
2004
Theory of Computing Systems
Preserved Fulltext
To our knowledge, this is the first hot-potato algorithm designed and analyzed, in terms of congestion and dilation, for leveled networks. ...
We present a randomized hot-potato routing algorithm for leveled networks, which routes the packets in O((C + L) ln 9 (LN )) time with high probability. ...
To our knowledge, there is no previous work on hot-potato routing on arbitrary networks, not even on leveled networks, for the congestion+dilation routing problems. ...
doi:10.1007/s00224-004-1136-8
fatcat:es76ccjztnctrmwgel26zwdsli
Õ(congestion + dilation) hot-potato routing on leveled networks
2002
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We study packet routing problems, in which we route a set of N packets on preselected paths with congestion C and dilation D. ...
To our knowledge, this is the first hot-potato algorithm designed and analyzed, in terms of congestion and dilation, for arbitrary leveled networks. * Supported from research funds of Rensselaer Polytechnic ...
[6] study hot-potato routing on leveled networks, but for different routing problems than the ones we consider here. ...
doi:10.1145/564871.564874
fatcat:7lrqbuxazfcf7hvf7hpur43tfy
Õ(congestion + dilation) hot-potato routing on leveled networks
2002
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We study packet routing problems, in which we route a set of N packets on preselected paths with congestion C and dilation D. ...
To our knowledge, this is the first hot-potato algorithm designed and analyzed, in terms of congestion and dilation, for arbitrary leveled networks. * Supported from research funds of Rensselaer Polytechnic ...
[6] study hot-potato routing on leveled networks, but for different routing problems than the ones we consider here. ...
doi:10.1145/564870.564874
dblp:conf/spaa/Busch02
fatcat:ahklzxlspva7dd7mleucqc52ge
Near-Optimal Hot-Potato Routing on Trees
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destinations. ...
We construct the first hot-potato routing algorithms whose routing times are asymptotically nearoptimal; that is, the incurred routing times are within polylogarithmic factors from optimal. ...
Conclusions We gave two hot-potato routing algorithms for trees. The deterministic algorithm is appropriate for trees whose degree is bounded by a constant and achieves routing time O(rt * · lg n). ...
doi:10.1007/978-3-540-27866-5_109
fatcat:yblqnfxnjbbwzh2uq6vezetj6y
Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we present and analyze on-line routing schemes with contant bu er size and hot-potato routing schemes for vertex-symmetric networks. ...
., for any bounded degree vertex-symmetric network with self-loops and diameter O(log n) (among them expanders) we obtain a hot-potato routing protocol that needs time O(log 2 n(log log n) 1+ ) f o r a ...
Acknowledgements We w ould like to thank Berthold V ocking for several helpful comments on an early draft of the paper. ...
doi:10.1007/3-540-60313-1_154
fatcat:osqn6zlahnbdjnwrxfgqakftom
BER performance of multiwavelength optical cross-connected networks with deflection routing
1997
IEE Proceedings - Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The results indicate that under the same load the BER performance of single-buffer deflection routing is worse than hot-potato. ...
However, at BER = single-buffer has a higher throughput than hot-potato. ...
However, at BER = single-buffer has a higher throughput than hot-potato because singlebuffer has less traffic congestion. ...
doi:10.1049/ip-com:19971089
fatcat:65fhbbrl5restpk756shkgok34
Universal algorithms for store-and-forward and wormhole routing
1996
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In addition, we present adaptations of our main results for routing along shortest paths in arbitrary networks, and for routing in leveled networks, node-symmetric networks, edge-symmetric networks, expanders ...
The algorithms are analyzed in terms of the number of messages being routed, the maximum number of messages that must cross any edge in the network (edge congestion), the maximum numberof edges that a ...
Simulations of hot-potato routing on various networks have also been performed in AS92, GH92, M89] . ...
doi:10.1145/237814.237982
dblp:conf/stoc/CypherHSV96
fatcat:wxthswnrira3roi7awkdadgnia
Universal Bufferless Routing
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees ...
The heart of the emulation is to replace packet buffering with packet circulation on regions of the network. ...
networks [21] , and leveled networks [8, 11] . ...
doi:10.1007/978-3-540-31833-0_20
fatcat:pp3pie3elzehdafl6syfmvlp6u
Direct routing: Algorithms and complexity
2006
Algorithmica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We give non-trivial lower bounds on such buffering requirements for general routing algorithms. * A preliminary version of this ...
Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be delivered to their destinations without collisions. ...
[10] improve the dilation to be D = O(d 2 D * ), while preserving the congestion bound. ...
doi:10.1007/s00453-005-1189-3
fatcat:t2ne3w7kovce5ppjq4btb2lulu
Direct Routing: Algorithms and Complexity
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We give non-trivial lower bounds on such buffering requirements for general routing algorithms. * A preliminary version of this ...
Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be delivered to their destinations without collisions. ...
[10] improve the dilation to be D = O(d 2 D * ), while preserving the congestion bound. ...
doi:10.1007/978-3-540-30140-0_14
fatcat:rtcv7e6frbev3kjjsgqvz3rqme
Efficient Bufferless Routing on Leveled Networks
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We show that for leveled networks, one can obtain bufferless routing that is at most one or two logarithmic factors from the lower bound: i. ...
Given a set of preselected packet paths, a well known lower bound on the routing time is Ω(C + D), where D is the dilation (maximum path length) and C the congestion (maximum number of times an edge is ...
[6] study hot-potato routing on leveled networks, but for different routing problems than the ones we consider here. ...
doi:10.1007/11549468_102
fatcat:yazgnnzj55cbpel6jiu6aumiru
Efficient bufferless packet switching on trees and leveled networks
2007
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We have the following results: * This paper is based on two preliminary papers: (1) "Efficient Bufferless Routing on Leveled Networks," . projects FLAGS and DELIS. * This is in contrast with non-greedy ...
Bufferless networks are interesting because they model optical networks. We consider the tree and leveled network topologies, which represent a wide class of network configurations. ...
[13] study hot-potato routing on leveled networks, but for different packet problems than the problems we consider here. ...
doi:10.1016/j.jpdc.2007.06.005
fatcat:5gbqtywp7vhd3mqchlpbx2zafu
Methods for message routing in parallel machines
1994
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
., Methods for message routing in parallel machines, Theoretical ...
In hot-potato routing (also called chaos routing), packets cannot be queued. In other words, every packet must move at every step until it arrives at its destination. ...
Moreover, the delays and congestion associated with packets headed for a hot spot can seriously delay other packets that are not headed for a hot spot. ...
doi:10.1016/0304-3975(94)90163-5
fatcat:fyip5pcmyvebtoys2v4ukegwti
Universal Bufferless Packet Switching
2007
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
This behavior of packets in a collision has led to communication algorithms on bufferless networks becoming known as hot-potato or deflection algorithms; here, we will simply call them bufferless. ...
A packet-switching algorithm is universal if it applies to any network topology and for any batch communication problem on the network. ...
not on any available edge as is typically done in hot-potato algo-rithms. ...
doi:10.1137/050642095
fatcat:7orsfqykarhjppt3qz2dcp7tcu
Scientific Opinion on acrylamide in food
2015
EFSA Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
AA was found at the highest levels in solid coffee substitutes and coffee, and in potato fried products. ...
Rodent studies have demonstrated adverse effects of AA on male reproductive parameters including reduced sperm counts and effects on sperm and testis morphology with a no-observed-adverse-effect level ...
Adduct levels in young and adult animals did not differ NH 2 O O HN N N N NH 2 H 2 N OH O N N N N NH 2 O HO NH 2 DNA GA N7-(Carbamoyl-2- hydroxyethyl)guanine (N7-GA-Gua) N3-(Carbamoyl-2- hydroxyethyl)adenine ...
doi:10.2903/j.efsa.2015.4104
fatcat:taezcvssijbgxkaz7h6vm6oava
« Previous
Showing results 1 — 15 out of 93 results