메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Network information flow in network of queues

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION PROBLEMS; FLOW ROUTING; GENERAL NETWORKS; IN-NETWORK; INFORMATION FLOWS; MULTICAST; MULTICAST ROUTING; MULTIHOP; MULTIPLE UNICASTS; NETWORK CODING; NETWORK FLOW MODEL; NETWORK INFORMATION FLOW; OPTIMAL ROUTING; QUEUEING DELAYS; SIMPLE TOPOLOGY; UNICAST;

EID: 65949118717     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOT.2008.4770562     Document Type: Conference Paper
Times cited : (2)

References (19)
  • 7
    • 0017440153 scopus 로고
    • On the topological design of distributed computer networks
    • M. Gerla and L. Kleinrock. On the topological design of distributed computer networks. IEEE Transactions on Communications, 25(1), 1977.
    • (1977) IEEE Transactions on Communications , vol.25 , Issue.1
    • Gerla, M.1    Kleinrock, L.2
  • 10
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • October
    • R. Koetter and M. Médard. An Algebraic Approach to Network Coding. IEEE/ACM Transactions on Networking, 11(5):782-795, October 2003.
    • (2003) IEEE/ACM Transactions on Networking , vol.11 , Issue.5 , pp. 782-795
    • Koetter, R.1    Médard, M.2
  • 13
    • 33745135399 scopus 로고    scopus 로고
    • On achieving optimal multicast throughput in undirected networks
    • June
    • Z. Li, B. Li, and L. C. Lau. On Achieving Optimal Multicast Throughput in Undirected Networks. IEEE Transactions on Information Theory, 52(6):2467-2485, June 2006.
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.6 , pp. 2467-2485
    • Li, Z.1    Li, B.2    Lau, L.C.3
  • 14
    • 0036476668 scopus 로고    scopus 로고
    • Optimal partition of qos requirements on unicast paths and multicast trees
    • D. Lorenz and A. Orda. Optimal partition of qos requirements on unicast paths and multicast trees. IEEE/ACM Transactions on Networking, 10(1), 2005.
    • (2005) IEEE/ACM Transactions on Networking , vol.10 , Issue.1
    • Lorenz, D.1    Orda, A.2
  • 16
    • 0034836055 scopus 로고    scopus 로고
    • Brite: An approach to universal topology generation
    • Cincinnati, USA
    • A. Medina, A. Lakhina, I. Matta, and J. Byers. Brite: An approach to universal topology generation. In MASCOTS'01, Cincinnati, USA, 2001.
    • (2001) MASCOTS'01
    • Medina, A.1    Lakhina, A.2    Matta, I.3    Byers, J.4
  • 17
    • 50949093485 scopus 로고    scopus 로고
    • Rate allocation under network end-to-end quality-of-service requirements
    • San Francisco, USA
    • M. Saad, A. Leon-Garcia, and W. Yu. Rate Allocation under Network End-to-End Quality-of-Service Requirements. In IEEE Globecom, San Francisco, USA, 2006.
    • (2006) IEEE Globecom
    • Saad, M.1    Leon-Garcia, A.2    Yu, W.3
  • 18
    • 28044470536 scopus 로고    scopus 로고
    • Algorithms for precomputing constrained widest paths and multicast trees
    • S. Siachalou and L. Georgiadis. Algorithms for precomputing constrained widest paths and multicast trees. IEEE/ACM Transactions on Networking, 13(5), 2005.
    • (2005) IEEE/ACM Transactions on Networking , vol.13 , pp. 5
    • Siachalou, S.1    Georgiadis, L.2


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