메뉴 건너뛰기




Volumn , Issue , 2011, Pages

Capacity-aware routing using throw-boxes

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER SIZES; DELAY TOLERANT NETWORKS; LINK DELAY; LOADING CAPACITIES; MARKOV CHAIN; MESSAGE DISSEMINATION; MOBILE NODES; NETWORK GRAPH; NETWORK LINKS; ROUTING POLICIES; ROUTING SCHEME; ROUTING STRATEGIES; SHORTEST PATH; TIME-DEPENDENT; TIME-VARYING DELAY; TRAVEL TIME; VIRTUAL LINK; WIRELESS DEVICES;

EID: 84857222289     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2011.6134049     Document Type: Conference Paper
Times cited : (10)

References (11)
  • 4
    • 21844451437 scopus 로고    scopus 로고
    • Routing in a Delay Tolerant Network
    • S. Jain, K. Fall, and R. Patra. Routing in a Delay Tolerant Network. In Proc. ACM Sigcomm, pages 145-158, 2004.
    • (2004) Proc. ACM Sigcomm , pp. 145-158
    • Jain, S.1    Fall, K.2    Patra, R.3
  • 7
    • 0001850846 scopus 로고
    • Dynamic shortest paths in acyclic networks with markovian arc costs
    • H. N. Psaraftis and J. N. Tsitsiklis. Dynamic shortest paths in acyclic networks with markovian arc costs. Operations Research, 41(1):91-101, 1993.
    • (1993) Operations Research , vol.41 , Issue.1 , pp. 91-101
    • Psaraftis, H.N.1    Tsitsiklis, J.N.2
  • 8
    • 40749157530 scopus 로고    scopus 로고
    • Efficient routing in intermittently connected mobile networks:The multiple-copy case
    • T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Efficient routing in intermittently connected mobile networks:The multiple-copy case. IEEE/ACM Trans. on Networking, 16(1), 2008.
    • (2008) IEEE/ACM Trans. on Networking , vol.16 , Issue.1
    • Spyropoulos, T.1    Psounis, K.2    Raghavendra, C.S.3


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