E. Modiano and A. Ephremides, "Efficient algorithms for performing packet broadcasts in a mesh network," IEEE/ACM Trans. on Networking, vol. 4, no. 4, pp 639-648, Aug. 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Framework for Routing and Congestion Control in Multicast.. - Sarkar, Tassiulas (1999) (1 citation) (Correct)
....by existing multicast routing protocols like DVMRP[5] CBT[1] PIM[6] MIP[16] are not known. We proposed a throughput optimal routing and scheduling. Throughput optimal algorithms in generalized multicast networks were not known before. However some previous work exists for broadcast networks. [14] proposes a throughput optimal algorithm for broadcasts in a mesh network. 26] proposes a routing policy which attains at least 50 of the maximum possible throughput in an arbitrary broadcast network. Since unicast and broadcast are special cases of multicast, MMRS applies to both unicast and ....
E. Modiano and A. Ephremides. Efficient Algorithms for Performing Packet Broadcasts in a Mesh Network IEEE Transactions on Networking, Vol. 4. No. 4. August' 96
A Framework for Routing and Congestion Control for Multicast .. - Sarkar, Tassiulas (1998) (1 citation) (Correct)
....existing multicast routing protocols like DVMRP[5] CBT[1] PIM[6] MIP[18] are not known. We have proposed a throughput optimal routing and scheduling. Throughput optimal algorithms in generalized multicast networks were not known before. However some previous work exists for broadcast networks. [16] proposes a throughput optimal algorithm for broadcasts in a mesh network. This happens to be a special case of ours. 30] proposes a routing policy which attains at least 50 of the maximum possible throughput in an arbitrary broadcast network. Since unicast and broadcast are special cases of ....
E. Modiano and A. Ephremides. Efficient Algorithms for Performing Packet Broadcasts in a Mesh Network IEEE Transactions on Networking, Vol. 4. No. 4. August' 96
Capacity Provisioning and Failure Recovery in Mesh-Torus.. - Sun, Modiano (2001) Self-citation (Modiano) (Correct)
No context found.
E. Modiano and A. Ephremides, "Efficient algorithms for performing packet broadcasts in a mesh network," IEEE/ACM Trans. on Networking, vol. 4, no. 4, pp 639-648, Aug. 1996.
Capacity Provisioning and Failure Recovery in Mesh-Torus.. - Sun, Modiano (2001) Self-citation (Modiano) (Correct)
....achievable by using a path based restoration algorithm at a local level. Thus, the minimum spare capacity needed using path restoration strategy is # ##### . Table I summarizes capacity requirements under link based and path based restoration. Communication on a mesh network has been studied in [4, 11, 14]. In [4] the authors consider processors communicating over a mesh network with the objective of broadcasting information. The work in [11] presents routing algorithm generating minimum propagation delay for satellite mesh networks. In [14] the authors propose new algorithms for all to all ....
....a path based restoration algorithm at a local level. Thus, the minimum spare capacity needed using path restoration strategy is # ##### . Table I summarizes capacity requirements under link based and path based restoration. Communication on a mesh network has been studied in [4, 11, 14] In [4], the authors consider processors communicating over a mesh network with the objective of broadcasting information. The work in [11] presents routing algorithm generating minimum propagation delay for satellite mesh networks. In [14] the authors propose new algorithms for all to all ....
[Article contains additional citation context not shown here]
E. Modiano and A. Ephremides, "Efficient algorithms for performing packet broadcasts in a mesh network," IEEE/ACM Trans. on Networking, vol. 4, no. 4, pp 639-648, Aug. 1996.
Capacity Provisioning and Failure Recovery for Satellite.. - Sun, Modiano (2002) Self-citation (Modiano) (Correct)
....is achievable by using a path based restoration algorithm at a local level. Thus, the minimum spare capacity needed using path restoration strategy is Csp . Table I summarizes capacity requirements under link based and path based restoration. Communication on a mesh network has been studied in [4, 11, 14]. In [4] the authors consider processors communicating over a mesh network with the objective of broadcasting information. The work in [11] presents routing algorithm generating minimum propagation delay for satellite mesh networks. In [14] the authors propose new algorithms for all to all ....
....using a path based restoration algorithm at a local level. Thus, the minimum spare capacity needed using path restoration strategy is Csp . Table I summarizes capacity requirements under link based and path based restoration. Communication on a mesh network has been studied in [4, 11, 14] In [4], the authors consider processors communicating over a mesh network with the objective of broadcasting information. The work in [11] presents routing algorithm generating minimum propagation delay for satellite mesh networks. In [14] the authors propose new algorithms for all to all personalized ....
[Article contains additional citation context not shown here]
E. Modiano and A. Ephremides, "Efficient algorithms for performing packet broadcasts in a mesh network," IEEE/ACM Trans. on Networking, vol. 4, no. 4, pp 639-648, Aug. 1996.
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