Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming

We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, where the weight on a connector corresponds to the cost of sending a packet on the network link modelled by that connecto...

Full description

Saved in:

Bibliographic Details
Published in:	Electronic notes in theoretical computer science Vol. 190; no. 3; pp. 111 - 127
Main Authors:	Bistarelli, Stefano, Montanari, Ugo, Rossi, Francesca, Santini, Francesco
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 06.09.2007
Subjects:	And-or Graphs Multicast Quality of Service Routing Soft Constraint Logic Programming Multicast Routing Soft Constraint Logic Programming And-or Graphs Quality of Service
ISSN:	1571-0661, 1571-0661
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, where the weight on a connector corresponds to the cost of sending a packet on the network link modelled by that connector. Then, we use the Soft Constraint Logic Programming (SCLP) framework as a convenient declarative programming environment in which to specify related problems. In particular, we show how the semantics of an SCLP program computes the best tree in the corresponding and-or graph: this result can be adopted to find, from a given source node, the multicast distribution tree having minimum cost and reaching all the destination nodes of the multicast communication. The costs on the connectors can be described also as vectors (multi-dimensional costs), each component representing a different Quality of Service metric value. Therefore, the construction of the best tree may involve a set of criteria, all of which are to be optimized (multi-criteria problem), e.g. maximum global bandwidth and minimum delay that can be experienced on a single link.
AbstractList	We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, where the weight on a connector corresponds to the cost of sending a packet on the network link modelled by that connector. Then, we use the Soft Constraint Logic Programming (SCLP) framework as a convenient declarative programming environment in which to specify related problems. In particular, we show how the semantics of an SCLP program computes the best tree in the corresponding and-or graph: this result can be adopted to find, from a given source node, the multicast distribution tree having minimum cost and reaching all the destination nodes of the multicast communication. The costs on the connectors can be described also as vectors (multi-dimensional costs), each component representing a different Quality of Service metric value. Therefore, the construction of the best tree may involve a set of criteria, all of which are to be optimized (multi-criteria problem), e.g. maximum global bandwidth and minimum delay that can be experienced on a single link.
Author	Bistarelli, Stefano Santini, Francesco Rossi, Francesca Montanari, Ugo
Author_xml	– sequence: 1 givenname: Stefano surname: Bistarelli fullname: Bistarelli, Stefano email: bista@sci.unich.it organization: Department of Sciences, University “G. d'Annunzio” of Chieti-Pescara, Pescara, Italy – sequence: 2 givenname: Ugo surname: Montanari fullname: Montanari, Ugo email: ugo@di.unipi.it organization: Department of Computer Science, University of Pisa, Pisa, Italy – sequence: 3 givenname: Francesca surname: Rossi fullname: Rossi, Francesca email: frossi@math.unipd.it organization: Department of Pure and Applied Mathematics, University of Padova, Padova, Italy – sequence: 4 givenname: Francesco surname: Santini fullname: Santini, Francesco email: f.santini@imtlucca.it organization: IMT Lucca - School for Advanced Studies, Lucca, Italy
BookMark	eNqFkM1KAzEUhYNUsK0-gZu8wIzJTGcms3BRi1ahxZ_WdcjPnTZlmpQkFfr2dqwLcaFw4B4ufId7zwD1rLOA0DUlKSW0vNmkYKMKaUZIlXYi7Az1aVHRhJQl7f3wF2gQwoaQnNGq7KPd3GloW2NXeL5vo1EiRPzqFvjN7WO3lQe8D525gxCTpQfACxBerbGxeGx14jyeerFbByysxgvXRDxxNkQvjI145lZG4RfvVl5st8ecS3TeiDbA1fccoveH--XkMZk9T58m41mi8hGLSZYpyTSIRpVyVMOoyVjVaKllzmRWCFkQKUihKlZJyoqiFpXKS13RQusmq3WWD1F9ylXeheCh4cpEEY2z3WUtp4R31fEN_6qOd9XxToQd2fwXu_NmK_zhH-r2RMHxrQ8DngdlwCrQxoOKXDvzJ_8JYh6Nmw
CitedBy_id	crossref_primary_10_1002_sec_252 crossref_primary_10_1145_1838552_1838557 crossref_primary_10_1017_S147106841100010X crossref_primary_10_1007_s11227_011_0723_0 crossref_primary_10_1007_s11227_012_0835_1
Cites_doi	10.1007/3-540-49481-2_16 10.1145/356628.356630 10.1145/359657.359664 10.1109/COMST.2003.5342226 10.1109/49.564133 10.1145/1149114.1149118 10.1002/net.3230170203 10.1023/A:1013609600697 10.1016/0743-1066(94)90033-7 10.1109/65.819168 10.1109/65.768484 10.1145/256303.256306
ContentType	Journal Article
Copyright	2007 Elsevier B.V.
Copyright_xml	– notice: 2007 Elsevier B.V.
DBID	6I. AAFTH AAYXX CITATION
DOI	10.1016/j.entcs.2007.07.008
DatabaseName	ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1571-0661
EndPage	127
ExternalDocumentID	10_1016_j_entcs_2007_07_008 S1571066107005610
GroupedDBID	--K --M 0R~ 1B1 1~5 4.4 457 4G. 5GY 5VS 6I. 7-5 71M AABNK AACTN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAQFI AAXUO ABMAC ABWVN ACDAQ ACGFO ACGFS ACNNM ACRLP ACRPL ACXMD ADBBV ADEZE ADMUD ADNMO ADVLN AEIPS AEKER AEXQZ AFTJW AFXIZ AGHFR AIEXJ AIKHN AITUG AKRWK ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AXJTR CS3 DU5 EBS EJD EO8 EO9 EP2 EP3 FDB FEDTE FNPLU G-Q HVGLF HZ~ IHE IXB J1W KOM KQ8 M41 M~E N9A O-L O9- OK1 OZT P2P RIG ROL RPZ SDG SES SPC SSH SSV SSW SSZ 29G 9DU AAQXK AAYWO AAYXX ABFNM ACLOT ACVFH ADCNI ADFGL AEUPX AFPUW AGQPQ AIGII AJMQA AKBMS AKYEP AOUOD ASPBG AVWKF AZFZN CITATION FGOYB GBLVA R2- SEW ~HD
ID	FETCH-LOGICAL-c348t-22cb8deafc6b49e4f287fdbdb38b25ab50ba05c787b18559a7c36d715ddf29d23
ISICitedReferencesCount	11
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000214248200008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1571-0661
IngestDate	Tue Nov 18 22:42:47 EST 2025 Sat Nov 29 02:22:03 EST 2025 Thu Apr 10 08:06:46 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	false
IsScholarly	false
Issue	3
Keywords	Multicast Routing Soft Constraint Logic Programming And-or Graphs Quality of Service
Language	English
License	http://creativecommons.org/licenses/by-nc-nd/3.0 https://www.elsevier.com/tdm/userlicense/1.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c348t-22cb8deafc6b49e4f287fdbdb38b25ab50ba05c787b18559a7c36d715ddf29d23
OpenAccessLink	https://dx.doi.org/10.1016/j.entcs.2007.07.008
PageCount	17
ParticipantIDs	crossref_citationtrail_10_1016_j_entcs_2007_07_008 crossref_primary_10_1016_j_entcs_2007_07_008 elsevier_sciencedirect_doi_10_1016_j_entcs_2007_07_008
PublicationCentury	2000
PublicationDate	2007-09-06
PublicationDateYYYYMMDD	2007-09-06
PublicationDate_xml	– month: 09 year: 2007 text: 2007-09-06 day: 06
PublicationDecade	2000
PublicationTitle	Electronic notes in theoretical computer science
PublicationYear	2007
Publisher	Elsevier B.V
Publisher_xml	– name: Elsevier B.V
References	Martelli, Montanari (bib015) 1978; 21 Chen, S., K. Nahrstedt and Y. Shavitt Bistarelli, Montanari, Rossi (bib006) 2002; 8 (1998), pp. 205–219 Jaffar, Maher (bib014) 1994; 19/20 Rouskas, Baldine (bib021) 1997; 15 Bistarelli, Montanari, Rossi (bib004) 1997 Hirsch, Tuosto (bib013) 2005 Bistarelli, Montanari, Rossi (bib007) 2006; 7 Nicola, Ferrari, Montanari, Pugliese, Tuosto (bib018) 2003; 2772 Berman, Kou, Markowsky (bib001) 1979; 15 (2000), pp. 1594–1603 Pooch (bib020) 1974; 6 Bistarelli (bib002) 2004; 2962 in Bistarelli, Montanari, Rossi (bib003) 1995 Xiao, Ni (bib024) 1999; 13 Moy, J. Younis, Fahmy (bib025) 2003; 5 Bueno, F., D. Cabeza, M. Carro, M. Hermenegildo, P. López-García and G. Puebla Technical Report CLIP3/97.1, School of Computer Science, Technical University of Madrid (UPM) (1997) Mohri (bib016) 2002; 7 Bistarelli, Montanari, Rossi (bib005) 1999 Bistarelli, Montanari, Rossi (bib008) March 1997; 44 Wang, Hou (bib022) 2000; 14 RFC 2328 (IETF Standard) (1998). URL Nilsson (bib019) 1980 Winter (bib023) 1987; 17 Cormen, Leiserson, Rivest (bib011) 1990 Georget, Y. and P. Codognet 10.1016/j.entcs.2007.07.008_bib010 10.1016/j.entcs.2007.07.008_bib012 Bistarelli (10.1016/j.entcs.2007.07.008_bib002) 2004; 2962 Hirsch (10.1016/j.entcs.2007.07.008_bib013) 2005 Winter (10.1016/j.entcs.2007.07.008_bib023) 1987; 17 Nicola (10.1016/j.entcs.2007.07.008_bib018) 2003; 2772 Wang (10.1016/j.entcs.2007.07.008_bib022) 2000; 14 Bistarelli (10.1016/j.entcs.2007.07.008_bib003) 1995 Xiao (10.1016/j.entcs.2007.07.008_bib024) 1999; 13 Berman (10.1016/j.entcs.2007.07.008_bib001) 1979; 15 Bistarelli (10.1016/j.entcs.2007.07.008_bib004) 1997 Bistarelli (10.1016/j.entcs.2007.07.008_bib008) 1997; 44 Martelli (10.1016/j.entcs.2007.07.008_bib015) 1978; 21 Younis (10.1016/j.entcs.2007.07.008_bib025) 2003; 5 10.1016/j.entcs.2007.07.008_bib017 Mohri (10.1016/j.entcs.2007.07.008_bib016) 2002; 7 Bistarelli (10.1016/j.entcs.2007.07.008_bib007) 2006; 7 Jaffar (10.1016/j.entcs.2007.07.008_bib014) 1994; 19/20 Rouskas (10.1016/j.entcs.2007.07.008_bib021) 1997; 15 Cormen (10.1016/j.entcs.2007.07.008_bib011) 1990 Nilsson (10.1016/j.entcs.2007.07.008_bib019) 1980 Bistarelli (10.1016/j.entcs.2007.07.008_bib006) 2002; 8 Bistarelli (10.1016/j.entcs.2007.07.008_bib005) 1999 10.1016/j.entcs.2007.07.008_bib009 Pooch (10.1016/j.entcs.2007.07.008_bib020) 1974; 6
References_xml	– volume: 2772 start-page: 436 year: 2003 end-page: 479 ident: bib018 article-title: A formal basis for reasoning on programmable QoS publication-title: Verification: Theory and Practice – volume: 15 start-page: 346 year: 1997 end-page: 356 ident: bib021 article-title: Multicast routing with end-to-end delay and delay variation constraints publication-title: IEEE Journal of Selected Areas in Communications – start-page: 624 year: 1995 end-page: 630 ident: bib003 article-title: Constraint solving over semirings publication-title: Proc. IJCAI95 (Morgan Kaufman) – volume: 17 start-page: 129 year: 1987 end-page: 167 ident: bib023 article-title: Steiner problem in networks: a survey publication-title: Netw. – volume: 44 start-page: 201 year: March 1997 end-page: 236 ident: bib008 article-title: Semiring-based constraint solving and optimization publication-title: Journal of the ACM – reference: , in: – start-page: 425 year: 2005 end-page: 434 ident: bib013 article-title: SHReQ: coordinating application level QoS publication-title: SEFM '05: Proc. of the Third IEEE Int. Conf. on Software Engineering and Formal Methods – volume: 13 start-page: 8 year: 1999 end-page: 18 ident: bib024 article-title: Internet QoS: a big picture publication-title: IEEE Network – reference: , RFC 2328 (IETF Standard) (1998). URL – reference: , Technical Report CLIP3/97.1, School of Computer Science, Technical University of Madrid (UPM) (1997) – volume: 21 start-page: 1025 year: 1978 end-page: 1039 ident: bib015 article-title: Optimizing decision trees through heuristically guided search publication-title: Commun. ACM – reference: Bueno, F., D. Cabeza, M. Carro, M. Hermenegildo, P. López-García and G. Puebla, – volume: 19/20 start-page: 503 year: 1994 end-page: 581 ident: bib014 article-title: Constraint logic programming: a survey publication-title: Journal of Logic Programming – volume: 5 start-page: 2 year: 2003 end-page: 13 ident: bib025 article-title: Constraint-based routing in the internet: basic principles and recent research publication-title: IEEE Communications Surveys and Tutorials – volume: 7 start-page: 321 year: 2002 end-page: 350 ident: bib016 article-title: Semiring frameworks and algorithms for shortest-distance problems publication-title: J. Autom. Lang. Comb. – reference: (1998), pp. 205–219 – volume: 15 start-page: 141 year: 1979 end-page: 145 ident: bib001 article-title: A fast algorithm for Steiner trees publication-title: Acta Informatica – reference: Chen, S., K. Nahrstedt and Y. Shavitt, – volume: 14 start-page: 22 year: 2000 end-page: 36 ident: bib022 article-title: Multicast routing and its QoS extension: problems, algorithms, and protocols publication-title: IEEE Network – volume: 2962 year: 2004 ident: bib002 article-title: Semirings for Soft Constraint Solving and Programming publication-title: Lecture Notes in Computer Science – volume: 8 start-page: 25 year: 2002 end-page: 41 ident: bib006 article-title: Soft constraint logic programming and generalized shortest path problems publication-title: Journal of Heuristics – year: 1990 ident: bib011 article-title: Introduction to Algorithms – year: 1999 ident: bib005 article-title: SCLP semantics for (multi-criteria) shortest path problems publication-title: Informal Proc. CP-AI-OR'99 – volume: 6 start-page: 125 year: 1974 end-page: 151 ident: bib020 article-title: Translation of decision tables publication-title: ACM Comput. Surv. – volume: 7 start-page: 563 year: 2006 end-page: 589 ident: bib007 article-title: Soft concurrent constraint programming publication-title: ACM Trans. Comput. Logic – reference: Moy, J., – start-page: 352 year: 1997 end-page: 357 ident: bib004 article-title: Semiring-based constraint logic programming publication-title: Proc. IJCAI97 (Morgan Kaufman) – reference: Georget, Y. and P. Codognet, – year: 1980 ident: bib019 article-title: Principles of Artificial Intelligence – reference: (2000), pp. 1594–1603 – ident: 10.1016/j.entcs.2007.07.008_bib012 doi: 10.1007/3-540-49481-2_16 – start-page: 352 year: 1997 ident: 10.1016/j.entcs.2007.07.008_bib004 article-title: Semiring-based constraint logic programming – volume: 6 start-page: 125 year: 1974 ident: 10.1016/j.entcs.2007.07.008_bib020 article-title: Translation of decision tables publication-title: ACM Comput. Surv. doi: 10.1145/356628.356630 – ident: 10.1016/j.entcs.2007.07.008_bib009 – year: 1990 ident: 10.1016/j.entcs.2007.07.008_bib011 – volume: 21 start-page: 1025 year: 1978 ident: 10.1016/j.entcs.2007.07.008_bib015 article-title: Optimizing decision trees through heuristically guided search publication-title: Commun. ACM doi: 10.1145/359657.359664 – year: 1999 ident: 10.1016/j.entcs.2007.07.008_bib005 article-title: SCLP semantics for (multi-criteria) shortest path problems – volume: 5 start-page: 2 year: 2003 ident: 10.1016/j.entcs.2007.07.008_bib025 article-title: Constraint-based routing in the internet: basic principles and recent research publication-title: IEEE Communications Surveys and Tutorials doi: 10.1109/COMST.2003.5342226 – volume: 15 start-page: 346 year: 1997 ident: 10.1016/j.entcs.2007.07.008_bib021 article-title: Multicast routing with end-to-end delay and delay variation constraints publication-title: IEEE Journal of Selected Areas in Communications doi: 10.1109/49.564133 – volume: 7 start-page: 563 year: 2006 ident: 10.1016/j.entcs.2007.07.008_bib007 article-title: Soft concurrent constraint programming publication-title: ACM Trans. Comput. Logic doi: 10.1145/1149114.1149118 – volume: 7 start-page: 321 year: 2002 ident: 10.1016/j.entcs.2007.07.008_bib016 article-title: Semiring frameworks and algorithms for shortest-distance problems publication-title: J. Autom. Lang. Comb. – year: 1980 ident: 10.1016/j.entcs.2007.07.008_bib019 – ident: 10.1016/j.entcs.2007.07.008_bib010 – volume: 17 start-page: 129 year: 1987 ident: 10.1016/j.entcs.2007.07.008_bib023 article-title: Steiner problem in networks: a survey publication-title: Netw. doi: 10.1002/net.3230170203 – volume: 8 start-page: 25 year: 2002 ident: 10.1016/j.entcs.2007.07.008_bib006 article-title: Soft constraint logic programming and generalized shortest path problems publication-title: Journal of Heuristics doi: 10.1023/A:1013609600697 – volume: 19/20 start-page: 503 year: 1994 ident: 10.1016/j.entcs.2007.07.008_bib014 article-title: Constraint logic programming: a survey publication-title: Journal of Logic Programming doi: 10.1016/0743-1066(94)90033-7 – start-page: 624 year: 1995 ident: 10.1016/j.entcs.2007.07.008_bib003 article-title: Constraint solving over semirings – volume: 14 start-page: 22 year: 2000 ident: 10.1016/j.entcs.2007.07.008_bib022 article-title: Multicast routing and its QoS extension: problems, algorithms, and protocols publication-title: IEEE Network doi: 10.1109/65.819168 – volume: 13 start-page: 8 year: 1999 ident: 10.1016/j.entcs.2007.07.008_bib024 article-title: Internet QoS: a big picture publication-title: IEEE Network doi: 10.1109/65.768484 – volume: 2772 start-page: 436 year: 2003 ident: 10.1016/j.entcs.2007.07.008_bib018 article-title: A formal basis for reasoning on programmable QoS – volume: 44 start-page: 201 year: 1997 ident: 10.1016/j.entcs.2007.07.008_bib008 article-title: Semiring-based constraint solving and optimization publication-title: Journal of the ACM doi: 10.1145/256303.256306 – volume: 15 start-page: 141 year: 1979 ident: 10.1016/j.entcs.2007.07.008_bib001 article-title: A fast algorithm for Steiner trees publication-title: Acta Informatica – ident: 10.1016/j.entcs.2007.07.008_bib017 – start-page: 425 year: 2005 ident: 10.1016/j.entcs.2007.07.008_bib013 article-title: SHReQ: coordinating application level QoS – volume: 2962 year: 2004 ident: 10.1016/j.entcs.2007.07.008_bib002 article-title: Semirings for Soft Constraint Solving and Programming
SSID	ssj0038176
Score	1.5050781
Snippet	We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a...
SourceID	crossref elsevier
SourceType	Enrichment Source Index Database Publisher
StartPage	111
SubjectTerms	And-or Graphs Multicast Quality of Service Routing Soft Constraint Logic Programming
Title	Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
URI	https://dx.doi.org/10.1016/j.entcs.2007.07.008
Volume	190
WOSCitedRecordID	wos000214248200008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1571-0661 dateEnd: 20201231 omitProxy: false ssIdentifier: ssj0038176 issn: 1571-0661 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1571-0661 dateEnd: 20201231 omitProxy: false ssIdentifier: ssj0038176 issn: 1571-0661 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5FhQMX3ojy0h64GVeOX7s-FlTgABWQFPVm7csoVVlHjlu1F34rP4XZl53QKqIHpMiKN7Gz9nyemZ18M4PQ63QqBVOCxjxpVJxTRWJe0TyuzPqCS3BR7d8F3z-Rw0N6fFx9mUx-h1yY81OiNb24qJb_VdQwBsI2qbM3EPdwUhiA9yB02ILYYftPgjfdzVyhbZtcK9iqj762s8hwf8wo-JtnNkDwFgxCPO-UimZj6EPLuO2iD6aM9crTOpvetvW0zSR60-PXsOkdretnMHwhtj821dFtb7leG6mSwveQiLzhHUP04KR2ZtqeedYw3Q5YaDV4sMylxB_9GMa_gX1fBOcb1N1IOpox0_9i47N2I7xBLH-rXNfIxFCzXMX2PXXNWFDjru2ox2u2ppSDOnf2fepqEVwxHS6KcbIHtl6sfG1LU96SjpYysAP-MqADrTEw5k5qexLT4pPU5mWy0W-lgHtDOvz86yD4CqY8os1_CxcU6mJZBuKVmVzvO635Q_P76K5fyOB9B8AHaKL0Q3QvNAnB3mY8QssBj3jAIwY8Yo9HzC-xxSMe8IgdHvFCY4dH7PCIAY_Y4BGPeMQWj3gNj4_R0fuD-buPsW_zEYssp32cpoJTqVgjSp5XKm9gEd9ILnlGeVowXiScJYUAy8LBuSwqRkRWSjItpGzSSqbZE7SjW62eIgw7qSQqKUAx5QVPmKBJU4HLRaaclbTcRWm4gbXwNfDNbE_rLaLbRW-Gg5auBMz2r5dBMrV_mJx3WgPSth347Ga_8xzdGZ-XF2in787US3RbnPeLVffKwuwPhsDEUQ
linkProvider	ISSN International Centre
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Modelling+Multicast+QoS+Routing+by+using+Best-Tree+Search+in+And-or+Graphs+and+Soft+Constraint+Logic+Programming&rft.jtitle=Electronic+notes+in+theoretical+computer+science&rft.au=Bistarelli%2C+Stefano&rft.au=Montanari%2C+Ugo&rft.au=Rossi%2C+Francesca&rft.au=Santini%2C+Francesco&rft.date=2007-09-06&rft.issn=1571-0661&rft.eissn=1571-0661&rft.volume=190&rft.issue=3&rft.spage=111&rft.epage=127&rft_id=info:doi/10.1016%2Fj.entcs.2007.07.008&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_entcs_2007_07_008
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0661&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0661&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0661&client=summon