algorithm in white papers
Hybrid Bandwidth Scheduling for CAN-Based Networked Control Systems
White Paper Moreover, considering the constraints of control performance and network schedulability, a heuristic branch and bound & Genetic Algorithm (GA) algorithm is presented for the control data to minimize their bandwidth occupancy and the jitter caused... [11 Jul 2008]
Memory and Network Bandwidth Aware Scheduling of Multiprogrammed Workloads on Clusters of SMPs
White Paper Then, the paper presents the design and implementation of an informed gang-like scheduling algorithm aimed at improving the throughput of multiprogrammed workloads on clusters of SMPs. The algorithm selects the processes to be coscheduled so as not... [11 Jul 2008]
Towards Stateless Core: Improving SIP Proxy Scalability
White Paper It proposes an algorithm that determines for each incoming request when to store transaction information. The goal of this algorithm is to increase throughput by reducing the number of transactions without compromising call setup times. [11 Jul 2008]
Quality of Service Routing in MPLS Networks Using Delay and Bandwidth Constraints
White Paper This paper proposes a new constraint based routing algorithm for MPLS networks. The proposed algorithm which is a modification of Wang-Crowcroft algorithm, uses both bandwidth and delay constraints. Multi-Protocol Label Switching (MPLS) has been... [11 Jul 2008]
Robust Bandwidth Extension of Noise-Corrupted Narrowband Speech
White Paper This paper presents a new bandwidth extension algorithm for converting narrowband telephone speech into wideband speech using a transformation in the mel cepstral domain. Unlike previous approaches, the proposed method is designed specifically for... [11 Jul 2008]
Implementation of Dynamic Bandwidth Allocation Within Open Modular Router
White Paper This paper describes the design and implementation of a dynamic bandwidth allocation algorithm for the management of quality of service within the Internet. A threshold-based scheme is implemented and extended with a measurement-based approach, and... [11 Jul 2008]
Geometric Spanners for Routing in Mobile Networks
White Paper Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This paper proposes a new routing graph, the Restricted Delaunay Graph (RDG), for mobile ad hoc networks. [11 Jul 2008]
GPON Service Level Agreement Based Dynamic Bandwidth Assignment Protocol
White Paper In particular the novel algorithm automatically modifies the assigned bandwidth per optical network unit to support quality of service and service level agreement according to maximum network capacity and users' queuing status. [11 Jul 2008]
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
White Paper It present a distributed landmark selection algorithm that does not rely on global clock synchronization, and a companion local greedy landmark-based routing scheme. This paper study the problem of landmark selection for landmark-based routing in a... [11 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 to its sink is not just a... [11 Jul 2008]
On Orthogonal Reduction to Hessenberg Form With Small Bandwidth
White Paper This reduction can be computed by the Arnoldi algorithm. Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix A to a more convenient form. One of the most useful types of such reduction is the orthogonal... [11 Jul 2008]
Optimal Replica Placement in Tree Networks With QoS and Bandwidth Constraints and the Closest Allocation Policy
White Paper The paper proposes an optimal algorithm in two passes using dynamic programming. This paper deals with the replica placement problem on fully homogeneous tree networks known as the Replica Placement optimization problem. [11 Jul 2008]
Very Fast Optimal Bandwidth Selection for Univariate Kernel Density Estimation
White Paper This paper proposes a computationally efficient å - exact approximation algorithm for the univariate Gaussian kernel based density derivative estimation that reduces the computational complexity from O(MN) to linear O(N + M). [11 Jul 2008]
Adaptive-SDR: Adaptive Swarm-Based Distributed Routing
White Paper This paper propose one such routing algorithm, dubbed Adaptive Swarm-based Distributed Routing (Adaptive-SDR), which is scalable, robust and suitable to handle large amounts of network traffic, while minimizing delay and packet loss. [11 Jul 2008]
Unicast Routing: Cost-Performance Tradeoffs
White Paper This paper surveys a range of routing solutions, which can be categorized depending on the degree of the awareness of the algorithm: QoS/Constraint-based routing solutions are aware of traffic requirements of individual connection requests... [11 Jul 2008]
Keep updated for stories matching algorithm in white papers via RSS
