2014 IEEE 22nd International Conference on Network Protocols最新文献_第2页

Scalable Data Access Control in RFID-Enabled Supply Chain rfid供应链中可扩展的数据访问控制

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.28

Saiyu Qi, Yuanqing Zheng, Mo Li, Yunhao Liu, Jinli Qiu

{"title":"Scalable Data Access Control in RFID-Enabled Supply Chain","authors":"Saiyu Qi, Yuanqing Zheng, Mo Li, Yunhao Liu, Jinli Qiu","doi":"10.1109/ICNP.2014.28","DOIUrl":"https://doi.org/10.1109/ICNP.2014.28","url":null,"abstract":"By attaching RFID tags to products, supply chain participants can identify products and create product data to record the product particulars in transit. Participants along the supply chain share their product data to enable information exchange and support critical decisions in production operations. Such an information sharing essentially requires a data access control mechanism when the product data relates to sensitive business issues. However, existing access control solutions are ill suited to the RFID-enabled supply chain, as they are not scalable in handling a huge number of tags, introduce vulnerability to the product data, and performs poorly to support privilege revocation of product data. We present a new scalable data access control system that addresses these limitations. Our system provides an item-level data access control mechanism that defines and enforces access policies based on both the participants' role attribute and the products' RFID tag attribute. Our system further provides an item-level privilege revocation mechanism by allowing the participants to delegate encryption updates in revocation operation without disclosing the underlying data contents. We design a new updatable encryption scheme and integrate it with Cipher text Policy-Attribute Based Encryption (CP-ABE) to implement the key components of our system.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124054103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Experimentation of Geometric Information Routing on Content Locators 内容定位器的几何信息路由实验

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.82

Sahel Sahhaf, D. Papadimitriou, W. Tavernier, D. Colle, M. Pickavet

引用次数: 4

Estimating the Persistent Spreads in High-Speed Networks 高速网络中持续传播的估计

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.33

Qingjun Xiao, Yan Qiao, Zhen Mo, Shigang Chen

{"title":"Estimating the Persistent Spreads in High-Speed Networks","authors":"Qingjun Xiao, Yan Qiao, Zhen Mo, Shigang Chen","doi":"10.1109/ICNP.2014.33","DOIUrl":"https://doi.org/10.1109/ICNP.2014.33","url":null,"abstract":"The persistent spread of a destination host is the number of distinct sources that have contacted it persistently in predefined t measurement periods. A persistent spread estimator is a software/hardware component on a router that inspects the arrival packets and estimates the persistent spread of each destination. This is a new primitive for network measurement that can be used to detect long-term stealthy malicious activities, which cannot be recognized by the traditional super spreader detectors that are designed only for \"elephant\" activities. However, the challenge is to function such an estimator in fast but small memory space (such as on-chip SRAM of line cards), in order to keep up with the high speed of switching fabric for packet forwarding. This paper presents an implementation that can use very tight memory space to deliver high estimation accuracy: Its memory expense is less than one bit per flow element in each time period, Its estimation accuracy is over 90% better than a continuous variant of Flajolet-Martin sketches, Its operating range to produce effective measurements is hundreds of times broader than the traditional bitmap. These advantages originate from a new data structure called multi-virtual bitmap, which is designed to estimate the cardinality of the intersection of an arbitrary number of sets. We have verified the effectiveness of our new estimator using the real network traffic traces from CAIDA.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127836380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 32

Routing to Multi-instantiated Destinations: Principles and Applications 路由到多实例化的目的地:原理和应用

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.35

J. Garcia-Luna-Aceves

{"title":"Routing to Multi-instantiated Destinations: Principles and Applications","authors":"J. Garcia-Luna-Aceves","doi":"10.1109/ICNP.2014.35","DOIUrl":"https://doi.org/10.1109/ICNP.2014.35","url":null,"abstract":"Prior solutions for routing to multi-instantiated destinations (e.g., Internet multicasting and any casting, and routing in information centric networks) simply adapt existing routing algorithms designed for single-instance destinations, or rely on flooding techniques. As a result, they are unnecessarily complex and incur excessive overhead. A new approach for routing to multi-instantiated destinations is introduced, and MIDR (Multiple Instance Destination Routing) is presented as an example of the approach. MIDR uses only distance information to multi-instantiated destinations, without routers having to establish overlays, know the network topology, use complete paths to destination instances, or know about all the instances of destinations. MIDR enables routers to maintain multiple loop free routes to the nearest instances of any given destination, as well as to some or all instances of the same destination. It is shown that MIDR provides multiple loop-free paths to destination instances, and that is orders of magnitude more efficient than traditional approaches based on routing to single instance destinations. MIDR can be used in name-based content routing, IP unicast routing, multicasting, and any casting.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129294847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Pay-as-You-Go Pricing and Competition in Congested Network Service Markets 在拥挤的网络服务市场中，即付即用定价和竞争

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.46

Richard T. B. Ma

引用次数: 9

Regulating Monopolistic ISPS without Neutrality 无中立性监管垄断性互联网服务提供商

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.61

Jing Tang, Richard T. B. Ma

{"title":"Regulating Monopolistic ISPS without Neutrality","authors":"Jing Tang, Richard T. B. Ma","doi":"10.1109/ICNP.2014.61","DOIUrl":"https://doi.org/10.1109/ICNP.2014.61","url":null,"abstract":"Net neutrality has been heavily debated as a potential Internet regulation. Advocates have expressed concerns about the pricing power of ISPs, which might be used to discriminate Content Providers (CPs), and consequently destroy innovations at the edge of the Internet and hurt the user welfare. However, without service differentiation, ISPs do not have incentives to expand infrastructure capacities and provide quality of services, which will eventually impair the future Internet. Although competition among ISPs would alleviate the problem and reduce the need for regulations, the problem is more severe in monopolistic markets. We study the service differentiation offered by a monopolistic ISP and find that its profit-optimal strategy makes an ordinary service \"damaged good\", which hurts the welfare of CPs. Instead of imposing net neutrality regulations, we propose a flexible and lenient policy framework that generalizes net neutrality regulations. We find that a stringent regulation is needed when 1) the ISP's capacity is abundant, 2) the profit distribution of CPs is concentrated, or 3) the utility of CPs and their users are not positively correlated. We believe that by allowing the ISPs to differentiate services under a well designed policy constraint, the utility of the Internet ecosystem could be greatly improved.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114123712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 17

Analysis of Topology Algorithms for Commercial Airborne Networks 商用机载网络拓扑算法分析

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.60

Ben Newton, Jay Aikat, K. Jeffay

{"title":"Analysis of Topology Algorithms for Commercial Airborne Networks","authors":"Ben Newton, Jay Aikat, K. Jeffay","doi":"10.1109/ICNP.2014.60","DOIUrl":"https://doi.org/10.1109/ICNP.2014.60","url":null,"abstract":"Civilian Airborne Networks capable of providing network connectivity to users onboard aircraft and users on the ground may soon be viable. We propose a novel airborne network architecture consisting of commercial aircraft and ground station gateways inter-connected with Free-Space Optical Communications (FSOC) links to form a high-bandwidth mesh network. The use of directional FSOC links necessitates explicit topology control, where a protocol must manage which links will point at one another to form connections. The algorithm used by the topology control protocol to form topologies must have low computation time, and must compute topologies that are robust, inclusive, and contain short paths between nodes. We use FAA flight path data for the aircraft en route within the continental United States during a 24-hour period to analyze the properties of airborne mesh networks, and compare candidate topology algorithms. In our simulation an airborne network with ground stations was able to continuously connect over 98% of the air-craft into a mesh network using FSOC links. We propose two new topology algorithms (DCTRT and DCKruskal+Long) which are extensions to existing algorithms. DCKruskal+Long appears to perform best for the metrics measured.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125168930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

Reflections on Security Options for the Real-Time Transport Protocol Framework 对实时传输协议框架安全选项的思考

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.102

C. Perkins

引用次数: 0

Circular Pipelining: Minimizing Round-Trip Delay in Low-Duty-Cycle Wireless Networks 循环管道:最小化低占空比无线网络的往返延迟

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.65

Jia Li, S. Kim, T. He

{"title":"Circular Pipelining: Minimizing Round-Trip Delay in Low-Duty-Cycle Wireless Networks","authors":"Jia Li, S. Kim, T. He","doi":"10.1109/ICNP.2014.65","DOIUrl":"https://doi.org/10.1109/ICNP.2014.65","url":null,"abstract":"In wireless networks, duty-cycling operations have been widely used to reduce the energy cost of RF idle listening at wireless receivers. Such operations, however, introduce delays in data forwarding because a sender has to wait for a targeted receiver to wake up. To reduce end-to-end delivery delays, researchers have proposed scheduling techniques [1], [2], [3] to wake up nodes along the data forwarding path at the right moment. However, these techniques consider only one-way delivery from a sink to nodes (or vice versa), failing to optimally support round-trip network operations such as (i) query and response, (ii) command and control and (iii) data fetching. In this work, we interestingly reveal that the optimal roundtrip delay in a low-duty-cycle network depends only on (i) duty cycle period and (ii) the number of 2-connected network components between the source and destination nodes. We prove that optimality in the round-trip delay can be achieved by establishing a simple circular path and its related cords, in which nodes are assigned wake-up slots in an ascending order in each network component, and connecting these paths into a circular pipeline. We compared our Circular Pipelining (CP) algorithm with the state-of-art solutions [3], and the experimental results show that without using circular forwarding, existing solutions have a round-trip delay proportional to the network diameter, while CP remains a minimal constant delay of T as long as the network is 2-connected. We also implement the Circular Pipelining (CP) algorithm in a test bed consisting of 30 MICAz nodes, achieving significant delay reduction compared to three baseline solutions in the literature.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131863555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Multipath Routing from a Traffic Engineering Perspective: How Beneficial Is It? 从流量工程的角度看多路径路由:它有多有益?

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.34

Xuan Liu, S. Mohanraj, M. Pióro, D. Medhi

{"title":"Multipath Routing from a Traffic Engineering Perspective: How Beneficial Is It?","authors":"Xuan Liu, S. Mohanraj, M. Pióro, D. Medhi","doi":"10.1109/ICNP.2014.34","DOIUrl":"https://doi.org/10.1109/ICNP.2014.34","url":null,"abstract":"Multipath routing gives traffic demands an opportunity to use multiple paths through a network. In a single-demand situation, its benefits are easy to see. In a multi-commodity case, when potentially all node-pairs (demands) generate traffic, they compete for the same network resources. In this work, we consider multipath routing in communication networks in a multi-commodity setting from a traffic engineering perspective. Based on a result from linear programming, we show that at an optimal solution, the number of demands that can have multiple paths with nonzero flows is of the order of the number of network links for three commonly used traffic engineering objectives. We introduce a multipath measure (MPM) and show that under certain traffic conditions and topological structures, the MPM is zero or close to zero, i.e., Multipath routing provides little or limited gain compared to single-path routing. For the all-pair traffic case, multipath routing is observed to be advantageous for small networks. When the number of nodes is about 25 or higher and all node pairs have traffic, this advantage drops as the number of nodes in a network increases. For the fat-tree data center topology, the benefit of multipath routing also drops as the number of pods increases. Our findings are somewhat against a common belief (expressed by the term \"load sharing\") that multipath routing is significantly better in effective distribution of traffic over the network resources.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117277287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 43