IEEE INFOCOM 2008 - The 27th Conference on Computer Communications最新文献_第4页

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching 全光标签堆叠:缓解全光分组交换中路由和架构成本之间的权衡

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.115

F. S. Donado, R. V. Caenegem, D. Colle, J. Marzo, M. Pickavet, R. Fabregat, P. Demeester

{"title":"All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching","authors":"F. S. Donado, R. V. Caenegem, D. Colle, J. Marzo, M. Pickavet, R. Fabregat, P. Demeester","doi":"10.1109/INFOCOM.2008.115","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.115","url":null,"abstract":"All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","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":"114624914","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}

引用次数: 13

A Practical SNR-Guided Rate Adaptation 一种实用的信噪比导向速率适应方法

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.274

Jiansong Zhang, Kun Tan, Jun Zhao, Haitao Wu, Yongguang Zhang

{"title":"A Practical SNR-Guided Rate Adaptation","authors":"Jiansong Zhang, Kun Tan, Jun Zhao, Haitao Wu, Yongguang Zhang","doi":"10.1109/INFOCOM.2008.274","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.274","url":null,"abstract":"Rate adaptation is critical to the system performance of wireless networks. Typically, rate adaptation is considered as a MAC layer mechanism in IEEE 802.11. Most previous work relies only on frame losses to infer channel quality, but performs poorly if frame losses are mainly caused by interference. Recently SNR- based rate adaptation schemes have been proposed, but most of them have not been studied in a real environment. In this paper, we first conduct a systematic measurement-based study to confirm that in general SNR is a good prediction tool for channel quality, and identify two key challenges for this to be used in practice: (1) The SNR measures in hardware are often uncalibrated, and thus the SNR thresholds are hardware dependent. (2) The direct prediction from SNR to frame delivery ratio (FDR) is often over optimistic under interference conditions. Based on these observations, we present a novel practical SNR- Guided Rate Adaptation (SGRA) scheme. We implement and evaluate SGRA in a real test-bed and compare it with other three algorithms: ARF, RRAA and HRC. Our results show that SGRA outperforms the other three algorithms in all cases we have tested.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"42 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":"114659804","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}

引用次数: 242

Fair Scheduling through Packet Election 通过分组选举实现公平调度

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.69

Srikanth Jagabathula, V. Doshi, D. Shah

{"title":"Fair Scheduling through Packet Election","authors":"Srikanth Jagabathula, V. Doshi, D. Shah","doi":"10.1109/INFOCOM.2008.69","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.69","url":null,"abstract":"In this paper, we consider the problem of designing a scheduling algorithm for input queued switches, that is both fair as well as throughput optimal. Most of the existing literature on input-queued switch fairness criteria concentrates on flow-based fairness. Since a large fraction of network traffic is about \"short- flows\" there is a need for packet-based fairness criterion. The significant body of literature developed over the past two decades for packet-based scheduling algorithms is primarily concerned with throughput and delay, but not fairness. One of the reasons for such a state of affairs is the lack of a proper definition for packet-based fairness. The difficulty in defining fair stems from the fact that any reasonable notion of fairness must combine the well-known notion of fairness for a single-queue with the scheduling constraint of an input queued switch in an appropriate manner. As one of the main results of this paper, we define a notion of packet-based fair scheduling by identifying it as the selection of a winner in the following ranked election: packets are voters; schedules are candidates and each packet ranks different schedules based on their priorities. Drawing upon the seminal work of Goodman and Markowitz (1952) on ranked elections, we obtain a unique characterization of the fair schedule. Another important contribution of this paper is proving that the thus obtained fair scheduling algorithm is throughput optimal. There is no a priori reason why this should be true, and we introduce some non-standard proof techniques to prove the result. Our results suggest a framework for defining fair scheduling algorithm for a constrained packet network; a nonstandard method to prove throughput stability for algorithms, such as ours, that are not based on queue-sizes.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"53 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":"117288144","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

MAC for Networks with Multipacket Reception Capability and Spatially Distributed Nodes 具有多包接收能力和空间分布节点的网络MAC

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.202

G. Çelik, G. Zussman, Wajahat F. Khan, E. Modiano

引用次数: 62

Asynchronous Sampling Benefits Wireless Sensor Networks 异步采样有利于无线传感器网络

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.288

Jing Wang, Yonghe Liu, Sajal K. Das

引用次数: 7

Cooperative Routing in Multi-Source Multi-Destination Multi-Hop Wireless Networks 多源多目的多跳无线网络中的协同路由

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.306

Jin Zhang, Qian Zhang

{"title":"Cooperative Routing in Multi-Source Multi-Destination Multi-Hop Wireless Networks","authors":"Jin Zhang, Qian Zhang","doi":"10.1109/INFOCOM.2008.306","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.306","url":null,"abstract":"In a network supporting cooperative communication, the sender of a transmission is no longer a single node, which causes the concept of a traditional link to be reinvestigated. Thus, the routing scheme basing on the link concept should also be reconsidered to \";truly\"; exploit the potential performance gain introduced by cooperative communication. In this paper, we investigate the joint problem of routing selection in network layer and contention avoidance among multiple links in MAC layer for multi-hop wireless networks in a cooperative communication aware network. To the best of our knowledge, it is the first work to investigate the problem of cooperative communication aware routing in multi-source multi-destination multi-hop wireless networks. Several important concepts, including virtual node, virtual link and virtual link based contention graph are introduced. Basing on those concepts, an optimal cooperative routing is achieved and a distributed routing scheme is proposed after some practical approximations. The simulation results show that our scheme reduces the total transmission power comparing with non-cooperative routing and greatly increases the network throughput comparing with single flow cooperative routings.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"47 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":"125754329","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}

引用次数: 88

Task Scheduling and Lightpath Establishment in Optical Grids 光网格中的任务调度和光路建立

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.261

Xin Liu, Wei Wei, C. Qiao, Ting Wang, Weisheng Hu, W. Guo, Minyou Wu

{"title":"Task Scheduling and Lightpath Establishment in Optical Grids","authors":"Xin Liu, Wei Wei, C. Qiao, Ting Wang, Weisheng Hu, W. Guo, Minyou Wu","doi":"10.1109/INFOCOM.2008.261","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.261","url":null,"abstract":"Data-intensive Grid applications require huge data transferring between multiple geographically separated computing nodes where computing tasks are executed. For a future WDM network to efficiently support this type of emerging applications, traditional approaches to establishing lightpaths between given source destination pairs are not sufficient because a computing task may be executed on any one of several computing nodes having the necessary resources. Therefore, lightpath establishment has to be considered jointly with task scheduling to achieve best performance. In this paper, we study the optimization problems of jointly scheduling both computing resources and network resources. We first present the formulation of two optimization problems with the objectives being the minimization of the completion time of a job and minimization of the resource usage/cost to satisfy a job with a deadline respectively. When the objective is to minimize the completion time, we devise an optimal algorithm for a special type of applications. Furthermore, we propose efficient heuristics to deal with general applications with either optimization objective and demonstrate their good performances via simulation.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","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":"129860527","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}

引用次数: 29

Proportional Fairness in Multi-Rate Wireless LANs 多速率无线局域网中的比例公平性

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.154

Erran L. Li, Martin Pál, Y. Yang

引用次数: 217

Cyber-Fraud is One Typo Away 网络诈骗就差一个错别字了

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.258

A. Banerjee, D. Barman, M. Faloutsos, L. Bhuyan

引用次数: 34

Essentia: Architecting Wireless Sensor Networks Asymmetrically 要点:非对称无线传感器网络架构

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.174

T. He, J. Stankovic, R. Stoleru, Yu Gu, Yafeng Wu

引用次数: 10