Moy, J., "MOSPF: Analysis and Experience", RFC 1585, March 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....does not support tunneling. The path is calculated only on demand and cached for later use. It constructs source based multicast trees. It can also be considered as a QoS routing algorithm that minimizes delay. It is one of the dense mode protocols that requires explicit join from the receivers [8]. 4.1.3 Core Based Tree (CBT) CBT [26, 27] builds a single bidirectional shared tree for the data transmission from the source(s) in the group to the receivers. When an intermediate node receives a packet meant for the group, it forwards it to the remaining members of the group that are ....

J. Moy, "MOSPF: Analysis and Experience", Internet Request for Comment 1585, March 1994.

....Fig. 3. Hierarchy of Data Aggregation. node o#ers its data as a mutlicast session, for which it acts as the source. Any observer can subscribe to this multicast session using well established mutlicast schemes (e.g. by using mutlicast routers that exchange IGMP [4] messages and route using MOSPF [5]) B. Session Control The scheme described above requires that nodes are configured to form the tree and aggregate the right set of lower layer streams. Thus, all nodes other than leaves need to know their children at start time. Once the children are known, the node can subscribe to their ....

John Moy, "MOSPF: Analysis and experience," RFC 1585, Network Working Group, Mar. 1994.

....the datagrams to the backbone. The backbone routers having complete information about the distribution of groups further forward these datagrams only to those areas which have members belonging to them. 2.2. 1 Protocol Analysis The forwarding cache entry is indexed on (source, group) pairs [28]. The state maintained by the router increases by the order O(S G) where S is the average number of sources in each multicast group and G is the number of groups. Further if it supports TOS forwarding, then the state or required memory size is further multiplied by the number of TOS values ....

J. Moy. Mospf: Analysis and Experience. RFC: 1585, Mar 1994.

....protocols transfer information along distribution trees rooted at the group sources and spanning the group members. Various multicast routing protocols establish these multicast trees in different ways: broadcast and prune (e.g. DVMRP [37] and PIM DM [38] membership advertisement (e.g. MOSPF [46][47] and rendezvous based (e.g. CBT [39] PIM SM [40] 45] and BGMP [67] Broadcast and prune multicast routing protocols flood data packets all over the network and then prune back branches that do not have members. They are suitable for groups with dense member distribution, and, thus, are ....

J. Moy, MOSPF: Analysis and Experience, RFC1585, March 1994

.... a delay bound between any two source and destination machines within the multicast group, this require us to re consider the existing multicast algorithm such as Distance Vector Multicast Routing Protocol (DVMRP) 1] Protocol Independent Multicast (PIM) 6, 7] Multicast Extensions to OSPF (MOSPF)[2, 3] and Core Based Trees (CBT) 4, 5] And most of them are tree building based algorithms. 2 System Model In this model, we have N clients. The client machines are labeled as: fC 1 ; C 2 ; CN g. They are distributed on a wide area network. Between any two pairs of clients, there may be a ....

John Moy, MOSPF: Analysis and Experience, RFC 1585, March 1994.

....Most distributed real time applications involve more than two users and hence the need for efficient multicast routing. Several multicast routing protocols have been proposed. These protocols construct multicast trees that can be classified into two categories: source specific trees (MOSPF [3], This work was supported in part by the Center for Advanced Computing and Communication at North Carolina State University and in part by AFOSR grant F49620 92 J 0441DEF. DVMRP [4] and PIM [5, 6] and shared trees (CBT [7] and PIM 1 [5] In this paper we consider only source specific ....

J. Moy, "MOSPF, Analysis and Experience." Internet RFC 1585, May 1994.

....to larger, wide area, networks every router must receive and store membership information for every group in the domain. The other major factor is the processing cost of the Dijkstra shortest path tree calculations performed to compute the delivery trees for all active multicast sources [10] for all groups, thus limiting its applicability on an internet wide basis. Distance vector multicast routing protocols construct multicast distribution trees using variants of Reverse Path Forwarding (RPF) 11] When the first data packet is sent to a group from a particular source subnetwork, ....

J. Moy. Mospf: Analysis and experience. Internet Draft, July 1993.

....scaling to larger, wide area, networks every router must receive and store membership information for every group in the domain. The other major factor is the processing cost of the Dijkstra shortest path tree calculations performed to compute the delivery trees for all active multicast sources [7], thus limiting its applicability on an internet wide basis. Distance vector multicast routing protocols construct multicast distribution trees using variants of Reverse Path Forwarding [8] When the first data packet is sent to a group from a particular source subnetwork, and a router receiving ....

J. Moy. MOSPF: Analysis and experience. Internet Draft, July 1993.

....scaling to larger, wide area, networks every router must receive and store membership information for every group in the domain. The other major factor is the processing cost of the Dijkstra shortest path tree calculations performed to compute the delivery trees for all active multicast sources[25], thus limiting its applicability on an internet wide basis. Distance vector multicast routing protocols construct multicast distribution trees using variants of Reverse Path Forwarding[7] When the first data packet is sent to a group from a particular source subnetwork, and a router receiving ....

J. Moy. Mospf: Analysis and experience. RFC1585, March 1994.

....mainly focused on a low cost tree over a given network topology on the assumption that every edge of the tree has enough link capacity to be allocated to the amount of bandwidth required by a service. Salama et al. 1] however, made a conclusion that unconstrained multicast routing algorithms [5, 6, 11, 13] may not be suitable for applying to these services after the computer simulation of these algorithms. That is, these services require multicast routing algorithm to fulfill the appropriate constraints such as end to end delay, bandwidth, loss probability and so on. Among these constraints, ....

J. Moy, "MOSPF, Analysis and Experience", Available: Internet RFC 1585, http://ds.internic.net/ rfc/rfc1585.txt.

....to larger, wide area, networks every router must receive and store membership information for every group in the domain. The other major factor is the processing cost of the Dijkstra shortest path tree calculations performed to compute the delivery trees for all active multicast sources [8] for all groups, thus limiting its applicability on an internet wide basis. Distance vector multicast routing protocols construct multicast distribution trees using variants of Reverse Path Forwarding (RPF) 9] When the first data packet is sent to a group from a particular source subnetwork, and ....

J. Moy. Mospf: Analysis and experience. Internet Draft, July 1993.

....MC protocol. The proposed D GMC protocol is an event driven MC protocol that maintains the full generality of brute force LSR based MC routing. We emphasize that LSR based MC protocols, such as MOSPF and D GMC, are not intended for direct implementation in very large networks or internets [10]. LSR itself is generally intended for use in a set of networks under one administrative authority (in Internet terminology, an Autonomous System) which typically contains a few hundred switches and possibly several thousand hosts. Scalability can be addressed by introducing a routing hierarchy ....

J. Moy, "MOSPF: Analysis and experience." Internet RFC 1585, March 1994.

....transfer information along distribution trees rooted at the group sources and spanning the group members. Various multicast routing protocols establish these multicast trees in different ways: broadcast and prune (e.g. DVMRP [13]and PIM DM [14] membership advertisement (e.g. 5 MOSPF [22,23]) and rendezvous based (e.g. CBT [15] PIM SM [16 21] and BGMP[35] Broadcast and prune multicast routing protocols flood data packets all over the network and then prune back branches that do not have members. They are suitable for groups with dense member distribution, and, thus, also called ....

J. Moy, MOSPF: Analysis and Experience, RFC1585, March 1994

No context found.

Moy, J., "MOSPF: Analysis and Experience", RFC 1585, March 1994.

No context found.

J. Moy. MOSPF: Analysis and Experience. IETF RFC 1585, 1994.

No context found.

J. Moy. MOSPF: Analysis and experience. Internet Draft, July 1993.

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