polynomial
RSS polynomialMulticast Routing Optimization Algorithm With Bandwidth and Delay Constraints Based on GA
White Paper Determination of such QoS-based optimal multicast routes basically leads to a multi-objective optimization problem, which is computationally intractable in polynomial time due to the uncertainty of resources in networks. [19 Sep 2008]
Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints
White Paper The paper proposes a polynomial time near-optimal algorithm which recursively computes minimum weighted Dominating Sets (DS), while consistently preserving QoS requirements across iterations. In a Wireless Mesh Network... [04 Aug 2008]
Replicated Server Placement With QoS Constraints
White Paper A pseudopolynomial and a polynomial algorithm that provide guaranteed approximation factors with respect to the optimal for the problem at hand are presented. The problem of placing replicated servers with QoS... [04 Aug 2008]
Simulation Analysis of QoS Unicast Routing Algorithms With Uncertain Information
White Paper The results of extensive simulation show that pseudo-polynomial algorithm and heuristic algorithm surpass randomized routing algorithm in performance, and the solution of pseudo-polynomial algorithm is... [18 Jul 2008]
A New QoS Routing Framework for Solving MCP
White Paper One purpose of Quality-of-Service (QoS) routing is to develop polynomial-time heuristic algorithms to tackle the MCP (Multi-Constrained-Path) problem, which is NP-complete. This paper introduces a new QoS routing... [18 Jul 2008]
Semi-Oblivious Routing: Lower Bounds
White Paper In semi-oblivious routing like oblivious routing, the algorithm should select only a polynomial number of paths between the source and the sink of each commodity, but unlike oblivious routing, the flow from each source... [11 Jul 2008]
Optimal Bandwidth Reservation in Hose-Model VPNs With Multi-Path Routing
White Paper On the one hand, the paper presents an optimal polynomial-time algorithm that computes a bandwidth reservation of minimum cost using multi-path routing. A Virtual Private Network (VPN) provides private network... [11 Jul 2008]
Online Client-Server Load Balancing Without Global Information
White Paper In contrast to that work, it proves a strong lower bound (polynomial in n, the size of the graph) on the competitive ratio of any oblivious algorithm. A distributed online algorithm is considered for maximizing... [10 Jul 2008]
Robin Hood: An Active Objects Load Balancing Mechanism for Intranet
White Paper An optimal load balance in a non-preemptive scheduling environment is NP-complete, but preemptive scheduling is polynomial. Scheduling in distributed systems is an important issue, and it has performance impact on... [10 Jul 2008]
Photos: Babbage's Difference masterpiece in action
Photo To remove room for human error in basic mathematical computations, Babbage designed the Engine to calculate tables of polynomial functions to 31 decimal points. Charles Babbage's Difference Engine number 2 is making its... [12 May 2008]
India's high-tech cities, web whispers, Babbage's Difference engine and more...
Photo Tech millionaire Nathan Myhrvold commissioned London's Science Museum to make him a version of Charles Babbage's famous Difference engine, a machine designed to mechanically calculate polynomial functions. [29 Apr 2008]
Photos: Charles Babbage's masterpiece reincarnated
Photo Tech millionaire Nathan Myhrvold commissioned London's Science Museum to make him a version of Charles Babbage's famous Difference engine, a machine designed to mechanically calculate polynomial functions. [10 Apr 2008]
On Survivable Access Network Design: Complexity and Algorithms
White Paper Then two polynomial-time approaches are developed, indirect and direct, for the Simplex Cover problem. With economic constraints and limited routing capability, the structure of an access network is typically a "fat... [12 Jan 2008]
Combinatorics of TCP Reordering
White Paper It shows that given a buffer sequence B, constructing a sequence A of IDs that belongs to the preimage of B is no harder than finding matchings in bipartite graph, Counting the number of sequences A of packet IDs that belong to the... [20 Dec 2007]
Approximation for Minimum Multicast Route in Optical Network With Nonsplitting Nodes
White Paper Previously, the best known polynomial-time approximation has the performance ratio 3. This paper presents a new polynomial-time approximation with performance ratio of 1+ñ, where ñ is the best known... [31 Aug 2007]
