• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 24,954
Next 10 →

Table 2: Normalized throughput of hot-potato routing (n0 = 4) in a (2; k) shu enet with di erent network sizes, N, for the routing algorithm we consider here. 1 is the store-and- forward throughput of the shu enet. 5.3 Hot-Potato and One-Bu er Cases Let Ebs[D] be the expected number of hops (expected delay) for a packet in a shu enet with bu er size bs using the rout- ing algorithm under high load. It is shown in the Appendix that, for hot-potato routing,

in Asymptotic Performance of a Buffered Shufflenet with Deflection Routing
by Shueng-Han Gary, Hisashi Kobayashi

Table 3: Normalized throughput of a shu enet with one bu er (n1 apos; 16) for the type of routing algorithm we con- sider. The throughput of a shu enet with only one bu er is more than 70% of the store-and-forward case. in a shu enet can increase the throughput greatly. In fact, the improvement in throughput with only one bu er over the hot-potato case can be very impressive. This is generally true for the wide range of network sizes considered. Actually, us- ing Equations (12), (38) and (39), we can express the ratio between the throughput of the hot-potato and one-bu ered cases as

in Asymptotic Performance of a Buffered Shufflenet with Deflection Routing
by Shueng-Han Gary, Hisashi Kobayashi

TABLE I EFFECT OF HOT POTATO TECHNIQUE (HP) ON RESOURCE UTILIZATION

in Optimizing Designs Using the Addition of Deflection Operations
by Jennifer L. Wong, Student Member, Miodrag Potkonjak, Sujit Dey

Table 1 Effects of Hot Potato Technique (HPT) on Resource Utilization: IR (II)and HR (HI) - the number of registers (interconnects) before and after the application of HPT; RR and RI - reduction in the number of registers and interconnect (%)

in Optimizing Resource Utilization and Testability Using Hot Potato Techniques
by Miodrag Potkonjak, Sujit Dey 1994
"... In PAGE 4: ...0 Experimental Results The hot potato transformation approach for the optimization of resource utilization was applied on seven high level synthesis examples. The initial and final number of registers and interconnects, as well as percentage reduction in their numbers, are shown in Table1 . The... ..."
Cited by 2

Table 6: Design 2: analyze protocol performance under com- peting goals of Hot and Cold Potato routing. Sample Space Size: 14,348,907, + = searched.

in A case study in understanding ospf and bgp interactions using efficient experiment design
by David Bauer, Murat Yuksel, Christopher Carothers, Shivkumar Kalyanaraman 2006
"... In PAGE 6: ... Now that we have a validation that the OSPF domain ad- versely impacts the BGP domain, we can begin to focus our experiments on the hypothesized cause of the interruptions. In Table6 we investigate the effects of cold versus hot potato routing. In this design we perform a simple full-factorial of RRS optimizations, turning Hot Potato routing on/off, and the MED on/off within the BGP decision algorithm.... ..."
Cited by 1

Table 1: Principle steps in the BGP decision process

in Network Sensitivity to Hot-Potato Disruptions
by Renata Teixeira, Aman Shaikh, Tim Griffin, Geoffrey M. Voelker
"... In PAGE 3: ... In fact, hot-potato routing happens because the IGP distance to the BGP next-hop (the egress point) is one of the steps in the decision process used by a router like a32 to select the best BGP route for a given prefix. Table1 presents the steps in the BGP decision process. A router uses the decision process on a per prefix basis, i.... ..."

Table 1: Principle steps in the BGP decision process

in ABSTRACT Network Sensitivity to Hot-Potato Disruptions
by Renata Teixeira, Aman Shaikh, Tim Griffin, Geoffrey M. Voelker
"... In PAGE 3: ... In fact, hot-potato routing happens because the IGP distance to the BGP next-hop (the egress point) is one of the steps in the decision process used by a router like a32 to select the best BGP route for a given prefix. Table1 presents the steps in the BGP decision process. A router uses the decision process on a per prefix basis, i.... ..."

Table 1 Effect of Hot Potato Technique (HP) on Resource Utilization: InitReg and HPReg - the number of registers before and after the application of HPT; InitIntc and HPIntc - the number of interconnects before and after the application of HPT; RegR educand IntcReduc - reduction in the number of registers and interconnect (%)

in Hot Potato Techniques in High Level Synthesis
by Miodrag Potkonjak, Sujit Dey
"... In PAGE 25: ...(FFT]. The initial and final number of register and interconnects, as well as relative reduction in their numbers, are given in Table1 . Both the average and the median reduction in the number of interconnects were 37% and both the average and the median reduction in the number of registers were 14%.... ..."

Table 7: This table illustrates the steps used in the BGP de- cision algorithm for route updates. Each entry illustrates how many times a particular step resulted in a tie-breaking event.

in A case study in understanding ospf and bgp interactions using efficient experiment design
by David Bauer, Murat Yuksel, Christopher Carothers, Shivkumar Kalyanaraman 2006
"... In PAGE 6: ...Which steps in the BGP decision algorithm are most im- portant? Table7 quantifies the tie-breaking steps in the BGP decision making algorithm. We expected MED and Hot Potato to play a larger role in the algorithm, based on previous work [13, 12].... ..."
Cited by 1

Table 2. % Change of routing power

in
by unknown authors
"... In PAGE 3: ... C. Power Comparisons Table2 shows the percentage improvement in total routing power of the benchmarks for the three cases compared with the single high Vdd (1.8V) routing architecture.... ..."
Next 10 →
Results 1 - 10 of 24,954
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University