메뉴 건너뛰기




Volumn 6, Issue 1, 2009, Pages 29-36

On finding minimum cost tree for multi-resource manycast in mesh networks

Author keywords

Grid Computing; k Steiner tree; Manycast; Quorumcast

Indexed keywords

HEURISTIC ALGORITHMS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION;

EID: 56249094477     PISSN: 15734277     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.osn.2008.05.004     Document Type: Article
Times cited : (13)

References (17)
  • 4
    • 0025430666 scopus 로고
    • Multicast routing in datagram internetworks and extended LANs
    • Deering S.E., and Cheriton D.R. Multicast routing in datagram internetworks and extended LANs. ACM Transactions on Computer Systems 8 2 (1990) 85-110
    • (1990) ACM Transactions on Computer Systems , vol.8 , Issue.2 , pp. 85-110
    • Deering, S.E.1    Cheriton, D.R.2
  • 5
    • 56249104544 scopus 로고    scopus 로고
    • B. Haberman, D. Thaler, Unicast-Prefix-based IPv6 Multicast Addresses, RFC 3306, August 2002
    • B. Haberman, D. Thaler, Unicast-Prefix-based IPv6 Multicast Addresses, RFC 3306, August 2002
  • 6
    • 56249109166 scopus 로고    scopus 로고
    • C. Partridge, T. Mendez, W. Milliken, Host Anycasting Service, RFC 1546, 1993
    • C. Partridge, T. Mendez, W. Milliken, Host Anycasting Service, RFC 1546, 1993
  • 7
    • 1642578165 scopus 로고    scopus 로고
    • A survey of anycast in IPv6 networks
    • Weber S., and Cheng L. A survey of anycast in IPv6 networks. IEEE Communications Magazine 42 1 (2004) 127-132
    • (2004) IEEE Communications Magazine , vol.42 , Issue.1 , pp. 127-132
    • Weber, S.1    Cheng, L.2
  • 8
    • 0028195813 scopus 로고    scopus 로고
    • R. Ravi, R. Sundaram, M.V. Marathe, D.J. Rosenkrantz, S.S. Ravi, Spanning trees short or small, in: Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms, 1994, pp. 546-555
    • R. Ravi, R. Sundaram, M.V. Marathe, D.J. Rosenkrantz, S.S. Ravi, Spanning trees short or small, in: Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms, 1994, pp. 546-555
  • 9
    • 0028585538 scopus 로고    scopus 로고
    • S.Y. Cheung, A. Kumar, Efficient quorumcast routing algorithms, in: Proc. of IEEE INFOCOM, Toronto, Ontario, Canada, June 1994, pp. 840-847
    • S.Y. Cheung, A. Kumar, Efficient quorumcast routing algorithms, in: Proc. of IEEE INFOCOM, Toronto, Ontario, Canada, June 1994, pp. 840-847
  • 10
    • 33845504313 scopus 로고    scopus 로고
    • A hybrid method for solving ARWA problem on WDM network
    • Din D.R. A hybrid method for solving ARWA problem on WDM network. Computer Communications 30 2 (2007) 385-395
    • (2007) Computer Communications , vol.30 , Issue.2 , pp. 385-395
    • Din, D.R.1
  • 11
    • 20344389059 scopus 로고    scopus 로고
    • M. De Leenheer, et al. An OBS-based grid architecture, in: Proc. of the Globecom Workshop on High-Performance Global Grid Networks, Nov 2004
    • M. De Leenheer, et al. An OBS-based grid architecture, in: Proc. of the Globecom Workshop on High-Performance Global Grid Networks, Nov 2004
  • 12
    • 0030374303 scopus 로고    scopus 로고
    • Quorumcast routing by multispace search
    • Globecom96
    • Du B., Gu J., Tsang D.H.K., and Wang W. Quorumcast routing by multispace search. Globecom96. IEEE 2 (1996) 1069-1073
    • (1996) IEEE , vol.2 , pp. 1069-1073
    • Du, B.1    Gu, J.2    Tsang, D.H.K.3    Wang, W.4
  • 13
    • 0032256853 scopus 로고    scopus 로고
    • Optimal quorumcast routing
    • Globecom 98
    • Low C.P. Optimal quorumcast routing. Globecom 98. IEEE 5 (1998) 3013-3016
    • (1998) IEEE , vol.5 , pp. 3013-3016
    • Low, C.P.1
  • 14
    • 0035699194 scopus 로고    scopus 로고
    • B. Wang, J.C. Hou, An efficient QoS routing algorithm for quorumcast communication, Network Protocols, 2001, in: Ninth International Conference on, IEEE, Nov. 2001, pp. 110-118
    • B. Wang, J.C. Hou, An efficient QoS routing algorithm for quorumcast communication, Network Protocols, 2001, in: Ninth International Conference on, IEEE, Nov. 2001, pp. 110-118
  • 15
    • 33244493480 scopus 로고    scopus 로고
    • N. Garg, Saving an epsilon: A 2-approximation for the k-mst problem in graphs, in: ACM Symposium on Theory of Computing, 2005, pp. 396-402
    • N. Garg, Saving an epsilon: A 2-approximation for the k-mst problem in graphs, in: ACM Symposium on Theory of Computing, 2005, pp. 396-402
  • 16
    • 38549166861 scopus 로고    scopus 로고
    • X. Huang, Q. She, V.M. Vokkarane, J.P. Jue, Manycasting over optical burst-switched networks, in: Proc. of ICC'07, June 2007, pp. 2353-2358
    • X. Huang, Q. She, V.M. Vokkarane, J.P. Jue, Manycasting over optical burst-switched networks, in: Proc. of ICC'07, June 2007, pp. 2353-2358
  • 17
    • 40249106865 scopus 로고    scopus 로고
    • Q. She, X. Huang, N. Kannasoot, Q. Zhang, J.P. Jue, Multi-resource manycast over optical burst switched networks, in: Proc. of ICCCN'07, August 2007
    • Q. She, X. Huang, N. Kannasoot, Q. Zhang, J.P. Jue, Multi-resource manycast over optical burst switched networks, in: Proc. of ICCCN'07, August 2007


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.