{"title":"Resource dimensioning in WDM networks under state-based routing schemes","authors":"X. Zhang, Sun-il Kim, S. Lumetta","doi":"10.1109/BROADNETS.2007.4550458","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550458","url":null,"abstract":"Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet services are increasingly generating more demands that have high-bandwidth requirements with relatively short holding times. As globalization of companies or organizations becomes a new trend, the variety of Internet service demands, in space and time, creates a more variable and unpredictable traffic model for long term network provisioning. At the same time, upgrading backbone networks remains expensive and infrequent. It is important to be able to efficiently utilize precious network resources so that low call blocking is achieved while requiring fewer upgrades when the traffic model changes. There are two kinds of dimensioning problems. First, basic dimensioning allocates network resources for a newly built network. Second, incremental dimensioning allocates extra resources for an already built network without affecting currently available resources. Historically, routing and dimensioning problems are studied together as an optimization problem. However, as integrating multiple network layers into one control platform becomes a common trend, and as higher-layer traffic that currently utilize dynamic routing imposed on logical layers increases, it is essential to plan the underlying network based on dynamic routing schemes, such as open shortest path routing (SPF). In this paper, we study basic and incremental dimensioning for dynamic routed traffic. We propose a simulation based basic dimensioning approach and introduce two new incremental dimensioning techniques: MEAN and SD. We also introduce an evolutionary traffic model and traffic load computation criteria. Simulation results show that basic dimensioning effectively reduces the topological bottlenecks, rendering 7% less blocking compared to uniform allocation. With the evolutionary traffic model, SD incremental dimensioning shows advantages over the MEAN method on most practical networks. We also compare our results with fixed routing and dimensioning approaches, showing that dynamic approaches provide better network balance and utilization.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116421528","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}
{"title":"Reconsidering power management","authors":"C. Sengul, A. Harris, R. Kravets","doi":"10.1109/BROADNETS.2007.4550515","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550515","url":null,"abstract":"Power-management approaches have been widely studied in an attempt to conserve idling energy by allowing nodes to switch to a low-power sleep mode. However, due to the inherent inability of current approaches to match sleep schedules to different traffic patterns, energy is wasted switching needlessly from sleep to idle or large delays in traffic delivery are incurred due to being in the sleep state too long. In this paper, we explore such effects of various traffic patterns on current power management protocols. Our results show the importance of traffic information to obtain larger benefits from power management. While some proposals that exploit traffic information exist, they rely primarily on individual sender traffic patterns to develop sleep schedules, ignoring aggregate traffic observed by receivers. This deficiency motivates the design of a new power management protocol that use traffic information at the receivers to adapt sleep schedules.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124339088","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}
{"title":"Solving constrained OSNR Nash game in WDM optical networks with a fictitious player","authors":"Quanyan Zhu, Lacra Pavel","doi":"10.1109/BROADNETS.2007.4550534","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550534","url":null,"abstract":"Non-cooperative game theory is a powerful modeling tool for resource allocation problems in modern communication networks. However, practical concerns of capacity constraints and allocation efficiency have been a challenge for network engineers. In this paper, we base our results in the context of link-level power control of optical networks and propose a special form of games with an additional player to overcome these difficulties.We introduce a novel framework with a fictitious player (GFP) to extend the current OSNR Nash game framework with capacity constraints. We characterize a more analytically tractable solution in comparison to other approaches and propose a first-order iterative algorithm to find the equilibrium.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132042988","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}
{"title":"Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks","authors":"X. Zhang, Sun-il Kim, S. Lumetta","doi":"10.1109/BROADNETS.2007.4550460","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550460","url":null,"abstract":"Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services over wide area networks (WAN) continue to grow [2], and as traffic patterns become subject to more frequent changes, resource utilization and the ability to guarantee quality-of-service become more important. However, accurate, predictive traffic models are difficult to construct [3], implying that the routing mechanism will need to adapt to the difference between the anticipated and the observed loads. Online routing based on network residual capacity plays an important role in such settings, since optimal offline solutions require knowledge of future traffic, rendering long-term optimization nearly impossible. shortest path first (SPF) based routing is fast and is currently the most widely-used online algorithm for optical networks. Many variants of SPF, like CSPF (Constrained SPF), have been proposed to further reduce blocking and network congestion. This paper focuses on the problem of online open routing for connection-oriented optical networks. As part of the major contributions of this paper, we propose a novel online, link-state based routing algorithm called reduced flow routing (RFR), an oracular optimization model, and an efficient network provisioning algorithm. The RFR algorithm uses a fast analysis of each potential route’s impact on future requests to select amongst the available choices. The strategy of RFR leverages information about network topology and residual capacity to reduce blocking by rejecting 20% less connection requests relative to other online routing algorithms with little additional cost. The RFR algorithm can be integrated readily into current and future Generalized Multi-Protocol Label Switching (GMPLS) networks as well as many other relevant networks.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115155150","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}
{"title":"Modeling and generating TCP application workloads","authors":"Félix Hernández-Campos, K. Jeffay, F. D. Smith","doi":"10.1109/BROADNETS.2007.4550436","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550436","url":null,"abstract":"In order to perform valid experiments, traffic generators used in network simulators and testbeds require contemporary models of traffic as it exists on real network links. Ideally one would like a model of the workload created by the full range of applications running on the Internet today. Unfortunately, at best, all that is available to the research community are a small number of models for single applications or application classes such as the web or peer-to-peer. We present a method for creating a model of the full TCP application workload that generates the traffic flowing on a network link. From this model, synthetic workload traffic can be generated in a simulation that is statistically similar to the traffic observed on the real link. The model is generated automatically using only a simple packet-header trace and requires no knowledge of the actual identity or mix of TCP applications on the network. We present the modeling method and a traffic generator that will enable researchers to conduct network experiments with realistic, easy-to-update TCP application workloads. An extensive validation study is performed using Abilene and university traces. The method is validated by comparing traces of synthetically generated traffic to the original traces for a set of important measures of realism. We also show how workload models can be re-sampled to generate statistically valid randomized and rescaled variations.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129861301","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}
{"title":"Energy-efficient transmission for multimedia streams in last-hop wireless internet","authors":"A. Harris, Robin Snader, R. Kravets","doi":"10.1109/BROADNETS.2007.4550509","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550509","url":null,"abstract":"Multimedia applications have unique characteristics that can be leveraged to design energy-efficient loss recovery mechanisms. Given their loss tolerance and strict timing requirements, various frame dropping policies can be used to affect both application performance and energy consumption. However, the effects on energy consumption of such frame dropping policies depends on not only high-layer effects, but also the MAC layer underlying them. Therefore, we first present an analysis of an energy-efficient MAC-layer protocol, called Fast Transmit MAC Protocol (FTMP). We then explore three frame dropping policies: proactive, reactive, and opportunistic. We present the EELR (energy-efficient loss recovery) protocol, which uniquely combines all three frame dropping policies to provide both high energy efficiency and high application performance. EELR is implemented in a real system on top of an energy-saving MAC layer that exposes information about transmission costs to the transport layer for use in frame dropping decisions. Through analysis and real-world experiments, we show that the combination of an energy-efficient MAC layer with a transport protocol using all three frame-drop policies outperforms any other combination.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"646 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120883233","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}
{"title":"A new class of strictly nonblocking WDM multicast switching networks","authors":"H. Hamza, J. Deogun","doi":"10.1109/BROADNETS.2007.4550472","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550472","url":null,"abstract":"In this paper, a new design for strictly nonblocking WDM networks with full permutation and multicast switching capability is proposed. In the proposed design, we use space concentrators to reduce the switching complexity and multi-wavelength converters to reduce the cost of wavelength conversion in the network. A multi-wavelength converter is capable of simultaneously replicating a signal on an input wavelength to several different output wavelengths. The proposed approach provides a versatile framework for designing multicast switching networks with many a different tradeoffs between switching and conversion complexities to meet variety of application needs and technology constraints. A comparative analysis of the proposed multicast switching network and the existing design is also presented.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115741503","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}
M. Goyal, Weigao Xie, M. Soperi, S. Hosseini, K. Vairavan
{"title":"Scheduling routing table calculations to achieve fast convergence in OSPF protocol","authors":"M. Goyal, Weigao Xie, M. Soperi, S. Hosseini, K. Vairavan","doi":"10.1109/BROADNETS.2007.4550524","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550524","url":null,"abstract":"Fast convergence to topology changes is now a key requirement in routing infrastructures while reducing the routing protocol’s processing overhead continues to be as important as before. In this paper, we examine the problem of scheduling routing table updates in link state routing protocols. Commercial routers typically use a hold time based scheme to limit the number of routing table updates as new LSAs arrive at the router. The hold time schemes limit the number of routing table updates at the expense of increased delay in convergence to the new topology, which is clearly not acceptable any more. We analyze the performance of different hold time schemes and propose a new approach to schedule routing table updates, called LSA Correlation. Rather than using individual LSAs as triggers for routing table updates, LSA Correlation scheme correlates the information in the LSAs to identify the topology change that led to their generation. A routing table update is performed when a topology change has been identified. The analysis and simulation results presented in this paper suggest that the LSA Correlation scheme performs much better than the hold time based schemes for both isolated and large scale topology change scenarios.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131221867","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}
{"title":"A combined power-controlled protocol with adaptive MIMO gains for wireless networks","authors":"M. Z. Siam, M. Krunz","doi":"10.1109/BROADNETS.2007.4550514","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550514","url":null,"abstract":"Transmission power control (TPC) is used in wireless networks to improve channel reuse and/or reduce energy consumption. It has been applied mainly to single-input single-output (SISO) systems, where each node is equipped with a single antenna. Multi-input multi-output (MIMO) systems can improve the throughput or the signal-to-noise ratio (SNR) by providing multiplexing or diversity gains, respectively. In this paper, we propose a power-controlled MAC protocol that combines different types of MIMO gains in a wireless network with two antennas per node. Our protocol, coined CMAC, allows for dynamic switching between diversity and multiplexing modes so as to maximize a utility function that depends on both the energy consumption and throughput. CMAC adapts the “antenna mode,” the transmission power, and the modulation order on a per-packet basis. By “antenna mode“ we mean one of the five possible transmit/receive antenna configurations: 1×1 (SISO), 2×1 (MISO-D), 1×2 (SIMO-D), 2×2 (MIMO-D), and 2×2 (MIMO-M), where the second, third, and fourth configurations offer a diversity (D) gain, whereas the last configuration offers a multiplexing (M) gain. By using control packets to bound the transmission power of potentially interfering terminals, CMAC allows for multiple interference-limited transmissions to take place in the vicinity of a receiving terminal. We study via simulations the performance of CMAC in ad hoc topologies. Our results indicate that relative to non-adaptive protocols, CMAC achieves a significant improvement in both the overall energy consumption and the throughput.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127658634","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}
Shravan Gaonkar, Romit Roy Choudhury, L. Magalhães, R. Kravets
{"title":"Designing a rate-based transport protocol for wired-wireless networks","authors":"Shravan Gaonkar, Romit Roy Choudhury, L. Magalhães, R. Kravets","doi":"10.1109/BROADNETS.2007.4550410","DOIUrl":"https://doi.org/10.1109/BROADNETS.2007.4550410","url":null,"abstract":"A large majority of the Internet traffic relies on TCP as its transport protocol. In future, as the edge of the Internet continues to extend over the wireless medium, TCP (or its close variants) may not prove to be appropriate. The key reason is in TCP’s inability to discriminate congestion losses from transmission losses. Since transmission losses are frequent in wireless networks, the penalty from loss misclassification can become high, leading to performance degradation. This paper presents an eXtended Rate-based Transport Protocol (XRTP), designed to support communication over lossy wireless media. We depart from the ack-based rate control paradigm. Instead, we try to estimate the network conditions by injecting probe packets at the sender, and then observing the spacing between packets that arrive at the receiver. We show that these observations can be useful indicators of available bandwidth, network congestion, and even the cause of packet loss. The inferences from the observations are utilized to regulate the transmission rate at the sender, leading to desirable properties of congestion control and loss discrimination. Simulation results show the efficacy of our proposed rate-based protocol in lossy wireless environments.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127377256","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}