Academia.eduAcademia.edu

Figure 6 – uploaded by Nils Kammenhuber

See full PDFdownloadDownload figure
Figure 5: Dependence of the stability of the solution dependent on the number of hosts 7.

Figure 5 Dependence of the stability of the solution dependent on the number of hosts 7.

Related Figures (14)

where wp is the weight of path P, i.e., for P € A(u;,u), we have wp = i w(uj,t,ui+1). The measurement value of the next-hop edge ¢;), can be evaluated at r. Let us now specify the information that router v; sends to r. We define
where wp is the weight of path P, i.e., for P € A(u;,u), we have wp = i w(uj,t,ui+1). The measurement value of the next-hop edge ¢;), can be evaluated at r. Let us now specify the information that router v; sends to r. We define
Algorithm 2 Procedure ADAPTWEIGHTS
Algorithm 2 Procedure ADAPTWEIGHTS
Algorithm 1 Main loop of the REPLEX-algorithm
Algorithm 1 Main loop of the REPLEX-algorithm
Figure 2: The Web servers are connected to two client subnets, each reachable via two different routes. Bottleneck edges are dashed.
Figure 2: The Web servers are connected to two client subnets, each reachable via two different routes. Bottleneck edges are dashed.
Figure 1: A set of HTTP servers is connected to a set of HTTP clients via two different routes (7, v1 ,v3) and (7, v2, v3).
Figure 1: A set of HTTP servers is connected to a set of HTTP clients via two different routes (7, v1 ,v3) and (7, v2, v3).
Figure 3: The above plots show how weights are adapted for two routes with speeds 10 Mbit and 100 Mbit over time. The optimal weights for this scenario are 1/11 and 10/11, respectively. For various values of A, T, and 1 the above plots show the weights for two different routes over time. For every choice of parameters, we have two plots of weights, one for each route. We observe that oscillation vanishes as A = A/T decreases.
Figure 3: The above plots show how weights are adapted for two routes with speeds 10 Mbit and 100 Mbit over time. The optimal weights for this scenario are 1/11 and 10/11, respectively. For various values of A, T, and 1 the above plots show the weights for two different routes over time. For every choice of parameters, we have two plots of weights, one for each route. We observe that oscillation vanishes as A = A/T decreases.
Figure 4: The weights assigned to the routes for different rela- tions of bandwidths. The upper plot shows the weights whereas the lower plot shows the link utilisation of the two routes.
Figure 4: The weights assigned to the routes for different rela- tions of bandwidths. The upper plot shows the weights whereas the lower plot shows the link utilisation of the two routes.
Figure 6: The Rocketfuel topology for EBONE (AS 1755, .r0 map) consists of 172 routers.
Figure 6: The Rocketfuel topology for EBONE (AS 1755, .r0 map) consists of 172 routers.
Figure 8: A set of D Web clients is connected to router v3 and a set of D/k clients waking up at time 7; = 500s is connected to router v>.
Figure 8: A set of D Web clients is connected to router v3 and a set of D/k clients waking up at time 7; = 500s is connected to router v>.
acca castoris Se tie east eects) Figure 11: Network performance during 1 hour of simulation time. Application layer throughput increases even after the main weight shift has occurred (vertical line) and only ceases increasing well after 10 minutes.
acca castoris Se tie east eects) Figure 11: Network performance during 1 hour of simulation time. Application layer throughput increases even after the main weight shift has occurred (vertical line) and only ceases increasing well after 10 minutes.
Figure 10: Development of weight shifts during the first 10 min- utes. Large weight shifts occur only within the first 2 minutes (vertical line).
Figure 10: Development of weight shifts during the first 10 min- utes. Large weight shifts occur only within the first 2 minutes (vertical line).
Figure 7: Simulation results for the topology depicted in Fig. 2 using bandwidths 10 Mbit, 34 Mbit and 100 Mbit, respectively for the bottleneck edges and 100 Mbit for the other edges.
Figure 7: Simulation results for the topology depicted in Fig. 2 using bandwidths 10 Mbit, 34 Mbit and 100 Mbit, respectively for the bottleneck edges and 100 Mbit for the other edges.
Related topics:
Computer ScienceCommunity NetworksMultipath RoutingFlash crowdsDynamic Routingconvergence timeEarly experience
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved