메뉴 건너뛰기




Volumn , Issue , 2006, Pages

Disjoint multipath routing in dual homing networks using colored trees

Author keywords

[No Author keywords available]

Indexed keywords

DATA COLLECTION; DISJOINT MULTIPATH ROUTING; DUAL HOMING NETWORKS; ROUTING TABLE ENTRIES;

EID: 50949133642     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2006.996     Document Type: Conference Paper
Times cited : (20)

References (17)
  • 1
    • 33745900758 scopus 로고    scopus 로고
    • Distributed linear time construction of colored trees for disjoint multipath routing
    • Coimbra, Portugal, May
    • S. Ramasubramanian, M. Harkara, and M. Krunz, "Distributed linear time construction of colored trees for disjoint multipath routing," in Proceedings of IFIP Networking, Coimbra, Portugal, May 2006, pp. 1026-1038.
    • (2006) Proceedings of IFIP Networking , pp. 1026-1038
    • Ramasubramanian, S.1    Harkara, M.2    Krunz, M.3
  • 2
    • 0034844688 scopus 로고    scopus 로고
    • Split multipath routing with maximally disjoint paths in ad hoc networks
    • S. Lee and M. Gerla, "Split multipath routing with maximally disjoint paths in ad hoc networks," in Proceedings of IEEE ICC, 2001, pp. 3201-3205.
    • (2001) Proceedings of IEEE ICC , pp. 3201-3205
    • Lee, S.1    Gerla, M.2
  • 5
    • 0035703920 scopus 로고    scopus 로고
    • On-demand multipath distance vector routing in ad hoc networks
    • November
    • M. K. Marina and S. R. Das, "On-demand multipath distance vector routing in ad hoc networks," in Proceedings of IEEE ICNP, November 2001, pp. 14-23.
    • (2001) Proceedings of IEEE ICNP , pp. 14-23
    • Marina, M.K.1    Das, S.R.2
  • 6
    • 0031353437 scopus 로고    scopus 로고
    • A highly adaptive distributed routing algorithm for mobile wireless networks
    • April
    • V. D. Park and M. S. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," in Proceedings of IEEE INFOCOM, April 1997, pp. 1405-1413.
    • (1997) Proceedings of IEEE INFOCOM , pp. 1405-1413
    • Park, V.D.1    Corson, M.S.2
  • 8
    • 0042976102 scopus 로고    scopus 로고
    • Cooperative packet caching and shortest multipath in mobile adhoc networks
    • March-April
    • A. Valera, W. K. G. Seah, and S. V. Rao, "Cooperative packet caching and shortest multipath in mobile adhoc networks," in Proceedings of IEEE INFOCOM, March-April 2003, pp. 260-269.
    • (2003) Proceedings of IEEE INFOCOM , pp. 260-269
    • Valera, A.1    Seah, W.K.G.2    Rao, S.V.3
  • 9
    • 0034590189 scopus 로고    scopus 로고
    • AODV-BR: Backup routing in ad hoc network
    • September
    • S. Lee and M. Gerla, "AODV-BR: Backup routing in ad hoc network," in Proceedings of IEEE WCNC, September 2000, pp. 1311-1316.
    • (2000) Proceedings of IEEE WCNC , pp. 1311-1316
    • Lee, S.1    Gerla, M.2
  • 10
    • 0034539015 scopus 로고    scopus 로고
    • Directed diffusion: A scalable and robust communication paradigm for sensor networks
    • August
    • C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: A scalable and robust communication paradigm for sensor networks," in Mobile Computing and Networking, August 2000, pp. 56-67.
    • (2000) Mobile Computing and Networking , pp. 56-67
    • Intanagonwiwat, C.1    Govindan, R.2    Estrin, D.3
  • 11
    • 33745923542 scopus 로고    scopus 로고
    • Disjoint multipath routing using colored trees
    • Technical Report, University of Arizona, November
    • S. Ramasubramanian, H. Krishnamoorthy, and M. Krunz, "Disjoint multipath routing using colored trees," Technical Report, University of Arizona, November 2005.
    • (2005)
    • Ramasubramanian, S.1    Krishnamoorthy, H.2    Krunz, M.3
  • 12
    • 26444462927 scopus 로고    scopus 로고
    • Redundant trees for preplanned recovery in arrbitrary vertex- redundant or edge redundant graphs
    • October
    • M. Medard, R.A. Barry, S.G. Finn, and R.G. Gallager, "Redundant trees for preplanned recovery in arrbitrary vertex- redundant or edge redundant graphs," IEEE/ACM Transactions on Networking, vol. 7, no. 5, pp. 641-652, October 1999.
    • (1999) IEEE/ACM Transactions on Networking , vol.7 , Issue.5 , pp. 641-652
    • Medard, M.1    Barry, R.A.2    Finn, S.G.3    Gallager, R.G.4
  • 13
    • 0141917670 scopus 로고    scopus 로고
    • Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundanttrees
    • October
    • G. Xue, L. Chen, and K. Thulasiraman, "Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundanttrees," IEEE Journal on Selected Areas in Communication, vol. 21, no. 8, pp. 1332-1345, October 2003.
    • (2003) IEEE Journal on Selected Areas in Communication , vol.21 , Issue.8 , pp. 1332-1345
    • Xue, G.1    Chen, L.2    Thulasiraman, K.3
  • 14
    • 25644442522 scopus 로고    scopus 로고
    • Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS
    • Miami, FL, USA, March
    • W. Zhang, G. Xue, J. Tang, and K. Thulasiraman, "Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS," in Proceedings of IEEE INFOCOM, Miami, FL, USA, March 2005, pp. 2702-2710.
    • (2005) Proceedings of IEEE INFOCOM , pp. 2702-2710
    • Zhang, W.1    Xue, G.2    Tang, J.3    Thulasiraman, K.4
  • 17


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