Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 34 matches
- 2020
- Jue Chen, Fengting Yan, Dongmei Li, Shanshan Chen, Xihe Qiu:
Recovery and Reconstruction of Multicast Tree in Software-Defined Network: High Speed and Low Cost. IEEE Access 8: 27188-27201 (2020) - 2019
- Bangbang Ren, Deke Guo, Yulong Shen, Guoming Tang, Xu Lin:
Embedding Service Function Tree With Minimum Cost for NFV-Enabled Multicast. IEEE J. Sel. Areas Commun. 37(5): 1085-1097 (2019) - 2017
- Guozhi Li, Songtao Guo, Yuanyuan Yang:
Blocking cost-driven multicast scheduling in fat-tree data center networks. Concurr. Comput. Pract. Exp. 29(19) (2017) - 2016
- Luis Raposo, Teresa Gomes, Lúcia Martins, Costas K. Constantinou, Georgios Ellinas:
A New Arc-Disjoint-Trees scheme for survivable multicasting in mixed-graph sparse-splitting optical networks. RNDM 2016: 158-165 - 2015
- Muhammad Atif Tahir, Asif Jamshed, Habib-ur Rehman, Yassine Daadaa:
Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees. J. Intell. Syst. 24(4): 479-489 (2015) - Shanshan Zhou, Hua Wang, Shanwen Yi, Fangjin Zhu:
Cost-Efficient and Scalable Multicast Tree in Software Defined Networking. ICA3PP (2) 2015: 592-605 - Jun Duan, Zhiyang Guo, Yuanyuan Yang:
Cost efficient and performance guaranteed virtual network embedding in multicast fat-tree DCNs. INFOCOM 2015: 136-144 - 2013
- Avid Avokh, Ghasem Mirjalily:
Load-balanced Multicast Tree Routing in Multi Channel Multi Radio Wireless Mesh Networks Using a New Cost Function. Wirel. Pers. Commun. 69(1): 75-106 (2013) - 2011
- Fen Zhou, Miklós Molnár, Bernard Cousin, Chunming Qiao:
Cost Bounds and Approximation Ratios of Multicast Light-Trees in WDM Networks. JOCN 3(4): 323-334 (2011) - 2010
- Hwa-Chun Lin, Hsiu-Ming Yang:
An Approximation Algorithm for Constructing Multicast Trees with Degree-Dependent Node Costs. GLOBECOM 2010: 1-5 - Fen Zhou, Miklós Molnár, Bernard Cousin, Chunming Qiao:
Cost Bounds of Multicast Light-Trees in WDM Networks. Networking 2010: 339-350 - 2009
- Maciej Piechowiak, Maciej Stasiak, Piotr Zwierzykowski:
Analysis of the Influence of Group Members Arrangement on the Multicast Tree Cost. AICT 2009: 429-434 - Visa Holopainen, Raimo Kantola:
Tackling the Delay-Cost and Time-Cost Trade-Offs in Computation of Node-Protected Multicast Tree Pairs. APNOMS 2009: 273-282 - 2008
- Keen-Mun Yong, Gee-Swee Poo, Tee-Hiang Cheng:
Efficient Heuristic for Minimum Cost Trees Construction in Multi-Groups Multicast. Networking 2008: 215-226 - Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri:
Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks. SECON 2008: 551-559 - 2007
- Uyen Trang Nguyen, Jin Xu:
Multicast Routing in Wireless Mesh Networks: Minimum Cost Trees or Shortest Path Trees? IEEE Commun. Mag. 45(11): 72-77 (2007) - Changhan Kim, Jae-Heon Yang, Ikjun Yeom:
Cost Analysis of BestRelay Retransmission Trees for Reliable Multicasting. IEICE Trans. Commun. 90-B(3): 527-537 (2007) - 2006
- Aleksi Penttinen:
Minimum cost multicast trees in ad hoc networks. ICC 2006: 3676-3681 - 2005
- Guoliang Xue, Wei Xiao:
A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology. Algorithmica 41(1): 53-72 (2005) - Venkata S. Irava, Carl H. Hauser:
Survivable low-cost low-delay multicast trees. GLOBECOM 2005: 6 - Min Yang, Yuanyuan Yang:
Constructing minimum cost dynamic multicast trees under delay constraint. ICCCN 2005: 133-138 - Yong-Jin Lee, Mohammed Atiquzzaman:
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network. ICCNMC 2005: 268-275 - 2004
- Shu Li, Rami G. Melhem, Taieb Znati:
An efficient algorithm for constructing delay bounded minimum cost multicast trees. J. Parallel Distributed Comput. 64(12): 1399-1413 (2004) - Milena Janic, Piet Van Mieghem:
The gain and cost of multicast routing trees. SMC (5) 2004: 4625-4630 - 2003
- Maria João Nicolau, António Costa, Alexandre J. T. Santos, Vasco Freitas:
Directed Trees in Multicast Routing. QoS-IP 2003: 320-333 - 2001
- Kaliappa Nadar Ravindran, Ali Sabbir, Dmitri Loguinov, Gary S. Bloom:
Cost Optimal Multicast Trees for Multi-source Data Flows. INFOCOM 2001: 966-975 - 2000
- Hun-Young Lee, Chan-Hyun Youn:
Scalable Multicast Routing Algorithm for Delay-Variation Constrained Minimum-Cost Tree. ICC (3) 2000: 1343-1347 - 1999
- Anna Hac, Kelei Zhou:
A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay. Int. J. Netw. Manag. 9(4): 265-278 (1999) - Guoliang Xue:
Provably good approximation to minimum cost delay-constrained multicast trees. ICCCN 1999: 610-614 - 1998
- R. Sriram, Govindarasu Manimaran, C. Siva Ram Murthy:
Algorithms for delay-constrained low-cost multicast tree construction. Comput. Commun. 21(18): 1693-1706 (1998)
skipping 4 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-25 09:56 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint