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

IEEE INFOCOM Workshops 2008最新文献

筛选
英文 中文
Inference of network-wide VLAN usage in small enterprise networks 小型企业网络中全网VLAN使用推断
IEEE INFOCOM Workshops 2008 Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.4544620
K. Sripanidkulchai, C. Issariyapat, K. Meesublak
{"title":"Inference of network-wide VLAN usage in small enterprise networks","authors":"K. Sripanidkulchai, C. Issariyapat, K. Meesublak","doi":"10.1109/INFOCOM.2008.4544620","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544620","url":null,"abstract":"Virtual local area networks (VLANs) are heavily utilized in enterprise networks to group hosts with common requirements together as if they were on the same LAN although they may be in separate physical locations. The key benefit of VLANs is its flexibility to allow any logical LAN to be implemented on any physical infrastructure. As a result, enterprise network administrators often use VLANs to group users and use the resulting grouping to control access to resources. Even in small enterprise networks such as the one we study in this paper, there are more than 50 VLANs in use. Despite their popularity, there has been little systematic work studying deployed VLANs and more importantly, understanding the traffic flow patterns inside these VLANs. In this paper, we develop simple light-weight techniques to map VLAN traffic as it flows across a network. The mapping results from our study can be used as a part of a tool to monitor VLAN usage and may be extended to applications in problem determination and VLAN configuration optimization.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123546179","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}
引用次数: 8
Rate control with end-to-end delay and rate constraints 具有端到端延迟和速率约束的速率控制
IEEE INFOCOM Workshops 2008 Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.4544631
Z. Rosberg
{"title":"Rate control with end-to-end delay and rate constraints","authors":"Z. Rosberg","doi":"10.1109/INFOCOM.2008.4544631","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544631","url":null,"abstract":"A fluid model of multi-class flows with priority packet scheduling is considered for controlling the flow rates, their end-to-end delays and their packet losses. We derive a globally stable distributed rate and delay combined control when no information time lags are present. By properly sizing the router buffers, the stable rates attain the end-to- end delay requirements without any packet loss. By further enhancing the network with bandwidth reservation and admission control, we also show that minimum rate is guaranteed. The stability properties of the discrete time version of our control are also derived when no information time lags are present. The stability in the presence of information time lags is studied numerically by computing the delay and rate trajectories for a real test-bed network.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129229085","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
VDTLS - Providing secure communications in vehicle networks VDTLS -在车辆网络中提供安全通信
IEEE INFOCOM Workshops 2008 Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.4544651
S. Pietrowicz, H. Shim, G. Di Crescenzo, Zhang Tao
{"title":"VDTLS - Providing secure communications in vehicle networks","authors":"S. Pietrowicz, H. Shim, G. Di Crescenzo, Zhang Tao","doi":"10.1109/INFOCOM.2008.4544651","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544651","url":null,"abstract":"A novel security mechanism, called Vehicular Datagram Transport Layer Security (VDTLS), for providing secure User Datagram Protocol (UDP)-based communications in vehicle networks is described. VDTLS extends the Internet standard protocol DTLS and integrates a recent development in asymmetric cryptography, called Identity Based Encryption (IBE), to effectively address the unique challenges in providing secure communications in vehicle networks, e.g., a large number of mobile nodes, limited over-the-air bandwidth, unreliable, intermittent network connectivity, and privacy. VDTLS is being used in the US Department of Transportation's (US DOT's) Vehicle Infrastructure Integration (VII) Proof-of-Concept (POC) Trial in 2008.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130565485","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
On reverse engineering the management actions from observed BGP data 从观察到的BGP数据进行逆向工程的管理操作
IEEE INFOCOM Workshops 2008 Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.4544599
Shih Ming, S.F. Wu, Xiaoliang Zhao, Ke Zhang
{"title":"On reverse engineering the management actions from observed BGP data","authors":"Shih Ming, S.F. Wu, Xiaoliang Zhao, Ke Zhang","doi":"10.1109/INFOCOM.2008.4544599","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544599","url":null,"abstract":"While most of the research work on BGP has focused on detecting and characterizing large-scale routing anomalies from the perspective of network operations and management, it is important to monitor the management actions taken by the network operators in response to global BGP network failures. A fundamental question to answer is the following: by utilizing only public BGP observation data under today's Internet environment, can we reverse engineer the management actions taken by specific autonomous systems? In this paper, we propose a formal framework to describe and analyze MOAS events and possible management actions. We use BGP data and a two-step learning approach to evaluate each possible action then determine the most likely one. Through this process, we discovered that early actions were taken by multiple ASes before the faulty originator corrected its mistake. Furthermore, the results show that only a handful of ASes took such early corrective action, but the effect is disproportional: a significant portion, more than 90%, of affected prefixes were routed back to their correct routing path.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124228137","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
Two-stage IP-address lookup in distributed routers 分布式路由器中的两阶段ip地址查找
IEEE INFOCOM Workshops 2008 Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.4544582
Jing Fu, Peter Sjödin, Gunnar Karlsson
{"title":"Two-stage IP-address lookup in distributed routers","authors":"Jing Fu, Peter Sjödin, Gunnar Karlsson","doi":"10.1109/INFOCOM.2008.4544582","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544582","url":null,"abstract":"IP-address lookup is the primary processing function of Internet routers. While a wide range of algorithms have been developed to perform lookups, very few of them have the distributed architecture of current and future routers in consideration. To support rapidly increasing high data rates, packet processing in commercial routers today are divided into an ingress and an egress part, with the lookup performed at the ingress. In the lookup, the egress line card, the outgoing interface and the nexthop address of a given packet are determined. In this paper, we propose an alternative scheme to perform the lookup by dividing the task, which is named two-stage lookup scheme. In the lookup, the ingress determines the egress only, then it is up to the egress to determine the outgoing interface and the nexthop address. Based on our analysis and experimental study, we conclude that the proposed scheme has several advantages in both hardware lookup technologies and software lookup algorithms. In particular, it provides significantly more efficient high-speed packet lookup.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115893958","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
Competitive advance reservation with bounded path dispersion 有界路径离散的竞争提前预订
IEEE INFOCOM Workshops 2008 Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.4544635
R. Cohen, N. Fazlollahi, D. Starobinski
{"title":"Competitive advance reservation with bounded path dispersion","authors":"R. Cohen, N. Fazlollahi, D. Starobinski","doi":"10.1109/INFOCOM.2008.4544635","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544635","url":null,"abstract":"Advance channel reservation is emerging as an important feature of ultra high-speed networks requiring the transfer of large files. In this paper, we present two new delay-competitive algorithms for advance reservation, called BatchAll and BatchLim. These algorithms are guaranteed to achieve optimal throughput performance, based on multi-commodity flow arguments. Unlike BatchAll, the BatchLim algorithm returns the completion time of a connection immediately as a request is placed, but at the expense of a slightly looser competitive ratio than that of BatchAll. We propose a simple approach that limits the number of parallel paths used by the algorithms while provably bounding the maximum reduction factor in the transmission throughput. We show that, although the number of different paths can be exponentially large, the actual number of paths needed to approximate the flow is quite small and proportional to the number of edges in the network. According to our simulations for a number of topologies, three to five parallel paths are sufficient to achieve close to optimal performance.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"333 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115966573","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
Multi-agent system for automation of B2C processes in the future internet 面向未来互联网B2C流程自动化的多代理系统
IEEE INFOCOM Workshops 2008 Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.4544606
V. Podobnik, I. Lovrek
{"title":"Multi-agent system for automation of B2C processes in the future internet","authors":"V. Podobnik, I. Lovrek","doi":"10.1109/INFOCOM.2008.4544606","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544606","url":null,"abstract":"The concept of new generation network (NGN) will define roles and relationships in the future Internet. The fierce competition among players in the Information and Communication (ICT) industry will just catalyze market redefinition processes, requesting from operators to promptly innovate their business models. The consumer's lifestyle will also change: individual users will be interested only in services that are intelligent (i.e., personalized and context-aware), dynamic (i.e., innovative and fun) and mobile (i.e., provisioned anytime and anywhere). A number of latest research incentives in the ICT domain are focused on automation and coordination of interactions between individual consumers and Internet service providers (ISPs). The research proposed in this paper aims to pursue similar ideas while creating a multi-agent system for automation of Business-to-Consumer (B2C) processes in the environment of the future Internet.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131134724","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}
引用次数: 16
A vehicle route management solution enabled by Wireless Vehicular Networks 通过无线车辆网络实现的车辆路线管理解决方案
IEEE INFOCOM Workshops 2008 Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.4544658
K. Collins, Gabriel-Miro Muntean
{"title":"A vehicle route management solution enabled by Wireless Vehicular Networks","authors":"K. Collins, Gabriel-Miro Muntean","doi":"10.1109/INFOCOM.2008.4544658","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544658","url":null,"abstract":"Traffic congestion is a very serious problem which is growing worse as the number of cars on the road continues to increase, out-pacing the provision of road capacity. This paper presents a novel vehicle routing algorithm for TraffCon - an innovative traffic management system for wireless vehicular networks. The algorithm tackles the traffic congestion problem by seeking to optimize the usage of the existing road capacity, reduce vehicle trip times and decrease fuel consumption and the consequent gas emissions. Results demonstrate that the algorithm significantly reduces congestion, journey times and fuel consumption and emissions in comparison with an existing approach.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"438 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124537968","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}
引用次数: 64
A trade-off study between efficiency and fairness in communication networks 通信网络中效率与公平的权衡研究
IEEE INFOCOM Workshops 2008 Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.4544591
Quanyan Zhu
{"title":"A trade-off study between efficiency and fairness in communication networks","authors":"Quanyan Zhu","doi":"10.1109/INFOCOM.2008.4544591","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544591","url":null,"abstract":"In this paper, we initiate an analytical tradeoff study between efficiency and fairness in the resource allocation problems in communication networks. We define metrics to measure efficiency and fairness and propose an upper bound relation between these two indices using convex optimization. In addition, defining a surface of efficiency and a surface of fairness, we propose a study of the trade-off using parametric programming and differential geometry.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114627918","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
To drop or not to drop: On the impact of handovers on TCP performance 丢弃或不丢弃:关于切换对TCP性能的影响
IEEE INFOCOM Workshops 2008 Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.4544656
Reuven Cohen, A. Levin
{"title":"To drop or not to drop: On the impact of handovers on TCP performance","authors":"Reuven Cohen, A. Levin","doi":"10.1109/INFOCOM.2008.4544656","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544656","url":null,"abstract":"This paper presents a comparison between two handover schemes: drop and forward. In the drop scheme, packets received by the base station after the host has disconnected are dropped, whereas in the forward scheme these packets are forwarded to the new base station. We analyze various TCP flavors and compare our findings to simulation results. Our results can be used to determine which handover scheme and which TCP flavor should be employed to minimize the negative effect of handovers on TCP performance.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117036252","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
下一页 尾页
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学术官方微信
小红书