Topology Reconfiguration with Successive Approximations

Recent technologies have enabled the formation of point-to-point directional wireless networks that are capable of dynamic changes in the network topology. The process of changing this topology in response to changes in available link capacities and load demands of various nodes is called topology control. One example of the type of communication network studied in this context is a Free Space Optical (FSO) network. Topology control consists of computing new topologies to dynamically optimize the network under changing traffic conditions and then carrying out the reconfiguration process to achieve the target topology. This thesis considers the process of topology reconfiguration and use the packet drops that happen during this process as a cost metric for this process. It is shown that by implementing the topology reconfiguration as a series of smaller steps (successive approximation), the number of packets that are dropped during the reconfiguration are reduced. Using this knowledge, the topology computation algorithm can be refined to also minimize the reconfiguration cost along with the typical objective of minimizing congestion

Traffic engineering in dynamic optical networks

Traffic Engineering (TE) refers to all the techniques a Service Provider employs to improve the efficiency and reliability of network operations. In IP over Optical (IPO) networks, traffic coming from upper layers is carried over the logical topology defined by the set of established lightpaths. Within this framework then, TE techniques allow to optimize the configuration of optical resources with respect to an highly dynamic traffic demand. TE can be performed with two main methods: if the demand is known only in terms of an aggregated traffic matrix, the problem of automatically updating the configuration of an optical network to accommodate traffic changes is called Virtual Topology Reconfiguration (VTR). If instead the traffic demand is known in terms of data-level connection requests with sub-wavelength granularity, arriving dynamically from some source node to any destination node, the problem is called Dynamic Traffic Grooming (DTG). In this dissertation new VTR algorithms for load balancing in optical networks based on Local Search (LS) techniques are presented. The main advantage of using LS is the minimization of network disruption, since the reconfiguration involves only a small part of the network. A comparison between the proposed schemes and the optimal solutions found via an ILP solver shows calculation time savings for comparable results of network congestion. A similar load balancing technique has been applied to alleviate congestion in an MPLS network, based on the efficient rerouting of Label-Switched Paths (LSP) from the most congested links to allow a better usage of network resources. Many algorithms have been developed to deal with DTG in IPO networks, where most of the attention is focused on optimizing the physical resources utilization by considering specific constraints on the optical node architecture, while very few attention has been put so far on the Quality of Service (QoS) guarantees for the carried traffic. In this thesis a novel Traffic Engineering scheme is proposed to guarantee QoS from both the viewpoint of service differentiation and transmission quality. Another contribution in this thesis is a formal framework for the definition of dynamic grooming policies in IPO networks. The framework is then specialized for an overlay architecture, where the control plane of the IP and optical level are separated, and no information is shared between the two. A family of grooming policies based on constraints on the number of hops and on the bandwidth sharing degree at the IP level is defined, and its performance analyzed in both regular and irregular topologies. While most of the literature on DTG problem implicitly considers the grooming of low-speed connections onto optical channels using a TDM approach, the proposed grooming policies are evaluated here by considering a realistic traffic model which consider a Dynamic Statistical Multiplexing (DSM) approach, i.e. a single wavelength channel is shared between multiple IP elastic traffic flows

Scheduling algorithms for throughput maximization in data networks

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.Includes bibliographical references (p. 215-226).This thesis considers the performance implications of throughput optimal scheduling in physically and computationally constrained data networks. We study optical networks, packet switches, and wireless networks, each of which has an assortment of features and constraints that challenge the design decisions of network architects. In this work, each of these network settings are subsumed under a canonical model and scheduling framework. Tools of queueing analysis are used to evaluate network throughput properties, and demonstrate throughput optimality of scheduling and routing algorithms under stochastic traffic. Techniques of graph theory are used to study network topologies having desirable throughput properties. Combinatorial algorithms are proposed for efficient resource allocation. In the optical network setting, the key enabling technology is wavelength division multiplexing (WDM), which allows each optical fiber link to simultaneously carry a large number of independent data streams at high rate. To take advantage of this high data processing potential, engineers and physicists have developed numerous technologies, including wavelength converters, optical switches, and tunable transceivers.(cont.) While the functionality provided by these devices is of great importance in capitalizing upon the WDM resources, a major challenge exists in determining how to configure these devices to operate efficiently under time-varying data traffic. In the WDM setting, we make two main contributions. First, we develop throughput optimal joint WDM reconfiguration and electronic-layer routing algorithms, based on maxweight scheduling. To mitigate the service disruption associated with WDM reconfiguration, our algorithms make decisions at frame intervals. Second, we develop analytic tools to quantify the maximum throughput achievable in general network settings. Our approach is to characterize several geometric features of the maximum region of arrival rates that can be supported in the network. In the packet switch setting, we observe through numerical simulation the attractive throughput properties of a simple maximal weight scheduler. Subsequently, we consider small switches, and analytically demonstrate the attractive throughput properties achievable using maximal weight scheduling. We demonstrate that such throughput properties may not be sustained in larger switches.(cont.) In the wireless network setting, mesh networking is a promising technology for achieving connectivity in local and metropolitan area networks. Wireless access points and base stations adhering to the IEEE 802.11 wireless networking standard can be bought off the shelf at little cost, and can be configured to access the Internet in minutes. With ubiquitous low-cost Internet access perceived to be of tremendous societal value, such technology is naturally garnering strong interest. Enabling such wireless technology is thus of great importance. An important challenge in enabling mesh networks, and many other wireless network applications, results from the fact that wireless transmission is achieved by broadcasting signals through the air, which has the potential for interfering with other parts of the network. Furthermore, the scarcity of wireless transmission resources implies that link activation and packet routing should be effected using simple distributed algorithms. We make three main contributions in the wireless setting. First, we determine graph classes under which simple, distributed, maximal weight schedulers achieve throughput optimality.(cont.) Second, we use this acquired knowledge of graph classes to develop combinatorial algorithms, based on matroids, for allocating channels to wireless links, such that each channel can achieve maximum throughput using simple distributed schedulers. Third, we determine new conditions under which distributed algorithms for joint link activation and routing achieve throughput optimality.by Andrew Brzezinski.Ph.D

Self-Evaluation Applied Mathematics 2003-2008 University of Twente

This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008

Effect Of Reconfiguration On Ip Packet Traffic In Wdm Networks

Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2007Thesis (M.Sc.) -- İstanbul Technical University, Institute of Science and Technology, 2007Günümüzde iletişim ağlarına erişen insan sayısı ve iletişim uygulamalarının ihtiyaç duyduğu band genişliği ihtiyacı hızla artmaya devam etmektedir. Artan trafik istekleri daha geniş band genişliği kullanımına olanak verebilen optik iletişim ağlarının tasarımını tetiklemektedir. Bir veya daha fazla sayıda optik fiberi kapsayabilen bir ışıkyolu alt katmanda yer alan optik altyapının üzerinde iletişim kanalları sağlamaktadır. Sanal topoloji tasarımı, verilen bir trafik matrisine göre bir grup ışık yolunun kurulması olarak tanımlanabilir. Trafikte meydana gelecek bir değişiklik yeniden konfigürasyon kararının alınmasına neden olabilir. Sanal topoloji yeniden konfigürasyonu, hem yeni sanal topolojinin belirlenmesini hem de bu yeni topolojiye geçişi içermektedir. Bu tez çalışmasında IP/WDM ağlarda sanal topoloji yeniden konfigürasyonunun IP paket trafiği üzerindeki etkileri incelenmiştir. Çalışma kapsamında, çeşitli yeniden kofigürasyon algoritmaları gerçeklenmiş ve Fishnet tabanlı bir IP simülatörü üzerinde test edilmiştir. Gerçeklenen sanal topoloji tasarım algoritmalarına ait paket gecikmeleri/kayıpları incelenmiş ve algoritmaların başarımları karşılaştırılmıştır.Today, both the amount of people accessing communication networks and new communication applications which require high data transfer rates are exponentially increasing. Growing traffic demands triggered the design of optical communication networks which will be able to provide larger bandwidth utilization. A lightpath, which can span multiple fiber links, provides communication channels over the underlying optical communication infrastructure. Virtual Topology Design (VTD) means establishment of a set of lightpaths under a given traffic pattern. A change in traffic pattern may trigger reconfiguration decision. Virtual Topology Reconfiguration (VTR) contains determination of a new virtual topology and migration between the old and new virtual topologies. In this thesis, the effects of virtual topology reconfiguration on Internet Protocol (IP) packet traffic on IP over WDM networks were studied. Various reconfiguration algorithms were implemented and tested on a Fishnet based IP simulator. Packet delays/losses are investigated during reconfiguration procedure for performance comparison of implemented reconfiguration algorithms.Yüksek LisansM.Sc

On applying network coding to wireless ad hoc networks : A study of robustness, efficiency and cross-layer synergy

Ph.DDOCTOR OF PHILOSOPH

Optical Wireless Data Center Networks

Bandwidth and computation-intensive Big Data applications in disciplines like social media, bio- and nano-informatics, Internet-of-Things (IoT), and real-time analytics, are pushing existing access and core (backbone) networks as well as Data Center Networks (DCNs) to their limits. Next generation DCNs must support continuously increasing network traffic while satisfying minimum performance requirements of latency, reliability, flexibility and scalability. Therefore, a larger number of cables (i.e., copper-cables and fiber optics) may be required in conventional wired DCNs. In addition to limiting the possible topologies, large number of cables may result into design and development problems related to wire ducting and maintenance, heat dissipation, and power consumption. To address the cabling complexity in wired DCNs, we propose OWCells, a class of optical wireless cellular data center network architectures in which fixed line of sight (LOS) optical wireless communication (OWC) links are used to connect the racks arranged in regular polygonal topologies. We present the OWCell DCN architecture, develop its theoretical underpinnings, and investigate routing protocols and OWC transceiver design. To realize a fully wireless DCN, servers in racks must also be connected using OWC links. There is, however, a difficulty of connecting multiple adjacent network components, such as servers in a rack, using point-to-point LOS links. To overcome this problem, we propose and validate the feasibility of an FSO-Bus to connect multiple adjacent network components using NLOS point-to-point OWC links. Finally, to complete the design of the OWC transceiver, we develop a new class of strictly and rearrangeably non-blocking multicast optical switches in which multicast is performed efficiently at the physical optical (lower) layer rather than upper layers (e.g., application layer). Advisors: Jitender S. Deogun and Dennis R. Alexande

Bandwith allocation and scheduling in photonic networks

This thesis describes a framework for bandwidth allocation and scheduling in the Agile All-Photonic Network (AAPN). This framework is also applicable to any single-hop communication network with significant signalling delay (such as satellite-TDMA systems). Slot-by-slot scheduling approaches do not provide adequate performance for wide-area networks, so we focus on frame-based scheduling. We propose three novel fixed-length frame scheduling algorithms (Minimum Cost Search, Fair Matching and Minimum Rejection) and a feedback control system for stabilization.MCS is a greedy algorithm, which allocates time-slots sequentially using a cost function. This function is defined such that the time-slots with higher blocking probability are assigned first. MCS does not guarantee 100% throughput, thought it has a low blocking percentage. Our optimum scheduling approach is based on modifying the demand matrix such that the network resources are fully utilized, while the requests are optimally served. The Fair Matching Algorithm (FMA) uses the weighted max-min fairness criterion to achieve a fair share of resources amongst the connections in the network. When rejection is inevitable, FMA selects rejections such that the maximum percentage rejection experienced in the network is minimized. In another approach we formulate the rejection task as an optimization problem and propose the Minimum Rejection Algorithm (MRA), which minimizes total rejection. The minimum rejection problem is a special case of maximum flow problem. Due to the complexity of the algorithms that solve the max-flow problem we propose a heuristic algorithm with lower complexity.Scheduling in wide-area networks must be based on predictions of traffic demand and the resultant errors can lead to instability and unfairness. We design a feedback control system based on Smith's principle, which removes the destabilizing delays from the feedback loop by using a "loop cancelation" technique. The feedback control system we propose reduces the effect of prediction errors, increasing the speed of the response to sudden changes in traffic arrival rates and improving the fairness in the network through equalization of queue-lengths

Asymptotic performance of queue length based network control policies

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.Cataloged from PDF version of thesis.Includes bibliographical references (p. 199-204).In a communication network, asymptotic quality of service metrics specify the probability that the delay or buffer occupancy becomes large. An understanding of these metrics is essential for providing worst-case delay guarantees, provisioning buffer sizes in networks, and to estimate the frequency of packet-drops due to buffer overflow. Second, many network control tasks utilize queue length information to perform effectively, which inevitably adds to the control overheads in a network. Therefore, it is important to understand the role played by queue length information in network control, and its impact on various performance metrics. In this thesis, we study the interplay between the asymptotic behavior of buffer occupancy, queue length information, and traffic statistics in the context of scheduling, flow control, and resource allocation. First, we consider a single-server queue and deal with the question of how often control messages need to be sent in order to effectively control congestion in the queue. Our results show that arbitrarily infrequent queue length information is sufficient to ensure optimal asymptotic decay for the congestion probability, as long as the control information is accurately received. However, if the control messages are subject to errors, the congestion probability can increase drastically, even if the control messages are transmitted often. Next, we consider a system of parallel queues sharing a server, and fed by a statistically homogeneous traffic pattern. We obtain the large deviation exponent of the buffer overflow probability under the well known max-weight scheduling policy. We also show that the queue length based max-weight scheduling outperforms some well known queue-blind policies in terms of the buffer overflow probability. Finally, we study the asymptotic behavior of the queue length distributions when a mix of heavy-tailed and light-tailed traffic flows feeds a system of parallel queues. We obtain an exact asymptotic queue length characterization under generalized max-weight scheduling. In contrast to the statistically homogeneous traffic scenario, we show that max-weight scheduling leads to poor asymptotic behavior for the light-tailed traffic, whereas a queue-blind priority policy gives good asymptotic behavior.by Krishna Prasanna Jagannathan.Ph.D