InforLorV4, PascalFrancis, Corpus, bibRecord, 000A61

On the performance and feasibility of multicast core selection heuristics

Identifieur interne : 000A61 ( PascalFrancis/Corpus ); précédent : 000A60; suivant : 000A62

On the performance and feasibility of multicast core selection heuristics

Auteurs : E. Fleury ; YIH HUANG ; P. K. Mckinley

Source :

Networks : (New York, NY) [ 0028-3045 ] ; 2000.

RBID : Pascal:00-0139818

Descripteurs français

Pascal (Inist)
- Multidestinataire, Communication, Centre, Graphe, Sélection, Noeud graphe, Arbre graphe, Evaluation performance, Connection multipoint, Réseau ATM.

English descriptors

KwdEn :
- ATM network, Center, Communication, Graph, Graph node, Multicast, Performance evaluation, Selection, Tree(graph).

Abstract

A core-based forwarding multicast protocol uses a core router as a traffic transit center: All multicast packets are first sent to the core, then distributed to destinations on a multicast tree rooted at the core. The purpose of this paper was to evaluate, via simulation, the effect of various core selection methods on multicast performance. Performance metrics of interest include network resource usage, packet delay, the join time of multicast participants, and link congestion. In addition, we assess the feasibility of these heuristics in real-world environments. The main contribution of this work is the discovery of a simple yet effective core selection heuristic that can be implemented in a wide variety of networks. Specifically, our results show that the tree center heuristic (using the center of the existing multicast tree as the new core node) significantly outperforms heuristics based on random selection and performs as well as other heuristics that are computationally more expensive.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0028-3045`
A02	`01`			`@0 NTWKAA`
A03		`1`		`@0 Networks : (N.Y. NY)`
A05				`@2 35`
A06				`@2 2`
A08	`01`	`1`	`ENG`	`@1 On the performance and feasibility of multicast core selection heuristics`
A11	`01`	`1`		`@1 FLEURY (E.)`
A11	`02`	`1`		`@1 YIH HUANG`
A11	`03`	`1`		`@1 MCKINLEY (P. K.)`
A14	`01`			`@1 UMR 7503 LORIA, INRIA Lorraine, 615, rue du Jardin Botanique-BP 101 @2 54602 Villers-Les-Nancy @3 FRA @Z 1 aut.`
A14	`02`			`@1 Department of Computer Science, George Mason University @2 Fairfax, Virginia 22030 @3 USA @Z 2 aut.`
A14	`03`			`@1 Department of Computer Science and Engineering, Michigan State University @2 East Lansing, Michigan 48824 @3 USA @Z 3 aut.`
A20				`@1 145-156`
A21				`@1 2000`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 15608 @5 354000086656640050`
A44				`@0 0000 @1 © 2000 INIST-CNRS. All rights reserved.`
A45				`@0 20 ref.`
A47	`01`	`1`		`@0 00-0139818`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Networks : (New York, NY)`
A66	`01`			`@0 USA`
C01	`01`		`ENG`	@0 A core-based forwarding multicast protocol uses a core router as a traffic transit center: All multicast packets are first sent to the core, then distributed to destinations on a multicast tree rooted at the core. The purpose of this paper was to evaluate, via simulation, the effect of various core selection methods on multicast performance. Performance metrics of interest include network resource usage, packet delay, the join time of multicast participants, and link congestion. In addition, we assess the feasibility of these heuristics in real-world environments. The main contribution of this work is the discovery of a simple yet effective core selection heuristic that can be implemented in a wide variety of networks. Specifically, our results show that the tree center heuristic (using the center of the existing multicast tree as the new core node) significantly outperforms heuristics based on random selection and performs as well as other heuristics that are computationally more expensive.
C02	`01`	`X`		`@0 001D04B03A`
C02	`02`	`X`		`@0 001A02B01C`
C03	`01`	`X`	`FRE`	`@0 Multidestinataire @5 01`
C03	`01`	`X`	`ENG`	`@0 Multicast @5 01`
C03	`01`	`X`	`SPA`	`@0 Multidestinatario @5 01`
C03	`02`	`X`	`FRE`	`@0 Communication @5 02`
C03	`02`	`X`	`ENG`	`@0 Communication @5 02`
C03	`02`	`X`	`SPA`	`@0 Comunicación @5 02`
C03	`03`	`X`	`FRE`	`@0 Centre @5 03`
C03	`03`	`X`	`ENG`	`@0 Center @5 03`
C03	`03`	`X`	`SPA`	`@0 Centro @5 03`
C03	`04`	`X`	`FRE`	`@0 Graphe @5 04`
C03	`04`	`X`	`ENG`	`@0 Graph @5 04`
C03	`04`	`X`	`SPA`	`@0 Grafo @5 04`
C03	`05`	`X`	`FRE`	`@0 Sélection @5 05`
C03	`05`	`X`	`ENG`	`@0 Selection @5 05`
C03	`05`	`X`	`SPA`	`@0 Selección @5 05`
C03	`06`	`X`	`FRE`	`@0 Noeud graphe @5 06`
C03	`06`	`X`	`ENG`	`@0 Graph node @5 06`
C03	`06`	`X`	`SPA`	`@0 Nudo grafo @5 06`
C03	`07`	`X`	`FRE`	`@0 Arbre graphe @5 07`
C03	`07`	`X`	`ENG`	`@0 Tree(graph) @5 07`
C03	`07`	`X`	`SPA`	`@0 Arbol grafo @5 07`
C03	`08`	`X`	`FRE`	`@0 Evaluation performance @5 08`
C03	`08`	`X`	`ENG`	`@0 Performance evaluation @5 08`
C03	`08`	`X`	`SPA`	`@0 Evaluación prestación @5 08`
C03	`09`	`X`	`FRE`	`@0 Connection multipoint @4 INC @5 72`
C03	`10`	`X`	`FRE`	`@0 Réseau ATM @4 CD @5 96`
C03	`10`	`X`	`ENG`	`@0 ATM network @4 CD @5 96`
N21				`@1 101`

Format Inist (serveur)

NO :	PASCAL 00-0139818 INIST
ET :	On the performance and feasibility of multicast core selection heuristics
AU :	FLEURY (E.); YIH HUANG; MCKINLEY (P. K.)
AF :	UMR 7503 LORIA, INRIA Lorraine, 615, rue du Jardin Botanique-BP 101/54602 Villers-Les-Nancy/France (1 aut.); Department of Computer Science, George Mason University/Fairfax, Virginia 22030/Etats-Unis (2 aut.); Department of Computer Science and Engineering, Michigan State University/East Lansing, Michigan 48824/Etats-Unis (3 aut.)
DT :	Publication en série; Niveau analytique
SO :	Networks : (New York, NY); ISSN 0028-3045; Coden NTWKAA; Etats-Unis; Da. 2000; Vol. 35; No. 2; Pp. 145-156; Bibl. 20 ref.
LA :	Anglais
EA :	A core-based forwarding multicast protocol uses a core router as a traffic transit center: All multicast packets are first sent to the core, then distributed to destinations on a multicast tree rooted at the core. The purpose of this paper was to evaluate, via simulation, the effect of various core selection methods on multicast performance. Performance metrics of interest include network resource usage, packet delay, the join time of multicast participants, and link congestion. In addition, we assess the feasibility of these heuristics in real-world environments. The main contribution of this work is the discovery of a simple yet effective core selection heuristic that can be implemented in a wide variety of networks. Specifically, our results show that the tree center heuristic (using the center of the existing multicast tree as the new core node) significantly outperforms heuristics based on random selection and performs as well as other heuristics that are computationally more expensive.
CC :	001D04B03A; 001A02B01C
FD :	Multidestinataire; Communication; Centre; Graphe; Sélection; Noeud graphe; Arbre graphe; Evaluation performance; Connection multipoint; Réseau ATM
ED :	Multicast; Communication; Center; Graph; Selection; Graph node; Tree(graph); Performance evaluation; ATM network
SD :	Multidestinatario; Comunicación; Centro; Grafo; Selección; Nudo grafo; Arbol grafo; Evaluación prestación
LO :	INIST-15608.354000086656640050
ID :	00-0139818

Links to Exploration step

Pascal:00-0139818

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">On the performance and feasibility of multicast core selection heuristics</title>
<author><name sortKey="Fleury, E" sort="Fleury, E" uniqKey="Fleury E" first="E." last="Fleury">E. Fleury</name>
<affiliation><inist:fA14 i1="01"><s1>UMR 7503 LORIA, INRIA Lorraine, 615, rue du Jardin Botanique-BP 101</s1>
<s2>54602 Villers-Les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Yih Huang" sort="Yih Huang" uniqKey="Yih Huang" last="Yih Huang">YIH HUANG</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Computer Science, George Mason University</s1>
<s2>Fairfax, Virginia 22030</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Mckinley, P K" sort="Mckinley, P K" uniqKey="Mckinley P" first="P. K." last="Mckinley">P. K. Mckinley</name>
<affiliation><inist:fA14 i1="03"><s1>Department of Computer Science and Engineering, Michigan State University</s1>
<s2>East Lansing, Michigan 48824</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">00-0139818</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 00-0139818 INIST</idno>
<idno type="RBID">Pascal:00-0139818</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000A61</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">On the performance and feasibility of multicast core selection heuristics</title>
<author><name sortKey="Fleury, E" sort="Fleury, E" uniqKey="Fleury E" first="E." last="Fleury">E. Fleury</name>
<affiliation><inist:fA14 i1="01"><s1>UMR 7503 LORIA, INRIA Lorraine, 615, rue du Jardin Botanique-BP 101</s1>
<s2>54602 Villers-Les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Yih Huang" sort="Yih Huang" uniqKey="Yih Huang" last="Yih Huang">YIH HUANG</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Computer Science, George Mason University</s1>
<s2>Fairfax, Virginia 22030</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Mckinley, P K" sort="Mckinley, P K" uniqKey="Mckinley P" first="P. K." last="Mckinley">P. K. Mckinley</name>
<affiliation><inist:fA14 i1="03"><s1>Department of Computer Science and Engineering, Michigan State University</s1>
<s2>East Lansing, Michigan 48824</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Networks : (New York, NY)</title>
<title level="j" type="abbreviated">Networks : (N.Y. NY)</title>
<idno type="ISSN">0028-3045</idno>
<imprint><date when="2000">2000</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Networks : (New York, NY)</title>
<title level="j" type="abbreviated">Networks : (N.Y. NY)</title>
<idno type="ISSN">0028-3045</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>ATM network</term>
<term>Center</term>
<term>Communication</term>
<term>Graph</term>
<term>Graph node</term>
<term>Multicast</term>
<term>Performance evaluation</term>
<term>Selection</term>
<term>Tree(graph)</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Multidestinataire</term>
<term>Communication</term>
<term>Centre</term>
<term>Graphe</term>
<term>Sélection</term>
<term>Noeud graphe</term>
<term>Arbre graphe</term>
<term>Evaluation performance</term>
<term>Connection multipoint</term>
<term>Réseau ATM</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">A core-based forwarding multicast protocol uses a core router as a traffic transit center: All multicast packets are first sent to the core, then distributed to destinations on a multicast tree rooted at the core. The purpose of this paper was to evaluate, via simulation, the effect of various core selection methods on multicast performance. Performance metrics of interest include network resource usage, packet delay, the join time of multicast participants, and link congestion. In addition, we assess the feasibility of these heuristics in real-world environments. The main contribution of this work is the discovery of a simple yet effective core selection heuristic that can be implemented in a wide variety of networks. Specifically, our results show that the tree center heuristic (using the center of the existing multicast tree as the new core node) significantly outperforms heuristics based on random selection and performs as well as other heuristics that are computationally more expensive.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0028-3045</s0>
</fA01>
<fA02 i1="01"><s0>NTWKAA</s0>
</fA02>
<fA03 i2="1"><s0>Networks : (N.Y. NY)</s0>
</fA03>
<fA05><s2>35</s2>
</fA05>
<fA06><s2>2</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>On the performance and feasibility of multicast core selection heuristics</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>FLEURY (E.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>YIH HUANG</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>MCKINLEY (P. K.)</s1>
</fA11>
<fA14 i1="01"><s1>UMR 7503 LORIA, INRIA Lorraine, 615, rue du Jardin Botanique-BP 101</s1>
<s2>54602 Villers-Les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Department of Computer Science, George Mason University</s1>
<s2>Fairfax, Virginia 22030</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Department of Computer Science and Engineering, Michigan State University</s1>
<s2>East Lansing, Michigan 48824</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>145-156</s1>
</fA20>
<fA21><s1>2000</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>15608</s2>
<s5>354000086656640050</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2000 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>20 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>00-0139818</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Networks : (New York, NY)</s0>
</fA64>
<fA66 i1="01"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>A core-based forwarding multicast protocol uses a core router as a traffic transit center: All multicast packets are first sent to the core, then distributed to destinations on a multicast tree rooted at the core. The purpose of this paper was to evaluate, via simulation, the effect of various core selection methods on multicast performance. Performance metrics of interest include network resource usage, packet delay, the join time of multicast participants, and link congestion. In addition, we assess the feasibility of these heuristics in real-world environments. The main contribution of this work is the discovery of a simple yet effective core selection heuristic that can be implemented in a wide variety of networks. Specifically, our results show that the tree center heuristic (using the center of the existing multicast tree as the new core node) significantly outperforms heuristics based on random selection and performs as well as other heuristics that are computationally more expensive.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D04B03A</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001A02B01C</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Multidestinataire</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Multicast</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Multidestinatario</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Communication</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Communication</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Comunicación</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Centre</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Center</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Centro</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Graphe</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Graph</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Grafo</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Sélection</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Selection</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Selección</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Noeud graphe</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Graph node</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Nudo grafo</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Arbre graphe</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Tree(graph)</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Arbol grafo</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Evaluation performance</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Performance evaluation</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Evaluación prestación</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Connection multipoint</s0>
<s4>INC</s4>
<s5>72</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Réseau ATM</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>ATM network</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>101</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 00-0139818 INIST</NO>
<ET>On the performance and feasibility of multicast core selection heuristics</ET>
<AU>FLEURY (E.); YIH HUANG; MCKINLEY (P. K.)</AU>
<AF>UMR 7503 LORIA, INRIA Lorraine, 615, rue du Jardin Botanique-BP 101/54602 Villers-Les-Nancy/France (1 aut.); Department of Computer Science, George Mason University/Fairfax, Virginia 22030/Etats-Unis (2 aut.); Department of Computer Science and Engineering, Michigan State University/East Lansing, Michigan 48824/Etats-Unis (3 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Networks : (New York, NY); ISSN 0028-3045; Coden NTWKAA; Etats-Unis; Da. 2000; Vol. 35; No. 2; Pp. 145-156; Bibl. 20 ref.</SO>
<LA>Anglais</LA>
<EA>A core-based forwarding multicast protocol uses a core router as a traffic transit center: All multicast packets are first sent to the core, then distributed to destinations on a multicast tree rooted at the core. The purpose of this paper was to evaluate, via simulation, the effect of various core selection methods on multicast performance. Performance metrics of interest include network resource usage, packet delay, the join time of multicast participants, and link congestion. In addition, we assess the feasibility of these heuristics in real-world environments. The main contribution of this work is the discovery of a simple yet effective core selection heuristic that can be implemented in a wide variety of networks. Specifically, our results show that the tree center heuristic (using the center of the existing multicast tree as the new core node) significantly outperforms heuristics based on random selection and performs as well as other heuristics that are computationally more expensive.</EA>
<CC>001D04B03A; 001A02B01C</CC>
<FD>Multidestinataire; Communication; Centre; Graphe; Sélection; Noeud graphe; Arbre graphe; Evaluation performance; Connection multipoint; Réseau ATM</FD>
<ED>Multicast; Communication; Center; Graph; Selection; Graph node; Tree(graph); Performance evaluation; ATM network</ED>
<SD>Multidestinatario; Comunicación; Centro; Grafo; Selección; Nudo grafo; Arbol grafo; Evaluación prestación</SD>
<LO>INIST-15608.354000086656640050</LO>
<ID>00-0139818</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A61 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000A61 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:00-0139818
   |texte=   On the performance and feasibility of multicast core selection heuristics
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

On the performance and feasibility of multicast core selection heuristics

On the performance and feasibility of multicast core selection heuristics

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri