H. 10 20 10 20 10 10 DESTINATION A B C DEF GHI JK ADE 4. BCDE ADJ 6. BCJ А AB ABC AD ADEF ABG ABH ADI ABHIK 10 4. 12 BHIK 4. BA BC BCD BHIGF BG BH BHI 4. 4. 2. CJG 4. DJG 4. 10 CBA CB CD CDE CDEF CBH...

For the given network topology find the best path to go from A to K using flow based routing algorithm knowing that the mean packet size is 800 bits and the mean number of arrivals in packets/sec listed in the table.

Extracted text: H. 10 20 10 20 10 10 DESTINATION A B C DEF GHI JK ADE 4. BCDE ADJ 6. BCJ А AB ABC AD ADEF ABG ABH ADI ABHIK 10 4. 12 BHIK 4. BA BC BCD BHIGF BG BH BHI 4. 4. 2. CJG 4. DJG 4. 10 CBA CB CD CDE CDEF CBH CIGI CJ CJGIK 4. 4. 7. 2. DCB 4. 10 DEFK DA 2. EDA 4. DC DE DEF DJIH DJI DJ 2. 2. 3. EFGI EFGJ 4. 4. 4. EDCB EDC 4. E ED EF EFG EDJIH EFK 6. FGB 5. FG 9. FGIH 5. F FEDA FGJC FED FE FGI FGJ FK 5. 7. GJ 3. HIJ 3. 3 G GBA GBC GFE GI GFK GB GJD GF GIH 41 HIJD 3. HB 2 IHB 4. 2. 4. H HBA 4. HBC 3 IJC HIGFE HIGF HIG HI HIK 10 IGF 3. JGF IHBA LID UDE IG IH IK 3. JD 3. J JDA JCB JC JDE JG JIH JI JGFK 4. 4. KIHB KIG 4. K KFEDA KIGJC KFED KFE KF KIH KI KIJ 10 3. SOURCE