{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:58:41Z","timestamp":1787759921875,"version":"build-2784847793"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Netw Syst Manage"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s10922-005-9019-0","type":"journal-article","created":{"date-parts":[[2006,3,14]],"date-time":"2006-03-14T05:15:07Z","timestamp":1142313307000},"page":"49-67","source":"Crossref","is-referenced-by-count":79,"title":["Edge-Cut Bounds on Network Coding Rates"],"prefix":"10.1007","volume":"14","author":[{"given":"Gerhard","family":"Kramer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Serap A.","family":"Savari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,3,15]]},"reference":[{"key":"9019_CR1","volume-title":"Active Networks and Active Network Management","author":"S. F. Bush","year":"2001","unstructured":"S. F. Bush and A. B. Kulkarni, Active Networks and Active Network Management, Kluwer Academic, New York, 2001."},{"key":"9019_CR2","unstructured":"S. F. Bush, Active Virtual Network Management Prediction: Complexity as a Framework for Prediction, Optimization, and Assurance, Available at http:\/\/arxiv.org\/PS_cache\/cs\/pdf\/0203\/0203014.pdf"},{"issue":"3","key":"9019_CR3","first-page":"27","volume":"12","author":"D. S. Alexander","year":"1998","unstructured":"D. S. Alexander, W. A. Arbaugh, M. W. Hicks, P. Kakkar, A. D. Keromytis, J. T. Moore, C. A. Gunter, S. M. Nettles, and J. M. Smith, The SwitchWare Active Network Architecture, IEEE Network, Vol. 12, No. 3, pp. 27\u201336, 1998.","journal-title":"IEEE Network"},{"key":"9019_CR4","unstructured":"K. Calvert, ed. Active Networks Framework, Available at http:\/\/www.cc.gatech.edu\/projects\/canes\/papers\/arch-1-0.ps.gz"},{"issue":"1","key":"9019_CR5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/291251.289431","volume":"34","author":"M. Hicks","year":"1999","unstructured":"M. Hicks, P. Kakkar, T. Moore, C. Gunter, and S. Nettles, PLAN: A Programmable Language for Active Networks, ACM SIGPLAN Notices, Vol. 34, No. 1, pp. 86\u201393, 1999.","journal-title":"ACM SIGPLAN Notices"},{"issue":"4","key":"9019_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/2.755004","volume":"32","author":"D. Wetherall","year":"1999","unstructured":"D. Wetherall, J. Guttag, and D. Tennenhouse, ANTS: Network Services Without the Red Tape, Computer, Vol. 32, No. 4, pp. 42\u201348, 1999.","journal-title":"Computer"},{"key":"9019_CR7","volume-title":"Flows in Networks","author":"L. R. Ford Jr.","year":"1962","unstructured":"L. R. Ford Jr. and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962."},{"issue":"4","key":"9019_CR8","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, Network information flow, IEEE Transactions on Information Theory, Vol. 46, No. 4, pp. 1204\u20131216, 2000.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9019_CR9","unstructured":"R. Koetter, Available at http:\/\/tesla.csl.uiuc.edu\/koetter\/NWC\/"},{"key":"9019_CR10","unstructured":"P. A. Chou, Y. Wu, and K. Jain, Practical network coding, In: Proceedings of the 41st Allerton Conference on Communication, Control and Computing, Monticello, IL, 2003."},{"key":"9019_CR11","unstructured":"T. Ho, M. M\u00e9dard, J. Shi, D. R. Karger, and M. Effros, On randomized network coding, In: Proceedings of the 41st Allerton Conference on Communication, Control and Computing, Monticello, IL, 2003."},{"key":"9019_CR12","unstructured":"T. Ho, B. Leong, M. M\u00e9dard, R. Koetter, Y.-H. Chang, and M. Effros, On the utility of network coding in dynamic environments, In: Proceedings of the International Workshop on Wireless Ad-hoc Networks (IWWAN), Oulu, Finland, 2004."},{"issue":"4","key":"9019_CR13","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1109\/TIT.2005.844062","volume":"51","author":"T. Ho","year":"2005","unstructured":"T. Ho, M. M\u00e9dard, and R. Koetter, An Information-Theoretic View of Network Management, IEEE Transactions on Information Theory, Vol. 51, No. 4, pp. 1295\u20131312, 2005.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"9019_CR14","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R. Koetter","year":"2003","unstructured":"R. Koetter and M. M\u00e9dard, An Algebraic Approach to Network Coding, IEEE\/ACM Transactions on Networking, Vol. 11, No. 5, pp. 782\u2013795, 2003.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"9019_CR15","unstructured":"Y. Wu. P. A. Chou, and S.-Y. Kung, Minimum-energy multicast in mobile ad hoc networks using network coding, In Proceedings of the Information Theory Workshop 2004, San Antonio, TX, 2004."},{"issue":"1","key":"9019_CR16","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/JSAC.2004.837362","volume":"23","author":"Y. Wu","year":"2005","unstructured":"Y. Wu, P. A. Chou, Q. Zhang, K. Jain, W. Zhu, and S.-Y. Kung, Network Planning in Wireless Ad Hoc Networks: A Cross-Layer Approach, IEEE Journal on Selected Areas of Communications. Vol. 23, no. 1, pp. 136\u2013150, 2005.","journal-title":"IEEE Journal on Selected Areas of Communications"},{"key":"9019_CR17","doi-asserted-by":"crossref","unstructured":"G. B. Dantzig and D. R. Fulkerson, On the max-flow, min-cut theorem of networks, In: H. W. Kuhn (ed.), Linear Inequalities, Annals of Mathematical Studies, Number 38, Princeton University Press, Princeton, NJ, pp. 215\u2013221, 1956.","DOI":"10.1515\/9781400881987-013"},{"issue":"4","key":"9019_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","volume":"2","author":"P. Elias","year":"1956","unstructured":"P. Elias, A. Feinstein, and C. E. Shannon, A Note on the Maximum Flow through a Network, IRE Transactions on Information Theory, Vol. 2, No. 4, pp. 117\u2013119, 1956.","journal-title":"IRE Transactions on Information Theory"},{"issue":"3","key":"9019_CR19","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L. R. Ford","year":"1956","unstructured":"L. R. Ford and D. R. Fulkerson, Maximal Flow through a Network, Canadian Journal of Mathematics, Vol. 8, No. 3, pp. 399\u2013404, 1956.","journal-title":"Canadian Journal of Mathematics"},{"key":"9019_CR20","unstructured":"J. T. Robacker, On Network Theory, The RAND Corporation, Research Memorandum RM-1498, May 26, 1955."},{"key":"9019_CR21","unstructured":"G. Kramer and S. A. Savari, On networks of two-way channels, In: A. Ashikhmin and A. Barg (eds.), Algebraic Coding Theory and Information Theory, DIMACS Workshop, Dec. 15-18, 2003, Rutgers University, Vol. 68: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, Rhode Island, pp. 133\u2013143, 2005."},{"key":"9019_CR22","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo. CA, 1988."},{"key":"9019_CR23","unstructured":"G. Kramer, Directed Information for Channels with Feedback, Hartung-Gorre Verlag, Konstanz, 1998, ETH Series in Information Processing, Vol. 11."},{"key":"9019_CR24","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of information Theory","author":"T. M. Cover","year":"1991","unstructured":"T. M. Cover and J. A. Thomas, Elements of information Theory, Wiley, New York, 1991."},{"key":"9019_CR25","doi-asserted-by":"crossref","unstructured":"S. P. Borade, Network information flow: Limits and achievability, In: Proceedings of the IEEE International Symposium on Information Theory, Lausanne, Switzerland, p. 139, June 30-July 5, 2002.","DOI":"10.1109\/ISIT.2002.1023411"},{"issue":"1","key":"9019_CR26","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TIT.2002.806135","volume":"49","author":"G. Kramer","year":"2003","unstructured":"G. Kramer, Capacity Results for the Discrete Memoryless Network, IEEE Transactions on Information Theory, Vol. 49, No. 1, pp. 4\u201321, 2003.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9019_CR27","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"A. Schrijver, Combinatorial Optimization, Springer-Verlag, New York, 2003."},{"issue":"3","key":"9019_CR28","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.11.3.344","volume":"11","author":"T. C. Hu","year":"1963","unstructured":"T. C. Hu, Multi-commodity Network Flows, Operations Research, Vol. 11, No. 3, pp. 344\u2013360, 1963.","journal-title":"Operations Research"},{"issue":"1","key":"9019_CR29","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H. Okamura","year":"1981","unstructured":"H. Okamura and P. D. Seymour, Multicommodity Flows in Planar Graphs, Journal of Combinatorial Theory, Series B, Vol. 31, No. 1, pp. 75\u201381, 1981.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"9019_CR30","doi-asserted-by":"crossref","unstructured":"N. J. A. Harvey, R. D. Kleinberg, and A. R. Lehman. On the Capacity of Information Networks, IEEE Transactions on Information Theory, in press.","DOI":"10.1109\/TIT.2006.874531"},{"key":"9019_CR31","unstructured":"K. Jain, P. A. Chou, V. V. Vazirani, R. Yeung, and G. Yuval, On the Capacity of Multiple Unicast Sessions in Undirected Graphs, IEEE Transactions on Information Theory, in press."},{"key":"9019_CR32","unstructured":"DIMACS Working Group on Network Coding, DIMACS Center, Rutgers University, Piscataway, NJ, Jan. 26\u201328, 2005, Available at http:\/\/dimacs.rutgers.edu\/Workshops\/NetworkCodingWG ."},{"key":"9019_CR33","doi-asserted-by":"crossref","unstructured":"G. Kramer and S. A. Savari. Progressive d-separating edge set bounds on network coding rates, In: Proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, Sept. 2005.","DOI":"10.1109\/ISIT.2005.1523612"}],"container-title":["Journal of Network and Systems Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-005-9019-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10922-005-9019-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-005-9019-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T04:46:28Z","timestamp":1586753188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10922-005-9019-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["9019"],"URL":"https:\/\/doi.org\/10.1007\/s10922-005-9019-0","relation":{},"ISSN":["1064-7570","1573-7705"],"issn-type":[{"value":"1064-7570","type":"print"},{"value":"1573-7705","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3]]}}}