problem optimization
Design of Hybrid Optical Networks With Waveband and Electrical TDM Switching
White Paper The paper investigates the network-optimization problem with static traffic to minimize the overall network switch cost. A mathematical formulation of the optimization problem and its solutions are presented. [18 Jul 2008]
Routing and Wavelength Assignment in Optical Networks
White Paper This paper proposes several novel optimization problem formulations that offer the promise of radical improvements over the existing methods. The problem of Routing and Wavelength Assignment (RWA) is critically important for increasing the... [18 Jul 2008]
On Optimal Routing With Multiple Traffic Matrices
White Paper Routing optimization is used to find a set of routes that minimizes cost (delay, utilization). Previous work has addressed this problem for the case of a known, static end-to-end traffic matrix. In the Internet, it is difficult to accurately... [18 Jul 2008]
VFMAs, Virtual-Flow Multipath Algorithms for MPLS
White Paper The virtual-flow multipath routing problem is formulated as a MultiCommodity Network Flow (MCNF) problem, and is solved by implementing on-line the Dantzig-Wolfe decomposition method, which is proven to converge to the optimal solution through an... [18 Jul 2008]
Proportionally Fair Allocation of End-to-End Bandwidth in STDMA Wireless Networks
White Paper In the process, the paper introduces a novel decomposition method for convex optimization, establish its convergence for the utility maximization problem and demonstrate how it suggests a distributed solution based on flow control optimization and... [11 Jul 2008]
Optimal Replica Placement in Tree Networks With QoS and Bandwidth Constraints and the Closest Allocation Policy
White Paper This paper deals with the replica placement problem on fully homogeneous tree networks known as the Replica Placement optimization problem. The latter problem is investigated using the Closest access policy when adding QoS and bandwidth constraints. [11 Jul 2008]
A Column-Generation and Branch-and-Cut Approach to the Bandwidth-Packing Problem
White Paper The bandwidth-packing problem is a combinatorial optimization problem arising from telecommunication networks where demand exceeds capacity and where point-to-point calls with varying bandwidths are routed on this network such that each call uses... [11 Jul 2008]
Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach
White Paper With the concept of utility functions, where each source uses a utility function to evaluate the benefit from achieving a transmission rate, it is interpreted the resource allocation problem as a global optimization problem. [11 Jul 2008]
Latency- and Bandwidth-Minimizing Optimal Failure Detectors
White Paper This paper examines this central tradeoff, formalize it as an optimization problem and analytically derive the optimal closed form formulas for multi-node failure detectors. Failure detectors are fundamental building blocks in distributed systems. [11 Jul 2008]
Capacity Planning of Survivable MPLS Networks Supporting DiffServ
White Paper The problem is formulated as an optimization problem, where the routes are jointly selected for edge to edge EF and BE user demand pairs, and assign a discrete capacity value for each link. It is essential for ISPs to offer both performance and... [11 Jul 2008]
Throughput-Centric Routing Algorithm Design
White Paper Globally optimal solutions to these optimization problems can be efficiently found, yielding provably good oblivious routing algorithms. This paper shows that the problem of designing oblivious routing algorithms that have high worst-case or... [11 Jul 2008]
Throughput Optimization and Fair Bandwidth Allocation in Multi-Hop Wireless LANs
White Paper A number of researchers have studied this problem in the context of (single-hop) Wireless Local Area Networks (WLANs), where clients directly exchange traffic with Access Points (APs). There is an inherent well-known conflict between fairness and... [11 Jul 2008]
A Genetic Optimization Algorithm to Solve the Problem of the Load-Balancing of Network Load
White Paper The algorithm carries on the entire spatial parallel search which concentrates on the high performance parts in order to improve the efficiencies and robustness of the search with no restriction to the optimization objective function. [10 Jul 2008]
Outbound Load Balancing in BGP Using Online Simulation
White Paper It presents an optimization-based approach for this problem without modifying BGP protocol in any way. In this approach, the load balancing problem is generalized as a black-box optimization problem. This approach is also very flexible in that... [10 Jul 2008]
Link Dimensioning and LSP Optimization for MPLS Networks Supporting DiffServ EF and BE Traffic Classes
White Paper This paper addresses the problem of link dimensioning and Lable Switching Path (LSP) optimization for MPLS networks supporting DiffServ EF and BE traffic classes. The problem is formulated as an optimization problem, where the goal is to minimize... [10 Jul 2008]
Keep updated for stories matching problem optimization via RSS
