Results 1 - 10 of 79,024

Table 5. Comparison of transparent designs: Shared Mesh vs. Unprotected and Dedicated protection designs.

in unknown title
by unknown authors 2001
Cited by 2

TABLE IV TIME (IN SECONDS) FOR SOLVING THE 1+1 PROTECTING ROUTING PROBLEM ON REALISTIC OPTICAL NETWORKS BY THE H1+1-BFBAB, THE EI1+1-BFBAB ALGORITHM AND CPLEX

in Branch-and-Bound Algorithms for Constrained Paths and Path Pairs and Their Application to Transparent WDM Networks
by Franz Rambach

Table 2: The network design proposed by the SPR and DAP algorithms for the Test 1 virtual topology. For each clear-channel CC, the route chosen by the two algorithms are shown.

in Design of a Survivable WDM Photonic Network
by Politecnico Federale, Di Losanna, J. Armitage, O. Crochat, J.-Y. Le Boudec
"... In PAGE 16: ... One can note from Table 3 that all the clear-channels having node 18 as one end-node are blocked { for the SPR design { if the optical link (16,18) is broken. One can see in Table2 that when using the SPR design, clear-channels (5,18), (8,18), (11,18) and (16,18) have the optical link (16,18) as part of their route. This of course lead to a problem in case of link (16,18) failure, as it is the only one used to reach node 18, even if another one is available, the link (18,20).... In PAGE 16: ... This of course lead to a problem in case of link (16,18) failure, as it is the only one used to reach node 18, even if another one is available, the link (18,20). The design proposed by the DAP algorithm avoids this problem by choosing another route for the clear-channel (11,18), longer but not using the link (16,18) (see Table2 ). This allows to have an alternate path not using link (16,18) for the three clear-channels that uses it { (5,18), (8,18) and (16,18) { and one not using... In PAGE 21: ...Non-protected clear-channels for SPRA (8,9) (3,12), (4,9), (4,12), (5,9), (9,10), (9,16), (10,12) (9,12) (3,12), (4,12), (10,12) (16,18) (5,18), (8,18), (11,18), (16,18) Table 3: The broken pairs of the SPR design shown in Table2 . NB In the DAP design all the clear-channels are protected.... ..."

Table 1. Network topologies

in Deadlock-free Routing Based on Ordered Links
by Dah Ming Chiu, Miriam Kadansky, Radia Perlman, John Reynders, Guy Steele, Murat Yuksel
"... In PAGE 7: ...of different partitionings. To compare the different algorithms, we used the topolo- gies listed in Table1 . The names of the topologies roughly follow the convention: type-nodes-links-otherparam.... ..."

Table 3 Maximum number of required fibers with and without protection

in Optimizing Fiber Topologies for WDM Optical Networks Based on Multi-Granularity Optical Switching Technology *
by Li Junjie (李俊杰, Li Yanhe (李艳和
"... In PAGE 8: ... Therefore, the NSFNET and 36NodeMesh used the topologies ob- tained by the MLCR algorithm, while the ARPANET and ChinaNet used the results obtained by the joint al- gorithm. The results for WP,max listed in Table3 show that in most cases the additional fibers to establish the protection fiber links are less than the number of required fibers to construct the original non-protected fiber topology. Table 3 Maximum number of required fibers with and without protection ... ..."

Table 1. Parameters for butterfly, mesh and hypercube topology.

in Impact of Failure on Interconnection Networks for Large Storage Systems
by Qin Xin, Ethan L. Miller, Thomas J. E. Schwarz, et al. 2005
"... In PAGE 4: ... Previous work [10] estimated the required number of nodes and ports for a petabyte-scale storage system us- ing butterfly, mesh and hypercube topology. We list the parameters set up in our simulator in Table1 . The butterfly network is a hierachical structure with one level of routers, three levels of switches with 128 switches per level.... ..."
Cited by 2

Table 2: Wavelength conversion gains for network design algorithms with static demand. All studies were done for the mesh topology. WT: Wavelength Tunable, WNT: Wavelength Non-Tunable.

in Performance of WDM Transport Networks
by Ezhan Karasan, Ender Ayanoglu

Table 1. Different Network Topology

in unknown title
by unknown authors
"... In PAGE 6: ..., 2 are 2.0, 1.0, and 1.5 respectively. We will compare the end-to-end delays of different topologies NT1 to NT6 listed in Table1 . The Concord algorithm is used at the receivers.... ..."

Table 1. Different Network Topology

in Delay Scheduling Algorithms for Differentiated Service
by Thu Ngo, Quynh Holger, Karl Adam, Wolisz(** Klaus Rebensburg
"... In PAGE 6: ..., 2 are 2.0, 1.0, and 1.5 respectively. We will compare the end-to-end delays of different topologies NT1 to NT6 listed in Table1 . The Concord algorithm is used at the receivers.... ..."

Table 2: Bandwidth blocking rate: cluster topology, 144 MB/s, 50% QoS sessions and 50% high-bandwidth sessions.

in Supporting Dynamic Inter-Class Resource Sharing: A Multi-Class QoS Routing Algorithm
by Qingming Ma, Peter Steenkiste 1999
"... In PAGE 10: ... algorithm cannot take advantage of this additional freedom. Table2 shows the bandwidth blocking rates for QoS traffic for the same scenariosas Figure 11. The blockingrates are higherwhen only a small fraction of the link capacity can be reserved by QoS traffic.... In PAGE 10: ... This is not surprise: a low maximum reservation ratio limits the freedom of routing algorithms and results in poor performance for both traffic classes. The results in Table2 clearly show that a higher maximum reservation ratio translates into higher network throughput. Since these results are for a 50/50 distribution of the traffic between the QoS and best effort classes, the low maximum reservation ratio can be viewed as a simple static partioning of network resources between the two traffic classes.... In PAGE 10: ... In this case, we observe poor performance for both best effort and QoS sessions. Figure 11 combined with Table2 show that dynamic inter-class resource sharing combined with a high maximum reservation ratio results in the best performance. 5.... ..."
Cited by 20
Results 1 - 10 of 79,024