IEEE INFOCOM Workshops 2009最新文献

筛选
英文 中文
Online Maximizing Weighted Throughput in a Fading Channel 衰落信道中的在线最大加权吞吐量
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-29 DOI: 10.1109/ISIT.2009.5205693
Fei Li, Zhi Zhang
{"title":"Online Maximizing Weighted Throughput in a Fading Channel","authors":"Fei Li, Zhi Zhang","doi":"10.1109/ISIT.2009.5205693","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205693","url":null,"abstract":"We consider online scheduling weighted packets with time constraints over a fading channel. Packets arrive at the transmitter in an online manner. Each packet has a value and a deadline by which it should be sent. The fade state of the channel determines the throughput obtained per unit of time and the channel's quality may change over time. In this paper, we design online algorithms to maximize weighted throughput, defined as the total value of the packets sent by their respective deadlines. Competitive ratio is employed to measure an online algorithm's performance. For this problem and one of its variants, we present two online algorithms with competitive ratios 2:618 and 2 respectively.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114084093","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
A P2P File Sharing Network Topology Formation Algorithm Based on Social Network Information 基于社交网络信息的P2P文件共享网络拓扑形成算法
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072101
J. Altmann, Zelalem Berhanu Bedane
{"title":"A P2P File Sharing Network Topology Formation Algorithm Based on Social Network Information","authors":"J. Altmann, Zelalem Berhanu Bedane","doi":"10.1109/INFCOMW.2009.5072101","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072101","url":null,"abstract":"This paper applies the theory of social networks to P2P systems, creating a social-network-based P2P network topology formation algorithm for file sharing. The algorithm extends the Gnutella P2P file sharing technology, which uses super nodes for searching and for relaying shared files between network leafs that are located behind Firewalls/NATs. The topology of the P2P network is based on the actual social relationship between peers (users). The idea is that users are willing to contribute their resources to a P2P network if they know that their resources directly benefit their friends and family. Following this approach, free-riding in P2P networks will be avoided by not providing better-than-basic service if peers do not reveal their social relationships. Within the paper, we simulate the proposed topology formation algorithm, considering the real characteristics of the Gnutella P2P network and realistic network topologies. The simulation shows the effectiveness of the topology formation algorithm and the high utility of nodes under this new file sharing scheme.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116881550","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
Informed Detour Selection Helps Reliability 知情绕行选择有助于可靠性
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072155
Boulat A. Bash
{"title":"Informed Detour Selection Helps Reliability","authors":"Boulat A. Bash","doi":"10.1109/INFCOMW.2009.5072155","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072155","url":null,"abstract":"In this work we propose to use path information to improve the reliability of the Internet. Previous work put forth a simple idea of using an overlay network of intermediary detour nodes that can be used to route around failures on direct Internet paths [1]. We provide the mechanism for choosing these intermediary nodes. \u0000 \u0000The underlying idea of our work is that knowledge of the point-of-presence (PoP) path between the source and destination as well as the PoP paths between potential detour nodes and destination can be used to pick the intermediary for routing around failures on the direct path. We validate our proposal by performing an experiment using PlanetLab [2] and leveraging the existing iPlane [3] infrastructure. Using the data from iPlane, we obtain a two-fold decrease in path outage probability over the state-of-the-art.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116904586","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}
引用次数: 0
Dynamic Scheduling of Survivable Connections with Delay Tolerance in WDM Networks WDM网络中具有延迟容忍的存活连接动态调度
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072134
C. Cavdar, M. Tornatore, F. Buzluca, B. Mukherjee
{"title":"Dynamic Scheduling of Survivable Connections with Delay Tolerance in WDM Networks","authors":"C. Cavdar, M. Tornatore, F. Buzluca, B. Mukherjee","doi":"10.1109/INFCOMW.2009.5072134","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072134","url":null,"abstract":"In optical wavelength-division multiplexing (WDM) networks, recent technological progress is enabling dynamic optical transport in which leasable circuits (connections) can be set up and released for a specific duration of time, providing large capacity to bandwidth-hungry applications. Set-up times can be flexible or fixed, depending on the type of the application. Since the interruption of a high-speed optical connection could lead to huge loss of data, such connections need to be protected against failures. We study the problem of dynamic provisioning of user-controlled connection requests that have specified holding times and particular delay tolerances with shared path protection. The metric of delay tolerance is a measure of customer patience, and it is defined as the time a connection request can be held until it is set up. A connection that cannot be established at the instant of its request could potentially be set up in the remaining duration of its delay tolerance. We show that a reduction of up to 50 percent can be achieved on blocking probability by exploiting delay tolerance in networks without using extra backup capacity. In this study we explore different queuing policies for impatient customers. Different dynamic scheduling algorithms are applied and compared by giving priority to connections according to their arrival rates, delay tolerances and holding times alternatively.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125298101","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}
引用次数: 21
Enhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks 混合光无线网络中带有准入控制的增强型信令方案
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072139
Ying Yan, Hao Yu, H. Wessing, L. Dittmann
{"title":"Enhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks","authors":"Ying Yan, Hao Yu, H. Wessing, L. Dittmann","doi":"10.1109/INFCOMW.2009.5072139","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072139","url":null,"abstract":"The hybrid optical wireless (HOW) network has been viewed as a promising solution to meet the increasing user bandwidth and mobility demands. Due to the basic differences in the optical and wireless technologies, a challenging problem lies in the Media Access Control (MAC) protocol design so that it can support stringent Quality of Service (QoS) requirements. In this paper, we describe and evaluate a resource management framework designed for the HOW networks. There are two parts in the resource management framework The first part is the Enhanced MPCP (E-MPCP) scheme aiming at improving signaling ability between the optical and wireless networks. The second part is an Integrated Optical Wireless Admission Control (IOW-AC) scheme aiming at providing the integrated bandwidth allocation in the HOW networks. Our results show that the performances of the system in terms of throughput, delay and packet dropping probability depend on several factors. These factors include the frame duration, the traffic load and the total number of shared users. The results also highlight that our proposed system achieves significant improvements over the traditional approach in terms of user QoS guarantee and network resource utilization.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115045315","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
Building Ethernet Connectivity Services for Provider Networks 为供应商网络构建以太网连接服务
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072117
E. Bonada, D. Sala
{"title":"Building Ethernet Connectivity Services for Provider Networks","authors":"E. Bonada, D. Sala","doi":"10.1109/INFCOMW.2009.5072117","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072117","url":null,"abstract":"Ethernet has become a dominant technology and it is now a universal communication interface more than just an access technology. Its low cost, high data rates, low complexity and simple maintenance offer Network Providers a good opportunity for using Ethernet data networks at very large scale replacing the existing ATM/SONET or IP networking [1].","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115223028","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
Discrete Bit Selection: Towards a Bit-Level Heuristic Framework for Multi-Dimensional Packet Classification 离散位选择:面向多维数据包分类的位级启发式框架
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072130
Baohua Yang, Yaxuan Qi, Fei He, Y. Xue, Jun Li
{"title":"Discrete Bit Selection: Towards a Bit-Level Heuristic Framework for Multi-Dimensional Packet Classification","authors":"Baohua Yang, Yaxuan Qi, Fei He, Y. Xue, Jun Li","doi":"10.1109/INFCOMW.2009.5072130","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072130","url":null,"abstract":"Packet classification is still a challenging problem in practice under large number of classification rules and constant growth of performance requirement. Most of the existing algorithms try to solve the problem heuristically by leveraging on the inherent field-level characteristics of the rules. This paper proposes a bit-level heuristic framework: Discrete Bit Selection (DBS) for multi-dimensional packet classification. Preliminary experimental results show that DBS-based algorithm gains much better performance both in search time and memory requirement than the well-known field-level algorithms with various real-life rule sets.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"299302 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116580055","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
IPv6 Ingress Filtering in a Multihoming Environment 多归属环境下的IPv6入接口过滤
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072156
Étienne GALLET DE SANTERRE, L. Toutain
{"title":"IPv6 Ingress Filtering in a Multihoming Environment","authors":"Étienne GALLET DE SANTERRE, L. Toutain","doi":"10.1109/INFCOMW.2009.5072156","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072156","url":null,"abstract":"SDSA is a very simple mechanism, capable of solving one main problem in IPv6 multihomed environment, namely, the ingress filtering issue. As it requires minor modifications to the network behaviour and does not increase the process complexity, SDSA gives immediate benefits to first adopters. It decreases the packet loss ratio, since it routes packets to the ISP which delegated their source address prefix.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123033989","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
Application Driven Comparison of T-MPLS/MPLS-TP and PBB-TE - Driver Choices for Carrier Ethernet 运营商以太网中T-MPLS/MPLS-TP和PBB-TE驱动选择的应用驱动比较
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072112
R. Vaishampayan, A. Gumaste, S. Rana, N. Ghani
{"title":"Application Driven Comparison of T-MPLS/MPLS-TP and PBB-TE - Driver Choices for Carrier Ethernet","authors":"R. Vaishampayan, A. Gumaste, S. Rana, N. Ghani","doi":"10.1109/INFCOMW.2009.5072112","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072112","url":null,"abstract":"This paper describes qualitatively and through applications the comparison of PBB-TE and T-MPLS/MPLS-TP approaches to Carrier Ethernet. Carrier Ethernet has currently been proposed as a method to transport Ethernet in metro networks with carrier class service attributes. Two approaches have been considered - one based on backbone bridging called PBB-TE and the other based on TMPLS/ MPLS-TP that has evolved from MPLS minus some redundant features. We qualitatively understand the two technologies, delve into their working and compare these from multiple standpoints. We then develop scenarios where these are used including data-center, mobile back-haul and IPTV (video on demand). Both PBB-TE and T-MPLS are applied to each of these three leading metro application (that are expected to dominate much of future metro services). Cost and performance comparisons are shown.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129256454","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
Contention Resolution through Network Global Control in Optical Packet Switching Networks 光分组交换网络中基于网络全局控制的争用解决
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072120
Ming Xin, Minghua Chen, Hong-wei Chen, S. Xie
{"title":"Contention Resolution through Network Global Control in Optical Packet Switching Networks","authors":"Ming Xin, Minghua Chen, Hong-wei Chen, S. Xie","doi":"10.1109/INFCOMW.2009.5072120","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072120","url":null,"abstract":"Optical buffering is one of the main obstacles in optical packet switching (OPS) networks. We proposed the network global control strategy to resolve this problem. By introducing the cycled traffic at the edge node and the slot assignment algorithm at the core node, a slotted OPS networks with no contention can be realized. In this network, a good throughput, end to end delay and delay jitter performance can be gotten at high load simultaneously, so it may be a promising candidate for the future optical networks.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125087500","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}
引用次数: 0
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学术文献互助群
群 号:481959085
Book学术官方微信