[ { "key": "MBXUFQ84", "version": 2, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/MBXUFQ84", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/MBXUFQ84", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Zhang and Li", "parsedDate": "2008", "numChildren": 0 }, "data": { "key": "MBXUFQ84", "version": 2, "itemType": "conferencePaper", "title": "Dice: a game theoretic framework for wireless multipath network coding", "creators": [ { "creatorType": "author", "firstName": "Xinyu", "lastName": "Zhang" }, { "creatorType": "author", "firstName": "Baochun", "lastName": "Li" } ], "abstractNote": "Network coding has emerged as a promising approach that enables reliable and efficient end-to-end transmissions in lossy wireless mesh networks. Existing protocols have demonstrated its resilience to packet losses, as well as the ability to integrate naturally with multipath opportunistic routing. However, these heuristics do not take into account the inherent resource competition in wireless networks, thereby compromising the coding advantages. In this paper, we take a game-theoretic perspective towards optimized resource allocation for network coding based unicast protocols. We design decentralized mechanisms that achieve better efficiency-fairness tradeoff, for both cooperative and selfish users. Our framework features a modularized optimization of two subproblems: the multipath routing of coded information flows for each player, and the broadcast and coding rate allocation among competing players. We have implemented the framework on a wireless emulation testbed and demonstrated its high performance in terms of throughput and fairness.", "proceedingsTitle": "Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing", "conferenceName": "", "publisher": "ACM", "place": "Hong Kong, Hong Kong, China", "date": "2008", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "293-302", "series": "", "seriesNumber": "", "DOI": "10.1145/1374618.1374658", "ISBN": "978-1-60558-073-9", "citationKey": "", "url": "http://portal.acm.org/citation.cfm?id=1374658", "accessDate": "2009-09-28T08:31:51Z", "ISSN": "", "archive": "ACM", "archiveLocation": "", "shortTitle": "Dice", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "flow control", "type": 1 }, { "tag": "game theory", "type": 1 }, { "tag": "multipath opportunistic routing", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "optimization decomposition", "type": 1 }, { "tag": "wireless mesh networks", "type": 1 } ], "collections": [ "2MGSM2XE" ], "relations": {}, "dateAdded": "2009-09-28T08:31:51Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "5SEKK8JB", "version": 2, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/5SEKK8JB", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/5SEKK8JB", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Chachulski et al.", "parsedDate": "2007", "numChildren": 0 }, "data": { "key": "5SEKK8JB", "version": 2, "itemType": "conferencePaper", "title": "Trading structure for randomness in wireless opportunistic routing", "creators": [ { "creatorType": "author", "firstName": "Szymon", "lastName": "Chachulski" }, { "creatorType": "author", "firstName": "Michael", "lastName": "Jennings" }, { "creatorType": "author", "firstName": "Sachin", "lastName": "Katti" }, { "creatorType": "author", "firstName": "Dina", "lastName": "Katabi" } ], "abstractNote": "Opportunistic routing is a recent technique that achieves high throughput in the face of lossy wireless links. The current opportunistic routing protocol, ExOR, ties the MAC with routing, imposing a strict schedule on routers' access to the medium. Although the scheduler delivers opportunistic gains, it misses some of the inherent features of the 802.11 MAC. For example, it prevents spatial reuse and thus may underutilize the wireless medium. It also eliminates the layering abstraction, making the protocol less amenable to extensions to alternate traffic types such as multicast.", "proceedingsTitle": "Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications", "conferenceName": "", "publisher": "ACM", "place": "Kyoto, Japan", "date": "2007", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "169-180", "series": "", "seriesNumber": "", "DOI": "10.1145/1282380.1282400", "ISBN": "978-1-59593-713-1", "citationKey": "", "url": "http://portal.acm.org/citation.cfm?id=1282380.1282400", "accessDate": "2009-09-28T08:30:48Z", "ISSN": "", "archive": "ACM", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "network coding", "type": 1 }, { "tag": "wireless networks", "type": 1 } ], "collections": [ "2MGSM2XE" ], "relations": {}, "dateAdded": "2009-09-28T08:30:48Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "EKHBPZPI", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/EKHBPZPI", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/EKHBPZPI", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Wang et al.", "parsedDate": "2011-04", "numChildren": 0 }, "data": { "key": "EKHBPZPI", "version": 1, "itemType": "conferencePaper", "title": "Anonymous communication with network coding against traffic analysis attack", "creators": [ { "creatorType": "author", "firstName": "Jin", "lastName": "Wang" }, { "creatorType": "author", "firstName": "Jianping", "lastName": "Wang" }, { "creatorType": "author", "firstName": "Chuan", "lastName": "Wu" }, { "creatorType": "author", "firstName": "Kejie", "lastName": "Lu" }, { "creatorType": "author", "firstName": "Naijie", "lastName": "Gu" } ], "abstractNote": "Flow untraceability is one critical requirement for anonymous communication with network coding, which prevents malicious attackers with wiretapping and traffic analysis abilities from relating the senders to the receivers, using linear dependency of the received packets. There have recently been proposals advocating encryptions on the Global Encoding Vectors (GEV) of network coding to thwart such attacks. Nevertheless, there has been no exploration of the capability of networking coding itself, to constitute more efficient and effective algorithms which guarantee anonymity. In this paper, we design a novel, simple, and effective linear network coding mechanism (ALNCode) to achieve flow untraceability in a communication network with multiple unicast flows. With solid theoretical analysis, we first show that linear network coding (LNC) can be applied to thwart traffic analysis attacks without the need of encrypting GEVs. Our key idea is to mix multiple flows at their intersection nodes by generating downstream GEVs from the common basis of upstream GEVs belonging to multiple flows, in order to hide the correlation of upstream and downstream GEVs in each flow. We then design a deterministic LNC scheme to implement our idea, by which the downstream GEVs produced are guaranteed to obfuscate their correlation with the corresponding upstream GEVs. We also give extensive theoretical analysis on the intersection probability of GEV bases and the influential factors to the effectiveness of our scheme, as well as the algorithm complexity to support its efficiency.", "proceedingsTitle": "Proc. of the 30th Conference on Computer Communications (INFOCOM)", "conferenceName": "", "publisher": "", "place": "", "date": "april 2011", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "1008-1016", "series": "", "seriesNumber": "", "DOI": "10.1109/INFCOM.2011.5934873", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "ALNCode", "type": 1 }, { "tag": "algorithm complexity", "type": 1 }, { "tag": "anonymous communication", "type": 1 }, { "tag": "communication network", "type": 1 }, { "tag": "downstream GEV", "type": 1 }, { "tag": "flow untraceability", "type": 1 }, { "tag": "global encoding vector", "type": 1 }, { "tag": "linear codes", "type": 1 }, { "tag": "linear dependency", "type": 1 }, { "tag": "linear network coding", "type": 1 }, { "tag": "malicious attacker", "type": 1 }, { "tag": "multiple unicast flows", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "received packet", "type": 1 }, { "tag": "telecommunication security", "type": 1 }, { "tag": "telecommunication traffic", "type": 1 }, { "tag": "traffic analysis attack", "type": 1 }, { "tag": "upstream GEV", "type": 1 }, { "tag": "wiretapping", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/PCKQ6XFM" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "TJ7S85MC", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/TJ7S85MC", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/TJ7S85MC", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Samfat et al.", "parsedDate": "1995", "numChildren": 0 }, "data": { "key": "TJ7S85MC", "version": 1, "itemType": "conferencePaper", "title": "Untraceability in mobile networks", "creators": [ { "creatorType": "author", "firstName": "Didier", "lastName": "Samfat" }, { "creatorType": "author", "firstName": "Refik", "lastName": "Molva" }, { "creatorType": "author", "firstName": "N.", "lastName": "Asokan" } ], "abstractNote": "", "proceedingsTitle": "Proc. of the 1st annual international conference on mobile computing and networking (MobiCom)", "conferenceName": "", "publisher": "", "place": "New York, USA", "date": "1995", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "26-36", "series": "", "seriesNumber": "", "DOI": "10.1145/215530.215548", "ISBN": "0-89791-814-2", "citationKey": "", "url": "", "accessDate": "2012-06-25T09:28:00Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ACM Digital Library", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "CDPD", "type": 1 }, { "tag": "GSM", "type": 1 }, { "tag": "alias", "type": 1 }, { "tag": "anonymity", "type": 1 }, { "tag": "authentication", "type": 1 }, { "tag": "location privacy", "type": 1 }, { "tag": "mobility", "type": 1 }, { "tag": "security", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/78NTIWJW" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "MCI29A89", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/MCI29A89", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/MCI29A89", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Kamal", "parsedDate": "2008", "numChildren": 0 }, "data": { "key": "MCI29A89", "version": 1, "itemType": "conferencePaper", "title": "A Generalized Strategy for 1+N Protection", "creators": [ { "creatorType": "author", "firstName": "A.E.", "lastName": "Kamal" } ], "abstractNote": "1+N protection was proposed by the author in [1], where a single circuit is used to protect a number of connections. For this purpose, network coding was used to carry a linear combination of the signals, and p-Cycles were used to provide this combination to the destination nodes in order to allow them to extract a second copy of the transmitted signal. In this paper, we introduce a generalized form of 1+N protection. Network coding is used to combine a number of signals on one protection circuit. However, p-Cycles and not used, and the signals are combined on a protection circuit, which is optimally selected to minimize the amount of protection resources. Moreover, and unlike the strategy in [1], the generalized strategy does not require symmetry in resource reservation in the two directions of communication, but the protection resources are provisioned based on need. The strategy introduced in this paper provides 100% protection against single link failure on any of the working paths. A performance comparison between the cost of implementing the proposed scheme and 1+1 protection is provided, and is based on integer linear programming formulations.", "proceedingsTitle": "Proc. of IEEE International Conference on Communications (ICC)", "conferenceName": "IEEE International Conference on Communications, 2008. ICC '08", "publisher": "", "place": "", "date": "五月 2008", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "5155-5159", "series": "", "seriesNumber": "", "DOI": "10.1109/ICC.2008.968", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "1+N protection", "type": 1 }, { "tag": "destination nodes", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "generalized strategy", "type": 1 }, { "tag": "integer linear programming", "type": 1 }, { "tag": "integer programming", "type": 1 }, { "tag": "linear combination", "type": 1 }, { "tag": "linear programming", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "optical fibre networks", "type": 1 }, { "tag": "p-cycles", "type": 1 }, { "tag": "protection circuit", "type": 1 }, { "tag": "single link failure", "type": 1 }, { "tag": "telecommunication network reliability", "type": 1 }, { "tag": "telecommunication security", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/5HZ67TMV" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "HH66HGTW", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/HH66HGTW", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/HH66HGTW", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Lun et al.", "parsedDate": "2006", "numChildren": 0 }, "data": { "key": "HH66HGTW", "version": 1, "itemType": "journalArticle", "title": "Minimum-cost multicast over coded packet networks", "creators": [ { "creatorType": "author", "firstName": "Desmond S.", "lastName": "Lun" }, { "creatorType": "author", "firstName": "Niranjan", "lastName": "Ratnakar" }, { "creatorType": "author", "firstName": "Muriel", "lastName": "Médard" }, { "creatorType": "author", "firstName": "Ralf", "lastName": "Koetter" }, { "creatorType": "author", "firstName": "David R.", "lastName": "Karger" }, { "creatorType": "author", "firstName": "Tracey", "lastName": "Ho" }, { "creatorType": "author", "firstName": "Ebad", "lastName": "Ahmed" }, { "creatorType": "author", "firstName": "Fang", "lastName": "Zhao" } ], "abstractNote": "We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group). For static multicast, we reduce the problem to a polynomial-time solvable optimization problem, and we present decentralized algorithms for solving it. These algorithms, when coupled with existing decentralized schemes for constructing network codes, yield a fully decentralized approach for achieving minimum-cost multicast. By contrast, establishing minimum-cost static multicast connections over routed packet networks is a very difficult problem even using centralized computation, except in the special cases of unicast and broadcast connections. For dynamic multicast, we reduce the problem to a dynamic programming problem and apply the theory of dynamic programming to suggest how it may be solved.", "publicationTitle": "IEEE/ACM Transactions on Networking", "publisher": "", "place": "", "date": "2006", "volume": "14", "issue": "SI", "section": "", "partNumber": "", "partTitle": "", "pages": "2608-2623", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "", "citationKey": "", "url": "", "accessDate": "2010-09-07T07:43:02Z", "PMID": "", "PMCID": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ACM", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Communication networks", "type": 1 }, { "tag": "ad hoc networks", "type": 1 }, { "tag": "distributed algorithms", "type": 1 }, { "tag": "dynamic multicast groups", "type": 1 }, { "tag": "multicast", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network optimization", "type": 1 }, { "tag": "wireless networks", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/3RUTVWV7" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "5AEI5SXD", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/5AEI5SXD", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/5AEI5SXD", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Katti et al.", "parsedDate": "2008", "numChildren": 0 }, "data": { "key": "5AEI5SXD", "version": 1, "itemType": "journalArticle", "title": "XORs in the air: practical wireless network coding", "creators": [ { "creatorType": "author", "firstName": "Sachin", "lastName": "Katti" }, { "creatorType": "author", "firstName": "Hariharan", "lastName": "Rahul" }, { "creatorType": "author", "firstName": "Wenjun", "lastName": "Hu" }, { "creatorType": "author", "firstName": "Dina", "lastName": "Katabi" }, { "creatorType": "author", "firstName": "Muriel", "lastName": "Médard" }, { "creatorType": "author", "firstName": "Jon", "lastName": "Crowcroft" } ], "abstractNote": "This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our design is rooted in the theory of network coding. Prior work on network coding is mainly theoretical and focuses on multicast traffic. This paper aims to bridge theory with practice; it addresses the common case of unicast traffic, dynamic and potentially bursty flows, and practical issues facing the integration of network coding in the current network stack. We evaluate our design on a 20-node wireless network, and discuss the results of the first testbed deployment of wireless network coding. The results show that using COPE at the forwarding layer, without modifying routing and higher layers, increases network throughput. The gains vary from a few percent to several folds depending on the traffic pattern, congestion level, and transport protocol.", "publicationTitle": "IEEE/ACM Transactions on Networking (TON)", "publisher": "", "place": "", "date": "2008", "volume": "16", "issue": "3", "section": "", "partNumber": "", "partTitle": "", "pages": "497-510", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "", "citationKey": "", "url": "", "accessDate": "2010-06-12T13:25:10Z", "PMID": "", "PMCID": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "XORs in the air", "language": "", "libraryCatalog": "ACM", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "algorithms", "type": 1 }, { "tag": "design", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "perormance", "type": 1 }, { "tag": "theory", "type": 1 }, { "tag": "wireless networks", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/P5S6PQAM" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "KQEIBIGK", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/KQEIBIGK", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/KQEIBIGK", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Dong et al.", "parsedDate": "2007", "numChildren": 0 }, "data": { "key": "KQEIBIGK", "version": 1, "itemType": "conferencePaper", "title": "Practical network coding in wireless networks", "creators": [ { "creatorType": "author", "firstName": "Qunfeng", "lastName": "Dong" }, { "creatorType": "author", "firstName": "Jianming", "lastName": "Wu" }, { "creatorType": "author", "firstName": "Wenjun", "lastName": "Hu" }, { "creatorType": "author", "firstName": "Jon", "lastName": "Crowcroft" } ], "abstractNote": "Network coding is seen as a promising technique to improve network throughput. In this paper, we study two important problems in localized network coding in wireless networks, which only requires each node to know about and coordinate with one-hop neighbors. In particular, we first establish a condition that is both necessary and sufficient for useful coding to be possible. We show this condition is much weaker than expected, and hence allows a variety of coding schemes to suit different network conditions and application preferences. Based on the understanding we establish, we are able to design a robust coding technique called loop coding that can improve network throughput and TCP throughput simultaneously.", "proceedingsTitle": "Proc. of the 13th annual ACM international conference on Mobile computing and networking", "conferenceName": "", "publisher": "", "place": "Montréal, Québec, Canada", "date": "2007", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "306-309", "series": "", "seriesNumber": "", "DOI": "10.1145/1287853.1287891", "ISBN": "978-1-59593-681-3", "citationKey": "", "url": "", "accessDate": "2010-06-12T13:01:47Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ACM", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "network coding", "type": 1 }, { "tag": "tcp", "type": 1 }, { "tag": "throughput", "type": 1 }, { "tag": "wireless networks", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/UM23BF9X" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "GTTHAE83", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/GTTHAE83", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/GTTHAE83", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Cai and Yeung", "parsedDate": "2002", "numChildren": 0 }, "data": { "key": "GTTHAE83", "version": 1, "itemType": "conferencePaper", "title": "Secure network coding", "creators": [ { "creatorType": "author", "firstName": "Ning", "lastName": "Cai" }, { "creatorType": "author", "firstName": "R.W.", "lastName": "Yeung" } ], "abstractNote": "Recent work on network coding renders a new view on multicasting in a network. In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. The usual function of switching at a node is a special case of network coding. The advantage of network coding is that the full capacity of the network can be utilized. In this paper, we propose a new model which incorporates network coding and information security. Specifically, a collection of subsets of links is given, and a wiretapper is allowed to access any one (but not more than one) of these subsets without being able to obtain any information about the message transmitted. Our model includes secret sharing as a special case. We present a construction of secure linear network codes provided a certain graph-theoretic sufficient condition is satisfied.", "proceedingsTitle": "Proc. of IEEE International Symposium on Information Theory", "conferenceName": "IEEE International Symposium on Information Theory 2002", "publisher": "", "place": "", "date": "2002", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "323", "series": "", "seriesNumber": "", "DOI": "10.1109/ISIT.2002.1023595", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "IEEE Xplore", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "acyclic directed graph", "type": 1 }, { "tag": "cryptography", "type": 1 }, { "tag": "directed graphs", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "graph-theoretic sufficient condition", "type": 1 }, { "tag": "information security", "type": 1 }, { "tag": "linear codes", "type": 1 }, { "tag": "multicasting", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "secret sharing", "type": 1 }, { "tag": "secure linear network codes", "type": 1 }, { "tag": "wiretapper", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/TN7KXRQ8" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "ET2XHDGN", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/ET2XHDGN", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/ET2XHDGN", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Ahlswede et al.", "parsedDate": "2000", "numChildren": 0 }, "data": { "key": "ET2XHDGN", "version": 1, "itemType": "journalArticle", "title": "Network information flow", "creators": [ { "creatorType": "author", "firstName": "R.", "lastName": "Ahlswede" }, { "creatorType": "author", "firstName": "Ning", "lastName": "Cai" }, { "creatorType": "author", "firstName": "S.-Y.R.", "lastName": "Li" }, { "creatorType": "author", "firstName": "R.W.", "lastName": "Yeung" } ], "abstractNote": "We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. We study the problem with one information source, and we have obtained a simple characterization of the admissible coding rate region. Our result can be regarded as the max-flow min-cut theorem for network information flow. Contrary to one's intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a “fluid” which can simply be routed or replicated. Rather, by employing coding at the nodes, which we refer to as network coding, bandwidth can in general be saved. This finding may have significant impact on future design of switching systems", "publicationTitle": "IEEE Transactions on Information Theory (TIT)", "publisher": "", "place": "", "date": "2000", "volume": "46", "issue": "4", "section": "", "partNumber": "", "partTitle": "", "pages": "1204-1216", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Information Theory, IEEE Transactions on", "DOI": "10.1109/18.850663", "citationKey": "", "url": "", "accessDate": "", "PMID": "", "PMCID": "", "ISSN": "0018-9448", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "admissible coding rate region", "type": 1 }, { "tag": "bandwidth", "type": 1 }, { "tag": "computer network applications", "type": 1 }, { "tag": "computer networks", "type": 1 }, { "tag": "directed graph", "type": 1 }, { "tag": "directed graphs", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "information source", "type": 1 }, { "tag": "information sources", "type": 1 }, { "tag": "max-flow min-cut theorem", "type": 1 }, { "tag": "minimax techniques", "type": 1 }, { "tag": "multicast communication", "type": 1 }, { "tag": "multicasting", "type": 1 }, { "tag": "networ routing", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network information flow", "type": 1 }, { "tag": "node coding", "type": 1 }, { "tag": "point-to-point communication network", "type": 1 }, { "tag": "switching systems design", "type": 1 }, { "tag": "telecommunication network routing", "type": 1 }, { "tag": "telecommunication switching", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/7PMIRW2A" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "673VDDAX", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/673VDDAX", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/673VDDAX", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Li et al.", "parsedDate": "2006", "numChildren": 0 }, "data": { "key": "673VDDAX", "version": 1, "itemType": "journalArticle", "title": "On achieving maximum multicast throughput in undirected networks", "creators": [ { "creatorType": "author", "firstName": "Zongpeng", "lastName": "Li" }, { "creatorType": "author", "firstName": "Baochun", "lastName": "Li" }, { "creatorType": "author", "firstName": "Lap Chi", "lastName": "Lau" } ], "abstractNote": "The transmission of information within a data network is constrained by the network topology and link capacities. In this paper, we study the fundamental upper bound of information dissemination rates with these constraints in undirected networks, given the unique replicable and encodable properties of information flows. Based on recent advances in network coding and classical modeling techniques in flow networks, we provide a natural linear programming formulation of the maximum multicast rate problem. By applying Lagrangian relaxation on the primal and the dual linear programs (LPs), respectively, we derive a) a necessary and sufficient condition characterizing multicast rate feasibility, and b) an efficient and distributed subgradient algorithm for computing the maximum multicast rate. We also extend our discussions to multiple communication sessions, as well as to overlay and ad hoc network models. Both our theoretical and simulation results conclude that, network coding may not be instrumental to achieve better maximum multicast rates in most cases; rather, it facilitates the design of significantly more efficient algorithms to achieve such optimality.", "publicationTitle": "IEEE/ACM Transaction on Networking (TON)", "publisher": "", "place": "", "date": "2006", "volume": "14", "issue": "SI", "section": "", "partNumber": "", "partTitle": "", "pages": "2467-2485", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "", "citationKey": "", "url": "", "accessDate": "2010-07-29T04:50:18Z", "PMID": "", "PMCID": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ACM", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "duality", "type": 1 }, { "tag": "multicast", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network flow", "type": 1 }, { "tag": "steiner tree", "type": 1 }, { "tag": "subgradient optimization", "type": 1 }, { "tag": "undirected networks", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/USJAQWMF" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "TIQI2GXR", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/TIQI2GXR", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/TIQI2GXR", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "MinJi Kim et al.", "parsedDate": "2009", "numChildren": 0 }, "data": { "key": "TIQI2GXR", "version": 1, "itemType": "conferencePaper", "title": "An algebraic watchdog for wireless network coding", "creators": [ { "creatorType": "author", "firstName": "", "lastName": "MinJi Kim" }, { "creatorType": "author", "firstName": "R.", "lastName": "Kotter" }, { "creatorType": "author", "firstName": "M.", "lastName": "Medard" }, { "creatorType": "author", "firstName": "J.", "lastName": "Barros" } ], "abstractNote": "In this paper, we propose a scheme, called the algebraic watchdog for wireless network coding, in which nodes can detect malicious behaviors probabilistically, police their downstream neighbors locally using overheard messages, and, thus, provide a secure global self-checking network. Unlike traditional Byzantine detection protocols which are receiver-based, this protocol gives the senders an active role in checking the node downstream. This work is inspired by Marti et al.'s watchdog-pathrater, which attempts to detect and mitigate the effects of routing misbehavior. As the first building block of a such system, we focus on a two-hop network. We present a graphical model to understand the inference process nodes execute to police their downstream neighbors; as well as to compute, analyze, and approximate the probabilities of misdetection and false detection. In addition, we present an algebraic analysis of the performance using an hypothesis testing framework, that provides exact formulae for probabilities of false detection and misdetection.", "proceedingsTitle": "Proc. of IEEE International Symposium on Information Theory (ISIT)", "conferenceName": "IEEE International Symposium on Information Theory, 2009. ISIT 2009", "publisher": "", "place": "", "date": "2009", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "1159-1163", "series": "", "seriesNumber": "", "DOI": "10.1109/ISIT.2009.5206004", "ISBN": "978-1-4244-4312-3", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "English", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Byzantine detection protocols", "type": 1 }, { "tag": "Communication system traffic control", "type": 1 }, { "tag": "Cryptographic protocols", "type": 1 }, { "tag": "Laboratories", "type": 1 }, { "tag": "Monitoring", "type": 1 }, { "tag": "Routing protocols", "type": 1 }, { "tag": "Wireless application protocol", "type": 1 }, { "tag": "Wireless network coding", "type": 1 }, { "tag": "algebraic analysis", "type": 1 }, { "tag": "algebraic watchdog", "type": 1 }, { "tag": "channel coding", "type": 1 }, { "tag": "global self-checking network", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "overheard messages", "type": 1 }, { "tag": "protocols", "type": 1 }, { "tag": "radio networks", "type": 1 }, { "tag": "radio receivers", "type": 1 }, { "tag": "receiver", "type": 1 }, { "tag": "robustness", "type": 1 }, { "tag": "throughput", "type": 1 }, { "tag": "wireless networks", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/X8FVJ8N3" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "QC34XP2F", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/QC34XP2F", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/QC34XP2F", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Shizheng Li and Ramamoorthy", "parsedDate": "2011", "numChildren": 0 }, "data": { "key": "QC34XP2F", "version": 1, "itemType": "journalArticle", "title": "Protection Against Link Errors and Failures Using Network Coding", "creators": [ { "creatorType": "author", "firstName": "", "lastName": "Shizheng Li" }, { "creatorType": "author", "firstName": "A.", "lastName": "Ramamoorthy" } ], "abstractNote": "We propose a network-coding based scheme to protect multiple bidirectional unicast connections against adversarial errors and failures in a network. The network consists of a set of bidirectional primary path connections that carry the uncoded traffic. The end nodes of the bidirectional connections are connected by a set of shared protection paths that provide the redundancy required for protection. Such protection strategies are employed in the domain of optical networks for recovery from failures. In this work we consider the problem of simultaneous protection against adversarial errors and failures. Suppose that ne paths are corrupted by the omniscient adversary. Under our proposed protocol, the errors can be corrected at all the end nodes with 4ne protection paths. More generally, if there are ne adversarial errors and nf failures, 4ne + 2nf protection paths are sufficient. The number of protection paths only depends on the number of errors and failures being protected against and is independent of the number of unicast connections.", "publicationTitle": "IEEE Transactions on Communications", "publisher": "", "place": "", "date": "2011", "volume": "59", "issue": "2", "section": "", "partNumber": "", "partTitle": "", "pages": "518-528", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.1109/TCOMM.2011.120710.090455", "citationKey": "", "url": "", "accessDate": "", "PMID": "", "PMCID": "", "ISSN": "0090-6778", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "English", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "adversarial error", "type": 1 }, { "tag": "adversarial errors", "type": 1 }, { "tag": "link errors", "type": 1 }, { "tag": "link failures", "type": 1 }, { "tag": "multiple bidirectional unicast connections", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network error correction", "type": 1 }, { "tag": "network protection", "type": 1 }, { "tag": "optical fibre networks", "type": 1 }, { "tag": "optical networks", "type": 1 }, { "tag": "protocol", "type": 1 }, { "tag": "protocols", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/E9ND7VGW" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "JUHS8BT8", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/JUHS8BT8", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/JUHS8BT8", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Vilela et al.", "parsedDate": "2008", "numChildren": 0 }, "data": { "key": "JUHS8BT8", "version": 1, "itemType": "conferencePaper", "title": "Lightweight Security for Network Coding", "creators": [ { "creatorType": "author", "firstName": "J. P", "lastName": "Vilela" }, { "creatorType": "author", "firstName": "L.", "lastName": "Lima" }, { "creatorType": "author", "firstName": "J.", "lastName": "Barros" } ], "abstractNote": "Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits the inherent security provided by random linear network coding and offers the advantage of reduced overhead in comparison to traditional end-to-end encryption of the entire data. Confidentiality is achieved by protecting (or \"locking\") the source coefficients required to decode the encoded data, without preventing intermediate nodes from running their standard network coding operations. Our scheme can be easily combined with existing techniques that counter active attacks.", "proceedingsTitle": "Proc. of IEEE International Conference on Communications (ICC)", "conferenceName": "IEEE International Conference on Communications, 2008. ICC '08", "publisher": "", "place": "", "date": "2008", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "1750-1754", "series": "", "seriesNumber": "", "DOI": "10.1109/ICC.2008.336", "ISBN": "978-1-4244-2075-9", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "English", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Communications Society", "type": 1 }, { "tag": "Computer security", "type": 1 }, { "tag": "Data security", "type": 1 }, { "tag": "Peer to peer computing", "type": 1 }, { "tag": "cryptography", "type": 1 }, { "tag": "data flows", "type": 1 }, { "tag": "decoding", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "end-to-end encryption", "type": 1 }, { "tag": "forward packets", "type": 1 }, { "tag": "intermediate nodes", "type": 1 }, { "tag": "lightweight security", "type": 1 }, { "tag": "low-complexity cryptographic scheme", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "protection", "type": 1 }, { "tag": "protocols", "type": 1 }, { "tag": "random linear network coding", "type": 1 }, { "tag": "robustness", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/VZASHE62" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "9TBT6EFT", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/9TBT6EFT", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/9TBT6EFT", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Cai and Yeung", "parsedDate": "2002", "numChildren": 0 }, "data": { "key": "9TBT6EFT", "version": 1, "itemType": "conferencePaper", "title": "Secure network coding", "creators": [ { "creatorType": "author", "firstName": "Ning", "lastName": "Cai" }, { "creatorType": "author", "firstName": "R.W.", "lastName": "Yeung" } ], "abstractNote": "Recent work on network coding renders a new view on multicasting in a network. In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. The usual function of switching at a node is a special case of network coding. The advantage of network coding is that the full capacity of the network can be utilized. In this paper, we propose a new model which incorporates network coding and information security. Specifically, a collection of subsets of links is given, and a wiretapper is allowed to access any one (but not more than one) of these subsets without being able to obtain any information about the message transmitted. Our model includes secret sharing as a special case. We present a construction of secure linear network codes provided a certain graph-theoretic sufficient condition is satisfied.", "proceedingsTitle": "Proc. of IEEE International Symposium on Information Theory (ISIT)", "conferenceName": "IEEE International Symposium on Information Theory (ISIT) 2002", "publisher": "", "place": "", "date": "2002", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "323", "series": "", "seriesNumber": "", "DOI": "10.1109/ISIT.2002.1023595", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "IEEE Xplore", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "acyclic directed graph", "type": 1 }, { "tag": "cryptography", "type": 1 }, { "tag": "directed graphs", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "graph-theoretic sufficient condition", "type": 1 }, { "tag": "information security", "type": 1 }, { "tag": "linear codes", "type": 1 }, { "tag": "multicasting", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "secret sharing", "type": 1 }, { "tag": "secure linear network codes", "type": 1 }, { "tag": "wiretapper", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/T6SP4TEW" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "M9W6AIFR", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/M9W6AIFR", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/M9W6AIFR", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Park", "parsedDate": "2004", "numChildren": 0 }, "data": { "key": "M9W6AIFR", "version": 1, "itemType": "journalArticle", "title": "Authentication protocol providing user anonymity and untraceability in wireless mobile communication systems", "creators": [ { "creatorType": "author", "firstName": "Chang-Seop", "lastName": "Park" } ], "abstractNote": "A method of integrating user authentication with anonymity and untraceability is presented based on the secret-key certificate and the algebraic structure of error-correcting codes. Authentication protocol proposed here provides a means for the authentication server to avoid the requirement of maintaining a secure database of user secrets. Especially, since the proposed protocol uses a symmetric-key cryptography and eliminates the key management problem, it is efficient and convenient for both the hardware-limited users and the authentication server.", "publicationTitle": "Computer Networks", "publisher": "", "place": "", "date": "二月 5, 2004", "volume": "44", "issue": "2", "section": "", "partNumber": "", "partTitle": "", "pages": "267-273", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.1016/j.comnet.2003.09.001", "citationKey": "", "url": "", "accessDate": "2012-06-25T09:29:01Z", "PMID": "", "PMCID": "", "ISSN": "1389-1286", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Error-correcting codes", "type": 1 }, { "tag": "Wireless", "type": 1 }, { "tag": "anonymity", "type": 1 }, { "tag": "authentication", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/RXTTAJVP" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "MHNIAVGA", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/MHNIAVGA", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/MHNIAVGA", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Kamal", "parsedDate": "2006", "numChildren": 0 }, "data": { "key": "MHNIAVGA", "version": 1, "itemType": "conferencePaper", "title": "1+N Protection in Mesh Networks Using Network Coding over p-Cycles", "creators": [ { "creatorType": "author", "firstName": "A.E.", "lastName": "Kamal" } ], "abstractNote": "p-Cycles have been proposed for pre-provisioned 1:N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the rerouting of traffic can be a time consuming operation. Another survivable mode of operation is the 1+1 protection mode, in which a signal is transmitted on two link disjoint circuits, and the destination chooses the strongest of the two signals, hence recovery from failures is instantaneous. The disadvantage is the large number of protection circuits. In this paper we introduce a new concept in protection: 1+N protection, in which a p-Cycle can be used to protect a number of bidirectional connections. Data from different circuits are combined using network coding, which can be implemented in a number of technologies. The maximum outage time under this protection scheme is limited to no more than twice the p-Cycle propagation delay.", "proceedingsTitle": "Proc. of IEEE Global Telecommunications Conference (GLOBECOM)", "conferenceName": "IEEE Global Telecommunications Conference, 2006. GLOBECOM '06", "publisher": "", "place": "", "date": "2006", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "1 -6", "series": "", "seriesNumber": "", "DOI": "10.1109/GLOCOM.2006.378", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "OPN04-3", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "bidirectional connection", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "failure detection", "type": 1 }, { "tag": "link disjoint circuit", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "optical fibre networks", "type": 1 }, { "tag": "optical mesh networks", "type": 1 }, { "tag": "p-Cycle propagation delay", "type": 1 }, { "tag": "pre-provisioned protection", "type": 1 }, { "tag": "protection circuits", "type": 1 }, { "tag": "signal transmission", "type": 1 }, { "tag": "survivable mode", "type": 1 }, { "tag": "telecommunication network reliability", "type": 1 }, { "tag": "telecommunication network routing", "type": 1 }, { "tag": "telecommunication traffic", "type": 1 }, { "tag": "traffic rerouting", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/K9HT8NQX" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "UWK4TIH2", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/UWK4TIH2", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/UWK4TIH2", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Dai et al.", "parsedDate": "2011", "numChildren": 0 }, "data": { "key": "UWK4TIH2", "version": 1, "itemType": "conferencePaper", "title": "Network coding-based 1+N protection scheme in hybrid wireless-optical broadband access networks", "creators": [ { "creatorType": "author", "firstName": "Shifang", "lastName": "Dai" }, { "creatorType": "author", "firstName": "Jin", "lastName": "Wang" }, { "creatorType": "author", "firstName": "Xinming", "lastName": "Zhang" }, { "creatorType": "author", "firstName": "Shiliang", "lastName": "Li" } ], "abstractNote": "In the past decade, network protection which provides resilience against link/node failures has been well studied. Recently, 1+N protection based on network coding has proposed in wireless networks and optical networks respectively to balance the tradeoff between resource utilization and recovery delay, where the receiver can recover the packets from N sources on the fly when there is a single link failure on the paths from N sources to the receiver. This paper will consider 1+N protection in hybrid wireless-optical broadband access networks. We prove that the OLT can recover the N data units even if one of the N+1 combinations is lost, if and only if, any subset of nodes in sources set of size k is connected to at least k + 1 edge-disjoint paths to ONUs, for all values of k, 1 #x2264; k #x2264; N. We also present a network coding scheme of 1 + N protection in this paper. This paper also points out that our scheme can be used in a more general topology compared with the 1 + N protection scheme used in wireless networks, which is restricted to require that any k clients must be connected to at least k+1 routers in wireless networks. The simulation results show that our solution can achieve higher network throughput than applying the solution used in wireless networks directly in hybrid wireless-optical broadband access networks.", "proceedingsTitle": "Proc. of 6th International ICST Conference on Communications and Networking in China (CHINACOM)", "conferenceName": "2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)", "publisher": "", "place": "", "date": "2011", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "1013 -1020", "series": "", "seriesNumber": "", "DOI": "10.1109/ChinaCom.2011.6158305", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "1+N protection scheme", "type": 1 }, { "tag": "broadband networks", "type": 1 }, { "tag": "hybrid wireless-optical broadband access networks", "type": 1 }, { "tag": "k+1 edge-disjoint paths", "type": 1 }, { "tag": "k+1 routers", "type": 1 }, { "tag": "link-node failures", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network coding scheme", "type": 1 }, { "tag": "network protection", "type": 1 }, { "tag": "network throughput", "type": 1 }, { "tag": "optical fibre subscriber loops", "type": 1 }, { "tag": "receiver", "type": 1 }, { "tag": "resource recovery delay", "type": 1 }, { "tag": "resource utilization", "type": 1 }, { "tag": "telecommunication network reliability", "type": 1 }, { "tag": "telecommunication network routing", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/R8SGZETG" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "NMMFITTX", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/NMMFITTX", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/NMMFITTX", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Al-Kofahi and Kamal", "parsedDate": "2009-06", "numChildren": 0 }, "data": { "key": "NMMFITTX", "version": 1, "itemType": "journalArticle", "title": "Network coding-based protection of many-to-one wireless flows", "creators": [ { "creatorType": "author", "firstName": "O.M.", "lastName": "Al-Kofahi" }, { "creatorType": "author", "firstName": "A.", "lastName": "Kamal" } ], "abstractNote": "This paper addresses the problem of survivability of many-to-one flows in wireless networks, such as wireless mesh networks (WMNs) and wireless sensor networks (WSNs). Traditional protection schemes are either resource-hungry like the (1+1) protection scheme, or introduce a delay and interrupt the network operation like the (1 : N) protection scheme. In this paper, we present a network coding-based protection technique that overcomes the deficiencies of the traditional schemes. We derive and prove the necessary and sufficient conditions for our solution on a restricted network topology. Then we relax these connectivity requirements and show how to generalize the sufficient and necessary conditions to work with any other topology. We also show how to perform deterministic coding with 0,1 coefficients to achieve linear independence. Moreover, we discuss some of the practical considerations related to our approach. Specifically, we show how to adapt our solution when the network has a limited min-cut; we therefore define a more general problem that takes this constraint into account, which prove to be NP-complete. Furthermore, we discuss the decoding process at the sink, and show how to make use of our solution in the upstream communication (from sink to sources). We also study the effect of the proposed scheme on network performance. Finally, we consider the implementation of our approach when all network nodes have single transceivers, and we solve the problem through a greedy algorithm that constructs a feasible schedule for the transmissions from the sources.", "publicationTitle": "IEEE Journal on Selected Areas in Communications", "publisher": "", "place": "", "date": "june 2009", "volume": "27", "issue": "5", "section": "", "partNumber": "", "partTitle": "", "pages": "797-813", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.1109/JSAC.2009.090619", "citationKey": "", "url": "", "accessDate": "", "PMID": "", "PMCID": "", "ISSN": "0733-8716", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "greedy algorithm", "type": 1 }, { "tag": "greedy algorithms", "type": 1 }, { "tag": "many-to-one wireless flows", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network topology", "type": 1 }, { "tag": "radio networks", "type": 1 }, { "tag": "single transceivers", "type": 1 }, { "tag": "telecommunication network topology", "type": 1 }, { "tag": "upstream communication", "type": 1 }, { "tag": "wireless mesh networks", "type": 1 }, { "tag": "wireless networks", "type": 1 }, { "tag": "wireless sensor networks", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/XEVFEWTS" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "QJW2A4KC", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/QJW2A4KC", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/QJW2A4KC", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Aly et al.", "parsedDate": "2012", "numChildren": 0 }, "data": { "key": "QJW2A4KC", "version": 1, "itemType": "journalArticle", "title": "Network protection codes: Providing self-healing in autonomic networks using network coding", "creators": [ { "creatorType": "author", "firstName": "Salah A.", "lastName": "Aly" }, { "creatorType": "author", "firstName": "Ahmed E.", "lastName": "Kamal" }, { "creatorType": "author", "firstName": "Osameh M.", "lastName": "Al-Kofahi" } ], "abstractNote": "Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must be done with the least amount of protection resources, while using simple management plane functionalities. Recently, network coding has been proposed as a solution to provide agile and cost efficient self-healing against link failures, in a manner that does not require data rerouting, packet retransmission, or failure localization, hence leading to simple control and management planes. To achieve this, separate paths have to be provisioned to carry encoded packets, hence requiring either the addition of extra links, or reserving some of the resources for this purpose.\n\nIn this paper we introduce self-healing strategies for autonomic networks in order to protect against link failures. The strategies are based on network coding and reduced capacity, which is a technique that we call network protection codes (NPC). In these strategies, an autonomic network is able to provide self-healing from various network failures affecting network operation. Also, network protection codes are extended to provide self-healing from multiple link failures in autonomic networks. Although this leads to reducing the network capacity, the network capacity reduction is asymptotically small in most cases of practical interest. We provide implementation aspects of the proposed strategies, derive bounds and show how to construct network protection code. The paper also develops an Integer Linear Program formulation to evaluate the cost of provisioning connections using the proposed strategies, and uses results from this formulation to show that it is more resource efficient than 1 + 1 protection. A simulation study to evaluate the recovery times, and the buffering requirements due to network coding is also conducted using the OPNET simulator.", "publicationTitle": "Computer Networks", "publisher": "", "place": "", "date": "一月 12, 2012", "volume": "56", "issue": "1", "section": "", "partNumber": "", "partTitle": "", "pages": "99-111", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.1016/j.comnet.2011.08.013", "citationKey": "", "url": "", "accessDate": "2012-07-27T09:45:41Z", "PMID": "", "PMCID": "", "ISSN": "1389-1286", "archive": "", "archiveLocation": "", "shortTitle": "Network protection codes", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Autonomic networks", "type": 1 }, { "tag": "Self-healing", "type": 1 }, { "tag": "code construction", "type": 1 }, { "tag": "link failures", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network protection codes", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/D2FIHK4D" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "NJ8KJV5J", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/NJ8KJV5J", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/NJ8KJV5J", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Aly et al.", "parsedDate": "2010-01", "numChildren": 0 }, "data": { "key": "NJ8KJV5J", "version": 1, "itemType": "conferencePaper", "title": "Network protection design using network coding", "creators": [ { "creatorType": "author", "firstName": "S.A.", "lastName": "Aly" }, { "creatorType": "author", "firstName": "A.E.", "lastName": "Kamal" }, { "creatorType": "author", "firstName": "A.I.", "lastName": "Walid" } ], "abstractNote": "Link and node failures are two common fundamental problems that affect operational networks. Hence, protection of communication networks against such failures is essential for maintaining network reliability and performance. Network protection codes (NPC) are proposed to protect operational networks against link and node failures. Furthermore, encoding and decoding operations of such codes are well developed over binary and finite fields. Finding network topologies, practical scenarios, and limits on graphs applicable for NPC are of interest. In this paper, we establish limits on network protection design. We investigate several network graphs where NPC can be deployed using network coding. Furthermore, we construct graphs with minimum number of edges suitable for network protection codes deployment.", "proceedingsTitle": "2010 IEEE Information Theory Workshop (ITW)", "conferenceName": "2010 IEEE Information Theory Workshop (ITW)", "publisher": "", "place": "", "date": "jan. 2010", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "1 -5", "series": "", "seriesNumber": "", "DOI": "10.1109/ITWKSPS.2010.5503204", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "graph theory", "type": 1 }, { "tag": "link failures", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network performance", "type": 1 }, { "tag": "network protection codes", "type": 1 }, { "tag": "network protection design", "type": 1 }, { "tag": "network reliability", "type": 1 }, { "tag": "network topologies", "type": 1 }, { "tag": "node failures", "type": 1 }, { "tag": "telecommunication network reliability", "type": 1 }, { "tag": "telecommunication network topology", "type": 1 }, { "tag": "telecommunication security", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/FAM9QEER" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "HR2TSAJF", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/HR2TSAJF", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/HR2TSAJF", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Jin Wang et al.", "parsedDate": "2011-04-10", "numChildren": 0 }, "data": { "key": "HR2TSAJF", "version": 1, "itemType": "conferencePaper", "title": "Optimal Design of Linear Network Coding for information theoretically secure unicast", "creators": [ { "creatorType": "author", "firstName": "", "lastName": "Jin Wang" }, { "creatorType": "author", "firstName": "", "lastName": "Jianping Wang" }, { "creatorType": "author", "firstName": "", "lastName": "Kejie Lu" }, { "creatorType": "author", "firstName": "", "lastName": "Yi Qian" }, { "creatorType": "author", "firstName": "", "lastName": "Bin Xiao" }, { "creatorType": "author", "firstName": "", "lastName": "Naijie Gu" } ], "abstractNote": "In this paper, we study the optimal design of linear network coding (LNC) for secure unicast against passive attacks, under the requirement of information theoretical security (ITS). The objectives of our optimal LNC design include (1) satisfying the ITS requirement, (2) maximizing the transmission rate of a unicast stream, and (3) minimizing the number of additional random symbols. We first formulate the problem that maximizes the secure transmission rate under the requirement of ITS, which is then transformed to a constrained maximum network flow problem.We devise an efficient algorithm that can find the optimal transmission topology. Based on the transmission topology, we then design a deterministic LNC which satisfies the aforementioned objectives and provide a constructive upper bound of the size of the finite field. In addition, we also study the potential of random LNC and derive the low bound of the probability that a random LNC is information theoretically secure.", "proceedingsTitle": "Proc. of the 30th Conference on Computer Communications (INFOCOM)", "conferenceName": "2011 Proceedings IEEE INFOCOM", "publisher": "", "place": "", "date": "10-15 April 2011", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "757-765", "series": "", "seriesNumber": "", "DOI": "", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Topology", "type": 1 }, { "tag": "Unicast", "type": 1 }, { "tag": "Vectors", "type": 1 }, { "tag": "constrained maximum network flow problem", "type": 1 }, { "tag": "data communication", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "information theoretical security", "type": 1 }, { "tag": "information theoretically secure unicast", "type": 1 }, { "tag": "linear network coding", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network topology", "type": 1 }, { "tag": "optimal design", "type": 1 }, { "tag": "optimal transmission topology", "type": 1 }, { "tag": "secure transmission rate", "type": 1 }, { "tag": "security", "type": 1 }, { "tag": "security of data", "type": 1 }, { "tag": "telecommunication network topology", "type": 1 }, { "tag": "telecommunication security", "type": 1 }, { "tag": "unicast stream", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/I5EF72TW" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "3V2VEQIV", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/3V2VEQIV", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/3V2VEQIV", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Zongpeng Li et al.", "parsedDate": "2005", "numChildren": 0 }, "data": { "key": "3V2VEQIV", "version": 1, "itemType": "conferencePaper", "title": "On achieving optimal throughput with network coding", "creators": [ { "creatorType": "author", "firstName": "", "lastName": "Zongpeng Li" }, { "creatorType": "author", "firstName": "", "lastName": "Baochun Li" }, { "creatorType": "author", "firstName": "", "lastName": "Dan Jiang" }, { "creatorType": "author", "firstName": "", "lastName": "Lap Chi Lau" } ], "abstractNote": "With the constraints of network topologies and link capacities, achieving the optimal end-to-end throughput in data networks has been known as a fundamental but computationally hard problem. In this paper, we seek efficient solutions to the problem of achieving optimal throughput in data networks, with single or multiple unicast, multicast and broadcast sessions. Although previous approaches lead to solving NP-complete problems, we show the surprising result that, facilitated by the recent advances of network coding, computing the strategies to achieve the optimal end-to-end throughput can be performed in polynomial time. This result holds for one or more communication sessions, as well as in the overlay network model. Supported by empirical studies, we present the surprising observation that in most topologies, applying network coding may not improve the achievable optimal throughput; rather, it facilitates the design of significantly more efficient algorithms to achieve such optimality.", "proceedingsTitle": "Proc. of the 24th Conference on Computer Communications (INFOCOM)", "conferenceName": "INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE", "publisher": "", "place": "", "date": "2005", "eventPlace": "", "volume": "3", "issue": "", "numberOfVolumes": "", "pages": "2184-2194 vol. 3", "series": "", "seriesNumber": "", "DOI": "10.1109/INFCOM.2005.1498493", "ISBN": "0743-166X", "citationKey": "", "url": "", "accessDate": "2010-09-07T07:45:38Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "NP-complete problems", "type": 1 }, { "tag": "broadcast sessions", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "multicast sessions", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "optimal end-to-end throughput", "type": 1 }, { "tag": "optimal throughput", "type": 1 }, { "tag": "optimisation", "type": 1 }, { "tag": "overlay network model", "type": 1 }, { "tag": "polynomial time", "type": 1 }, { "tag": "telecommunication network topology", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/BANTZDN3" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "SZ6AQXJE", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/SZ6AQXJE", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/SZ6AQXJE", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Ho et al.", "parsedDate": "2006", "numChildren": 0 }, "data": { "key": "SZ6AQXJE", "version": 1, "itemType": "journalArticle", "title": "A Random Linear Network Coding Approach to Multicast", "creators": [ { "creatorType": "author", "firstName": "T.", "lastName": "Ho" }, { "creatorType": "author", "firstName": "M.", "lastName": "Medard" }, { "creatorType": "author", "firstName": "R.", "lastName": "Koetter" }, { "creatorType": "author", "firstName": "D.R.", "lastName": "Karger" }, { "creatorType": "author", "firstName": "M.", "lastName": "Effros" }, { "creatorType": "author", "firstName": "Jun", "lastName": "Shi" }, { "creatorType": "author", "firstName": "B.", "lastName": "Leong" } ], "abstractNote": "We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. We show that this achieves capacity with probability exponentially approaching 1 with the code length. We also demonstrate that random linear coding performs compression when necessary in a network, generalizing error exponents for linear Slepian-Wolf coding in a natural way. Benefits of this approach are decentralized operation and robustness to network changes or link failures. We show that this approach can take advantage of redundant network capacity for improved success probability and robustness. We illustrate some potential advantages of random linear network coding over routing in two examples of practical scenarios: distributed network operation and networks with dynamically varying connections. Our derivation of these results also yields a new bound on required field size for centralized network coding on general multicast networks", "publicationTitle": "IEEE Transactions on Information Theory", "publisher": "", "place": "", "date": "2006", "volume": "52", "issue": "10", "section": "", "partNumber": "", "partTitle": "", "pages": "4413-4430", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "IEEE Transactions on Information Theory", "DOI": "10.1109/TIT.2006.881746", "citationKey": "", "url": "", "accessDate": "", "PMID": "", "PMCID": "", "ISSN": "0018-9448", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Distributed compression", "type": 1 }, { "tag": "Slepian-Wolf coding", "type": 1 }, { "tag": "data communication", "type": 1 }, { "tag": "decentralized operation", "type": 1 }, { "tag": "distributed network coding approach", "type": 1 }, { "tag": "distributed networking", "type": 1 }, { "tag": "information compression", "type": 1 }, { "tag": "information transmission", "type": 1 }, { "tag": "linear codes", "type": 1 }, { "tag": "multicast", "type": 1 }, { "tag": "multicast communication", "type": 1 }, { "tag": "multisource multicast network", "type": 1 }, { "tag": "network capacity", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network routing", "type": 1 }, { "tag": "probability", "type": 1 }, { "tag": "random codes", "type": 1 }, { "tag": "random linear coding", "type": 1 }, { "tag": "source coding", "type": 1 }, { "tag": "telecommunication network routing", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/F8GPFPVE" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } }, { "key": "FTQX3P9T", "version": 1, "library": { "type": "group", "id": 5297, "name": "Reading list", "links": { "alternate": { "href": "https://www.zotero.org/groups/reading_list", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/5297/items/FTQX3P9T", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/reading_list/items/FTQX3P9T", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "R. Koetter and M. Medard", "parsedDate": "2003", "numChildren": 0 }, "data": { "key": "FTQX3P9T", "version": 1, "itemType": "journalArticle", "title": "An algebraic approach to network coding", "creators": [ { "creatorType": "author", "name": "R. Koetter" }, { "creatorType": "author", "name": "M. Medard" } ], "abstractNote": "We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al.(see Proc. 2001 IEEE Int. Symp. Information Theory, p.102), who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary networks and robust networking. For networks which are restricted to using linear network codes, we find necessary and sufficient conditions for the feasibility of any given set of connections over a given network. We also consider the problem of network recovery for nonergodic link failures. For the multicast setup we prove that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question. The results are derived for both delay-free networks and networks with delays.", "publicationTitle": "IEEE/ACM Transactions on Networking", "publisher": "", "place": "", "date": "2003", "volume": "11", "issue": "5", "section": "", "partNumber": "", "partTitle": "", "pages": "782-795", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "IEEE/ACM Transactions on Networking", "DOI": "10.1109/TNET.2003.818197", "citationKey": "", "url": "", "accessDate": "", "PMID": "", "PMCID": "", "ISSN": "1063-6692", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "algebraic approach", "type": 1 }, { "tag": "algebraic codes", "type": 1 }, { "tag": "algebraic coding", "type": 1 }, { "tag": "channel capacity", "type": 1 }, { "tag": "delay-free networks", "type": 1 }, { "tag": "delays", "type": 1 }, { "tag": "failure pattern", "type": 1 }, { "tag": "linear codes", "type": 1 }, { "tag": "matrix algebra", "type": 1 }, { "tag": "multicast communication", "type": 1 }, { "tag": "multicast networks", "type": 1 }, { "tag": "multicast setup", "type": 1 }, { "tag": "necessary conditions", "type": 1 }, { "tag": "network capacity", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network delay", "type": 1 }, { "tag": "network information theory", "type": 1 }, { "tag": "network recovery", "type": 1 }, { "tag": "nonergodic link failures", "type": 1 }, { "tag": "robust networking", "type": 1 }, { "tag": "sufficient conditions", "type": 1 }, { "tag": "telecommunication network reliability", "type": 1 }, { "tag": "transfer matrices", "type": 1 }, { "tag": "using linear network codes", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/QKT9EV8F" }, "dateAdded": "2012-10-21T13:32:13Z", "dateModified": "2012-10-21T13:46:09Z" } } ]