M. Karol, S. Golestani, and D. Lee, "Prevention of Deadlocks and Livelocks in Lossless, Backpressured Packet Networks," in the proceedings of INFOCOM 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....cycles, and, as such, can potentially improve the performance of many other networking applications. In particular, it brings the potential of significantly improving the performance of local area networks, such as Gigabit Ethernet, where packetforwarding loops and deadlocks need to be prevented [14], 25] These networks currently implement the simple spanning tree algorithm [21] It can also be useful for preventing the appearance of deadlocks in wormhole routing networks, such as networks of workstations (NOWs) 30] 31] These examples illustrate the general problematic nature of cycles ....

M. Karol, S. Golestani, and D. Lee, "Prevention of Deadlocks and Livelocks in Lossless, Backpressured Packet Networks," in the proceedings of INFOCOM 2000, pp. 1333-1342, Tel Aviv, Israel.

....cycles, and, as such, can potentially improve the performance of many other networking applications. In particular, it brings the potential of significantly improving the performance of local area networks, such as Gigabit Ethernet, where packet forwarding loops and deadlocks need to be prevented [12], 23] These networks currently implement the simple spanning tree algorithm [19] It can also be useful for preventing the appearance of deadlocks in wormhole routing networks, such as networks of workstations (NOWs) 28] These examples illustrate the general problematic nature of cycles in ....

M. Karol, S. Golestani, and D. Lee, "Prevention of Deadlocks and Livelocks in Lossless, Backpressured Packet Networks," in the proceedings of INFOCOM 2000, pp. 1333-1342, Tel Aviv, Israel.

....cycles, and, as such, can potentially improve the performance of many other networking applications. In particular, it brings the potential of significantly improving the performance of local area networks, such as Gigabit Ethernet, where packet forwarding loops and deadlocks need to be prevented [13], 24] These networks currently implement the simple spanning tree algorithm [20] It can also be useful for preventing the appearance of deadlocks in wormhole routing IEEE INFOCOM 2002 9 networks, such as networks of workstations (NOWs) 29] 30] These examples illustrate the general ....

M. Karol, S. Golestani, and D. Lee, "Prevention of Deadlocks and Livelocks in Lossless, Backpressured Packet Networks," in the proceedings of INFOCOM 2000, pp. 1333-1342, Tel Aviv, Israel.

No context found.

M. Karol, S. Golestani, and D. Lee, "Prevention of Deadlocks and Livelocks in Lossless, Backpressured Packet Networks," in the proceedings of INFOCOM 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC