发布求助
文献互助 智能选刊 最新文献

CoNEXT Student '12最新文献

筛选
英文 中文
Interaction or interference: can AQM and low priority congestion control successfully collaborate? 交互或干扰:AQM和低优先级拥塞控制能否成功协作?
CoNEXT Student '12 Pub Date : 2012-12-10 DOI: 10.1145/2413247.2413263
YiXi Gong, D. Rossi, C. Testa, S. Valenti, M. D. Taht
{"title":"Interaction or interference: can AQM and low priority congestion control successfully collaborate?","authors":"YiXi Gong, D. Rossi, C. Testa, S. Valenti, M. D. Taht","doi":"10.1145/2413247.2413263","DOIUrl":"https://doi.org/10.1145/2413247.2413263","url":null,"abstract":"Heterogeneity in the Internet ecosystem sometimes turns interaction into interference. Over the years, active queue management (AQM) and end-to-end low-priority congestion control (LPCC) have been proposed as alternative solutions to counter the persistently full buffer problem -- that recently became popular under the \"bufferbloat\" term.\u0000 In this work, we point out the existence of a negative interplay among AQM and LPCC techniques. Intuitively, as AQM is designed to penalize the most aggressive flows it mainly hit best effort TCP: it follows that LPCC is not able to maintain its low priority, thus becoming as aggressive as TCP. By an extended set of simulation on various AQM policies and LPCC protocols, including the very recent CoDel AQM and LEDBAT LPCC proposals, we point out that this interference is quite universal and deserves further attention.","PeriodicalId":185637,"journal":{"name":"CoNEXT Student '12","volume":"885 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116168139","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}
引用次数: 7
Specification and composition of network services in future internet architectures 未来互联网架构中网络服务的规范和组合
CoNEXT Student '12 Pub Date : 2012-12-10 DOI: 10.1145/2413247.2413275
Xinming Chen, Abhishek Dwaraki, Hao Cai, T. Wolf
{"title":"Specification and composition of network services in future internet architectures","authors":"Xinming Chen, Abhishek Dwaraki, Hao Cai, T. Wolf","doi":"10.1145/2413247.2413275","DOIUrl":"https://doi.org/10.1145/2413247.2413275","url":null,"abstract":"The inadequacies of the current Internet data and control planes to adapt to changes have given rise to several new proposed Internet architectures. In many cases, these new architectures enable a variety of \"services\" in the network that can be used to customize network functionality and to add new features after deployment. One key challenge to such network services is that they need to be composed from various networking resources at runtime. Therefore, it is critical to develop methods for accurately specifying the semantics of network services and composing them dynamically. In this article, we propose a service description semantic, discuss how to formalize the service composition problem and use the formalization in conjunction with a logic planner to provide an efficient solution.","PeriodicalId":185637,"journal":{"name":"CoNEXT Student '12","volume":"52 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126620453","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}
引用次数: 3
Evolving TCP.: how hard can it be? TCP进化。能有多难呢?
CoNEXT Student '12 Pub Date : 2012-12-10 DOI: 10.1145/2413247.2413270
Zubair Nabi, Toby Moncaster, Anil Madhavapeddy, S. Hand, J. Crowcroft
{"title":"Evolving TCP.: how hard can it be?","authors":"Zubair Nabi, Toby Moncaster, Anil Madhavapeddy, S. Hand, J. Crowcroft","doi":"10.1145/2413247.2413270","DOIUrl":"https://doi.org/10.1145/2413247.2413270","url":null,"abstract":"Over the last decade TCP has become the de facto \"narrow waist\" of the Internet -- a one-size-fits-all transport that is poorly suited to the needs of modern applications. As middleboxes have become ubiquitous, it has become nigh impossible for alternative transports to exist and so application developers have come to view opening a TCP socket as the only reliable way to connect to a server. Some recent proposals circumvent this problem by camouflaging new transports so that they appear like TCP to middleboxes. We draw the key lessons from this approach and show how this could lead to a true one-size-fits-all transport: \"Polyversal TCP\".","PeriodicalId":185637,"journal":{"name":"CoNEXT Student '12","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121234056","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}
引用次数: 6
Toward fast and efficient IP-level network topology capture 迈向快速高效的ip级网络拓扑捕获
CoNEXT Student '12 Pub Date : 2012-12-10 DOI: 10.1145/2413247.2413252
Thomas Bourgeau, T. Friedman
{"title":"Toward fast and efficient IP-level network topology capture","authors":"Thomas Bourgeau, T. Friedman","doi":"10.1145/2413247.2413252","DOIUrl":"https://doi.org/10.1145/2413247.2413252","url":null,"abstract":"This paper presents a new network topology capture algorithm, NTC, which aims to better capture network dynamics through accelerated probing, reducing the probing load while maintaining good coverage. There are two novel aspects to our approach: it focuses on obtaining the network graph rather than a full set of individual traces, and it uses past probing results in an adaptive way to guide future probing. We evaluate our algorithm on real traces and demonstrate outstanding performance compared to existing work.","PeriodicalId":185637,"journal":{"name":"CoNEXT Student '12","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126350830","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}
引用次数: 2
AutoSlice: automated and scalable slicing for software-defined networks AutoSlice:用于软件定义网络的自动化和可扩展切片
CoNEXT Student '12 Pub Date : 2012-12-10 DOI: 10.1145/2413247.2413251
Z. Bozakov, Panagiotis Papadimitriou
{"title":"AutoSlice: automated and scalable slicing for software-defined networks","authors":"Z. Bozakov, Panagiotis Papadimitriou","doi":"10.1145/2413247.2413251","DOIUrl":"https://doi.org/10.1145/2413247.2413251","url":null,"abstract":"We present AutoSlice, a virtualization layer that automates the deployment and operation of software-defined network (SDN) slices on top of shared network infrastructures. AutoSlice enables substrate providers to resell their SDN to multiple tenants while minimizing operator intervention. At the same time, tenants are given the means to lease programmable network slices enabling the deployment of arbitrary services based on SDN principles. We outline the control plane architecture of AutoSlice and discuss the most challenging aspects of the forwarding plane design with emphasis on scalability.","PeriodicalId":185637,"journal":{"name":"CoNEXT Student '12","volume":"94 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128663361","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}
引用次数: 73
Inferring networked system models from behavior traces 从行为轨迹推断网络系统模型
CoNEXT Student '12 Pub Date : 2012-12-10 DOI: 10.1145/2413247.2413256
Ivan Beschastnikh
{"title":"Inferring networked system models from behavior traces","authors":"Ivan Beschastnikh","doi":"10.1145/2413247.2413256","DOIUrl":"https://doi.org/10.1145/2413247.2413256","url":null,"abstract":"Networked systems are often difficult to debug and understand. A common way of gaining insight into system behavior is to inspect execution logs and documentation. Unfortunately, manual log inspection is difficult and documentation is often incomplete and out of sync with the implementation.\u0000 To provide developers with more insight into networked systems I am working Dynoptic, a tool that infers a concise and accurate system model, in the form of a communicating finite state machine from logs. Developers can use the inferred models to understand behavior, detect anomalies, verify known bugs, diagnose new bugs, and increase their confidence in the correctness of their implementation. Unlike most related work, Dynoptic does not require developer-written scenarios, specifications, negative execution examples, or other complex input. Dynoptic processes the logs most systems already produce and requires developers only to specify a set of regular expressions for parsing the logs.","PeriodicalId":185637,"journal":{"name":"CoNEXT Student '12","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116969437","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}
引用次数: 1
QoS-driven channel selection for heterogeneous cognitive radio networks 异构认知无线网络qos驱动的信道选择
CoNEXT Student '12 Pub Date : 2012-12-10 DOI: 10.1145/2413247.2413253
Luca Zappaterra
{"title":"QoS-driven channel selection for heterogeneous cognitive radio networks","authors":"Luca Zappaterra","doi":"10.1145/2413247.2413253","DOIUrl":"https://doi.org/10.1145/2413247.2413253","url":null,"abstract":"Cognitive radio (CR) technology allows secondary users (SUs) to exploit the wireless resources not utilized by licensed primary users (PUs). SU channel selection for finding transmission opportunities incurs non-negligible costs and is a key challenge in successful operation of Cognitive Radio Networks (CRNs). In this paper we present current research studies on algorithms for finding the optimal channels supporting SU Quality of Service (QoS) requirements.","PeriodicalId":185637,"journal":{"name":"CoNEXT Student '12","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125671839","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}
引用次数: 4
The case for software-defined networking in heterogeneous networked environments 异构网络环境中软件定义网络的案例
CoNEXT Student '12 Pub Date : 2012-12-10 DOI: 10.1145/2413247.2413283
Marc Mendonca, K. Obraczka, T. Turletti
{"title":"The case for software-defined networking in heterogeneous networked environments","authors":"Marc Mendonca, K. Obraczka, T. Turletti","doi":"10.1145/2413247.2413283","DOIUrl":"https://doi.org/10.1145/2413247.2413283","url":null,"abstract":"Motivated by a vision of a fully connected world, we explore how Software-Defined Networking (SDN) can be utilized to support heterogeneous environments consisting of both infrastructure-based and infrastructure-less networks. To make the case for SDN in heterogeneous networks, or Heterogeneous SDN (H-SDN), we examine application scenarios in which H-SDN is a key enabling technology.","PeriodicalId":185637,"journal":{"name":"CoNEXT Student '12","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126547840","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}
引用次数: 58
Optimal storage allocation for road side unit aided vehicular mobile content dissemination 路旁单元辅助车载移动内容传播的优化存储配置
CoNEXT Student '12 Pub Date : 2012-12-10 DOI: 10.1145/2413247.2413287
Wenyu Ren, Yong Li, Depeng Jin, Pan Hui
{"title":"Optimal storage allocation for road side unit aided vehicular mobile content dissemination","authors":"Wenyu Ren, Yong Li, Depeng Jin, Pan Hui","doi":"10.1145/2413247.2413287","DOIUrl":"https://doi.org/10.1145/2413247.2413287","url":null,"abstract":"Road Side Units (RSUs), which enable the vehicles to infras-tructure communication, are deployed along the roadside to handle the growing communication demands as the number of vehicles increases. How to efficiently use these RSUs to enhance the vehicular network performance becomes an im-portant problem after the optimal RSU placement schemes were proposed. In this poster, we investigate this problems by considering the application of vehicular mobile content dissemination. By collecting and analyzing the vehicular mobility traces from about 27,000 operational taxis during one month in Beijing city, we find that the contact patterns between the RSUs and vehicles obey exponential distribu-tion. Based on this fact, We formulate the optimal mo bile content dissemination problem with heterogeneous data items and limited storage as an integer linear programming, which can be solved by widely existing optimization suites like CPLEX and YALMIP.","PeriodicalId":185637,"journal":{"name":"CoNEXT Student '12","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129846463","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}
引用次数: 1
Source routed forwarding with software defined control, considerations and implications 源路由转发与软件定义的控制，注意事项和含义
CoNEXT Student '12 Pub Date : 2012-12-10 DOI: 10.1145/2413247.2413274
M. Soliman, B. Nandy, I. Lambadaris, P. Ashwood-Smith
{"title":"Source routed forwarding with software defined control, considerations and implications","authors":"M. Soliman, B. Nandy, I. Lambadaris, P. Ashwood-Smith","doi":"10.1145/2413247.2413274","DOIUrl":"https://doi.org/10.1145/2413247.2413274","url":null,"abstract":"The research introduced in this paper focuses on controller scalability and performance issues in Software-Defined Networks (SDNs), and discusses a new routing scheme that leverages a variation of Source Routing for use in OpenFlow-based networks. The research aims to reduce the state needed to be distributed to the network devices by the controller(s) in SDNs, and in return improve the scale, convergence time, fault tolerance and cost of such network architectures.","PeriodicalId":185637,"journal":{"name":"CoNEXT Student '12","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133523606","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}
引用次数: 53
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书