The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Routing traffic subject to hose model constraints has been of much recent research interest. Two-phase routing has been proposed as a mechanism for routing traffic in the hose model. It has desirable properties in being able to statically preconfigure the transport network and in being able to handle constraints imposed by specialized service overlays. In this paper, we investigate whether the desirable...
Several studies exhibit that the traffic load of the routers only has a small influence on their energy consumption. Hence, the power consumption in networks is strongly related to the number of active network elements, such as interfaces, line cards, base chassis. The goal thus is to find a routing that minimizes the (weighted) number of active network elements used when routing. In this paper, we...
In this paper, a practical routing protocol that maximizes the guaranteed node traffic loads in reliable networks is designed and analyzed. The derived node traffic loads can be routed for every traffic pattern, and regardless of the possible single node or link failures. First, it is described how load balanced shortest path routing (LB-SPR) can be optimized to maximize the value of the guaranteed...
The restoration based on P-Cycle offers ring-like speed and mesh-like capacity efficiency, but the major challenge resides in finding an optimal set of P-Cycles. A new restoration method named Pre-planned restoration rail (P-Rail) is proposed, and formulates the optimized Integer Linear Programming (ILP) algorithm and the sub-cycle rerouting algorithm. P-Rail yields the harsh need of restoration time...
The transport traffic in WDM optical networks are provided to the networks customers in the form of lightpath via virtual topology reconfiguration (VTR), thus the algorithm to perform such an VTR has crucial impact on the resource usage efficiency. This paper proposes the routing algorithm of the Virtual Topology Reconfiguration based on the Genetic Algorithm (VTR-GA) for static traffic in the IP/WDM...
In this paper, we propose to apply multipath routing in optical networks for the emerging high-performance applications with extremely high bandwidth requirements, typically larger than the capacity of one wavelength. To this end, we present a novel Multipath lightpath Provisioning mechanism and derive an optimal solution by an ILP (Integer Linear Programming) approach, with differential delay and...
The performance of multi-radio multi-channel wireless mesh networks (WMNs) based on the IEEE 802.11 technology depends significantly on how the channels are assigned to the radios and how traffic is routed between the access points and the gateways. In this paper we propose an algorithmic approach to this problem, for which no conclusive solution has been put forward in the literature so far. The...
This paper investigates the diverse routing problem in the presence of shared risk link groups (SRLGs) and proposes two ILP models for partial SRLG-disjoint protection based on grouping of the individual SRLGs in classes. We demonstrate our approach with SRLGs constructed from seismic maps, hence reducing the likelihood of a single earthquake affecting large portions of the network. Compared with...
In this paper we present a framework to investigate the effects of tunable data compression on sensor network lifetime. In our framework we integrate tunable data compression with flow balancing to extend the overall system lifetime beyond the lifetime achievable by flow balancing and single level mandatory data compression. Analysis of energy balancing through flow balancing in conjunction with tunable...
We study the localization problem in sensor networks by using local angle measurement. Localization using local angle information was recently proposed as an effective localization technique, which can be used for geographical routing with guaranteed delivery. However, the existing approach is based on linear programming (LP) and can not be implemented distributedly. We propose, design, and evaluate...
This paper addresses offline virtual topology design in transparent optical networks under given periodic traffic. We call this planning problem ldquoScheduled Virtual Topology Designrdquo. Two problem variants are considered: for a network based on non-reconfigurable equipment and for a network based on reconfigurable equipment. Two MILP (Mixed Integer Linear Program) formulations are proposed, one...
We present a multi-path computation algorithm to find a set of paths for the given demand and use Integer Linear Programming (ILP) approach to derive an optimal solution to maximize the achievable bandwidth and minimize the required memory size. We discuss the applicability of the proposed methods in multi-domain settings and present three application schemes in a multi-homing environment. Numerical...
Fast recovery from failures and overall high utilization of network capacity are two primary goals of network survivability design. Shared backup path protection has been shown to be efficient in terms of capacity utilization, due to the sharing capability among protection paths. However, the resulting integer linear programming (ILP) formulation of the problem is known to be NP-hard. This paper tackles...
Capacity limitation is one of the fundamental issues in wireless mesh networks. The aggregate capacity can be increased by equipping each mesh router with multiple radios tuned into distinct frequency channels. However, most past research efforts that attempt to exploit multiple channels assume orthogonal channels of fixed pre-determined width, which prohibits the further effective use of spectrum...
In this paper, we consider the problem of topology control by joint power control and routing to maximize the network throughput in wireless mesh networks. First, we present two mathematical formulations of the joint power control and routing problem according to two different definitions of network throughput: the total throughput and the minimal per-node throughput. To reduce the computation cost,...
In this paper, we focused on optimizing the total cost of bidirectional ring topology in the metropolitan area by proposing an integer linear programming (ILP) formulation integrated with optimal traffic splitting. Our simulation results give the lowest total cost in comparison with random case and heuristic method based on maximizing total single-hop traffic. In case of considering only the bandwidth...
This paper evaluates the balance between the cost of multifibres and the cost of wavelength converters in multilayer networks. A novel ILP formulation of the static planning problem is applied.
In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a major impact on the capacity provided to the clients. A cross-layer optimization of these problems allows the routing to take into account contentions due to radio interferences. We develop exact linear programs and provide an...
Component failure in a WDM network is a serious problem that has attracted considerable attention in recent times. In a standard protection (or restoration) scheme the objective is to preserve the logical topology by switching over to back-up paths (or by setting up new lightpaths) after a fault occurs. In this paper we have proposed a new scheme where we handle a fault simply by modifying the traffic...
In wireless sensor networks, the data aggregation is an essential paradigm for routing, through which the multiple data from different sensors can be aggregated into a single data at intermedial nodes enroute, in order to eliminate data redundancy and achieve the goal of saving energy. Some existed medium access protocols and algorithms can effectively prolong the lifetime of the sensor network by...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.