Miriam Kadansky

According to our database, Miriam Kadansky authored at least 4 papers between 2000 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2002

Deadlock-Free Routing Based on Ordered Links.

Dah-Ming Chiu, Miriam Kadansky, Radia J. Perlman, John Reynders, Guy L. Steele Jr., Murat Yuksel

Proceedings of the 27th Annual IEEE Conference on Local Computer Networks (LCN 2002), 2002

A Congestion Control Algorithm for Tree-based Reliable Multicast Protocols.

Dah-Ming Chiu, Miriam Kadansky, Joe Provino, Joseph Wesley, Hans-Peter Bischof, Haifeng Zhu

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2000

Pruning algorithms for multicast flow control.

Dah-Ming Chiu, Miriam Kadansky, Joe Provino, Joseph Wesley, Haifeng Zhu

Proceedings of the Networked Group Communication, 2000

Experiences in Programming a Traffic Shaper.

Dah-Ming Chiu, Miriam Kadansky, Joe Provino, Joseph Wesley

Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000), 2000