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.
We propose a new architectural approach, Cloud-Assisted Routing (CAR), that leverages high computation and memory power of cloud services for easing complex routing functions such as forwarding and flow level policy management. We aim to mitigate the increasing routing complexity to the cloud and to seek an answer to the following question: “Can techniques leveraging the memory and computation resources...
IC performance, power dissipation, size, and signal integrity are now dominated by interconnects. However, with ever-shrinking standard cells, blind minimization of interconnect during placement causes routing failures. Hence, we develop Coordinated Place-and-Route (CoPR) with (i) a Lightweight Incremental Routing Estimation (LIRE) frequently invoked during placement, (ii) placement techniques that...
Managing interference by Coordinated Multi-Point (CoMP) transmission/reception is an effective mechanism to achieve high data rates in future cellular networks, like Long Term Evolution (LTE)-Advanced. For CoMP, sets of Base Stations (BSs) have to be selected to jointly serve User Equipments (UEs). These sets are typically selected based on wireless characteristics only. However, using CoMP also poses...
Cognitive radio (CR) is a promising technology to solve the spectrum scarcity problem by enabling secondary users (SU) to utilize the spectrum holes of primary users (PU) caused by static spectrum allocation. However, SUs need to avoid the interference to PUs, imposing new challenges in routing protocol designs and throughput improvement in CR networks (CRN). In this paper we propose a cross-layer...
Wireless ad hoc networks suffer from several limitations, such as routing failures, potentially excessive bandwidth requirements, computational constraints and limited storage capability. Their routing strategy plays a significant role in determining the overall performance of the multi-hop network. However, in conventional network design only one of the desired routing-related objectives is optimized,...
In this paper, the energy-limited wireless multihop mesh networks are considered. Minimizing the total transmission energy in the network, while satisfying the applications' delay constraints, is the target of our optimization problem. To achieve this goal, energy-efficient design should be supported across all layers of the protocol stack through a cross-layer design. This paper proposes energy-efficient...
We study minimization of overall energy consumption of OFDMA systems, which are widely adopted in future wireless communications. Based on the existing resource allocation to minimize transmission energy, the computation energy increases due to the complexity of allocating algorithms. Since high performance algorithms usually have high complexity, there exist trade-offs between transmission energy...
While there has been many studies on the efficient design of p-cycles focusing on optimizing their spare capacity efficiency, few of them consider such a design under the wavelength continuity assumption, i.e., no wavelength converter at any node. Consequently, few authors look at the routing and wavelength assignment in the context of p-cycles, where p-cycles have to be assigned the same wavelength...
We address the optimal sink scheduling problem in wireless sensor networks (WSNs). The problem is inherently difficult since sink scheduling and data routing are tightly coupled. Previous approaches either have questionable performance due to no joint considerations, or are based on relaxed constraints. Our aim is to fill in this blank in the research. First, by discretizing continuous time, we develop...
One of the challenges in designing large distributed systems is to optimize the communication and dependencies between modules, where a trade-off between performance and ressource usage often must be made. This paper suggest a simple taxonomy for comparing potential designs, and provides also an algorithm for automatically suggesting good candidates. The algorithm is compared to previous work, where...
As sensornets are increasingly being deployed in mission-critical applications, it becomes imperative that we consider application QoS requirements in in-network processing (INP). Toward understanding the complexity of joint QoS and INP optimization, we study the problem of jointly optimizing packet packing (i.e., aggregating shorter packets into longer ones) and the timeliness of data delivery. We...
Network-on-Chip (NoC) is an evolving interconnection architecture addressing the rising complexity of system-on-chips (SoCs). We present a model for the cost of a NoC for a multiple use-case SoC, i.e., a system with distinct modes of operation, each having a unique traffic pattern. Specifically, we formulate an optimization problem capturing the fact that different use-cases can share capacity. We...
This paper describes the application of an autonomic paradigm to manage the complexity of software systems such as computational workflows. To demonstrate our approach, the workflow and the services comprising it are treated as managed resources controlled by hierarchically organized autonomic managers. By applying service-oriented software engineering principles, in particular enterprise integration...
We present a multi-objective optimization approach for joint throughput optimization and traffic engineering, where the routing request of traffic arrives one-by-one. We provide an Integer Linear Program (ILP) that simultaneously i) maximizes the aggregate throughput, ii) minimizes the resource consumption, and iii) minimizes the maximum link utilization. We study the impact of optimizing the three...
Vertex coloring is a well probed problem in graph theory. The problem of graph coloring is known to be NP-complete problem. Such NP complete problems can easily be solved with the help of distributed computing and parallelism, since distributed algorithms are applicable in many real life applications. In this paper we are using distributed algorithm for solving vertex coloring problem. The main objective...
Aiming at constructing a delay and delay variation bounded Steiner tree in the real-time streaming media communication, we discuss in this paper a multicast routing algorithm based on searching a directed graph (MRASDH).In the construction of the multicast tree, there always exist some nodes and links in the network topology that do not affect the outcome of the tree constructed. Therefore, based...
The growing demand for online media content delivery and multi-player gaming is expected to increase the amount of multicast service requests in both public and private networks. Careful traffic engineering of multicast service requests is becoming increasingly essential, as establishing the lowest cost tree, e.g., shortest path tree, in the network for every individual multicast request does not...
We describe a kind of supply chain optimization problem as a commodity stream routing problem upon a stochastic flow network. We divide the optimization problem to two parts: Firstly, establish model to calculate the optimal commodity stream allocation policy on all minimal paths; secondly, convert these allocation policy on all minimal paths to the optimal routing policy on all arcs. A multi-objective...
This paper presents an improved scheme for the vehicle routing problems with time windows based on ant colony optimization algorithm. The new scheme makes the change of heuristic message fast and speeds the convergence process by improving updating method of global pheromone and visibility strategy. Simulation results from eight groups of vehicle transportation case show that the new scheme performs...
Warehouses are obliged to optimize their operations with regard to multiple objectives, such as maximizing effective use space, equipment, labor, maximize accessibility of products, maximize amount of processed orders and all this should be achieved whilst minimizing order processing times, distance traveled, broken promises, errors and not to forget the operational cost. A product placement problem...
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.