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

Multi-path TCP: Boosting Fairness in Cellular Networks 多路径TCP:提高蜂窝网络的公平性

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

Ashwin Sridharan, R. Sinha, R. Jana, B. Han, K. Ramakrishnan, N. K. Shankaranarayanan, Ioannis Broustis

{"title":"Multi-path TCP: Boosting Fairness in Cellular Networks","authors":"Ashwin Sridharan, R. Sinha, R. Jana, B. Han, K. Ramakrishnan, N. K. Shankaranarayanan, Ioannis Broustis","doi":"10.1109/ICNP.2014.48","DOIUrl":"https://doi.org/10.1109/ICNP.2014.48","url":null,"abstract":"Cellular providers are rapidly deploying multiple technologies like cell biasing, carrier aggregation, co-ordinated interference control/scheduling to improve capacity and coverage. In this paper, we explore a complementary transport layer approach based on multipath TCP that can concurrently use multiple interfaces to boost throughput of users with poor coverage and improve fairness. Multipath TCP has been recently standardized by IETF and requires no modifications to applications. It has been shown to improve fairness and throughput in wire line environments and individual user throughputs in wireless networks. However, in a wireless multi-user environment, it is not clear that it is always beneficial, as we show in this paper. Therefore, we examine if it is indeed beneficial for a service provider to judiciously decide whether to enable multiple cellular interfaces on a smart phone based on a global centralized view of its network. Alternatively, should a device decide independently based only on a local view? To quantify the network wide impact in a system where users have multiple cellular interfaces, we have developed centralized and distributed heuristic algorithms to evaluate this, particularly in the context of fairness across all the users. Our simulations and numerical models show that there are potential gains in fairness (15-30%) to be realized by judiciously enabling multipath connections at the cell edge. These gains diminish as the number of users in a cell increases or users behave greedily. We also quantify the delicate balance between throughput and fairness. Our analysis provides an intuition on which user(s) in a cellular network stand to benefit the most by enabling multiple interfaces. We also discuss LTE protocol mechanisms to enforce associations of specific interfaces to specific cells.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"22 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":"121042480","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

Delegated Authenticated Authorization for Constrained Environments 受约束环境的委托身份验证授权

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

Stefanie Gerdes, O. Bergmann, C. Bormann

引用次数: 12

OperationCheckpoint: SDN Application Control OperationCheckpoint: SDN应用控制

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

Sandra Scott-Hayward, Christopher Kane, S. Sezer

引用次数: 72

Fast Counting the Key Tags in Anonymous RFID Systems 匿名RFID系统中关键标签的快速计数

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

Xiulong Liu, Keqiu Li, Heng Qi, Bin Xiao, Xin Xie

{"title":"Fast Counting the Key Tags in Anonymous RFID Systems","authors":"Xiulong Liu, Keqiu Li, Heng Qi, Bin Xiao, Xin Xie","doi":"10.1109/ICNP.2014.27","DOIUrl":"https://doi.org/10.1109/ICNP.2014.27","url":null,"abstract":"In RFID-enabled applications, we may pay more attention to key tags instead of all tags. This paper studies the problem of key tag counting, which aims at estimating how many key tags in a given set exist in the current RFID system. Previous work is slow to solve this new problem because of the serious interference replies from the large number of ordinary (i.e., Nonkey) tags. However, time-efficiency is an important metric for the fast tag cardinality estimation in a large-scale RFID system. In this paper, we propose a singleton slot-based estimator, which is time-efficient because the RFID reader only needs to observe the status change of expected singleton slots of key tags instead of the whole time frame. In practice, the ratio of key tags to all current tags is small for \"key\" members should be rare. As a result, even when the whole time frame is long, the expected singleton slot number is limited and the running of our protocol is fast to achieve estimation accuracy. Rigorous theoretical analysis shows that the proposed protocol can provide guaranteed estimation accuracy to end users. We conduct simulations and implement a prototype of our protocol to verify its efficiency and deployability.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"48 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":"116743411","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}

引用次数: 25

Fair Pricing in the Sky: Truthful Frequency Allocation with Dynamic Spectrum Supply 天空中的公平定价:动态频谱供应下的真实频率分配

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

Qihang Sun, Qian Wang, K. Ren, X. Jia

{"title":"Fair Pricing in the Sky: Truthful Frequency Allocation with Dynamic Spectrum Supply","authors":"Qihang Sun, Qian Wang, K. Ren, X. Jia","doi":"10.1109/ICNP.2014.45","DOIUrl":"https://doi.org/10.1109/ICNP.2014.45","url":null,"abstract":"Spectrum auctions, which allow a spectrum owner to sell licenses for signal transmission over specific bands, can allocate scarce spectrum resources quickly to the users that value them most and have received a great deal of research attention in recent years. While enabling reusability-driven spectrum allocation, truthful spectrum auction designs are also expected to provide price fairness for homogeneous channels, online auction with unknown and dynamic spectrum supplies, and bounded system performance. Existing works, however, lack of such designs due to the inherent technically challenging nature. In this paper, we study the problem of allocating channels to spectrum users with homogeneous/heterogenous demands in a setting where idle channels are arriving dynamically, with the goal of maximizing social welfare. Taking spectrum reusability into consideration, we present a suite of novel and efficient spectrum auction algorithms that achieve fair pricing for homogeneous channels, strategy proofness, online spectrum auction with a dynamic supply and a log approximation to the optimal social welfare. To the best of our knowledge, we are the first to design truthful spectrum auctions enabling fair payments for homogenous channels and spectrum reusability with dynamic spectrum supply. Experimental results show that our schemes outperform the existing benchmarks by providing almost perfect fairness of pricing for both single- and multi-unit demand spectrum users.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"10 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":"123398404","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

Experience in Implementing & Deploying a Non-IP Routing Protocol VIRO in GENI 实施经验&在GENI中部署非ip路由协议VIRO

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

Braulio Dumba, Guobao Sun, Hesham Mekky, Zhi-Li Zhang

{"title":"Experience in Implementing & Deploying a Non-IP Routing Protocol VIRO in GENI","authors":"Braulio Dumba, Guobao Sun, Hesham Mekky, Zhi-Li Zhang","doi":"10.1109/ICNP.2014.85","DOIUrl":"https://doi.org/10.1109/ICNP.2014.85","url":null,"abstract":"In this paper, we describe our experience in implementing a non-IP routing protocol - Virtual Id Routing (VIRO) - using the OVS-SDN platform in GENI. As a novel, \"plug-&-play\", routing paradigm for future dynamic networks, VIRO decouples routing/forwarding from addressing by introducing a topology-aware, structured virtual id layer to encode the locations of switches and devices in the physical topology for scalable and resilient routing. Despite its general \"match-action\" forwarding function, the existing OVS-SDN platform is closely tied to the conventional Ethernet/IP/TCP header formats, and cannot be directly used to implement the new VIRO routing/forwarding paradigm. As a result, we repurpose the Ethernet MAC address to represent VIRO virtual id, modify and extend the OVS (both within the user space and the kernel space) to implement the VIRO forwarding functions. We also utilize a set of local POX controllers (one per VIRO switch) to emulate the VIRO distributed control plane and one global POX controller to realize the VIRO (centralized) management plane. We evaluate our prototype implementation through the Mininet emulation and GENI deployment test and discuss some lessons learned using the test-bed.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"20 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":"124865077","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

On the Variation in Web Page Download Traffic across Different Client Types 网页下载流量在不同客户端类型中的变化

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

Sean Sanders, J. Kaur

引用次数: 4

In-Band Update for Network Routing Policy Migration 网络路由策略迁移带内更新

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

Shuyuan Zhang, S. Malik, S. Narain, L. Vanbever

引用次数: 5

A Decentralized System for Privacy-Preserving Context Exchange: Facilitating a Better Work-Life Balance 一个去中心化的保护隐私的上下文交换系统:促进更好的工作与生活平衡

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

R. Dwarakanath, R. Steinmetz

引用次数: 0