problem paper considers
Optimal Routing With Multiple Traffic Matrices Tradeoff Between Average Case and Worst Case Performance
White Paper This paper considers the problem of finding an "Efficient" and "Robust" set of routes in the face of changing/uncertain traffic. Goal of this paper is to find a set of routes that result in good average case performance over the set of traffic... [18 Jul 2008]
Optimal Routing With Multiple Traf?c Matrices Tradeoff Between Average and Worst Case Performance
White Paper This paper considers the problem of finding an "Efficient" and "Robust" set of routes in the face of changing/uncertain traffic. Goal of this paper is to find a set of routes that result in good average case performance over the set of traffic... [18 Jul 2008]
Non-Adaptive Fault Diagnosis for All-Optical Networks Via Combinatorial Group Testing on Graphs
White Paper This paper considers the fault diagnosis problem in all-optical networks, focusing on probing schemes to detect faults. This fault diagnosis problem motivates a new technical framework that the paper introduces: group testing with graph-based... [18 Jul 2008]
QoS Topology Control in Ad Hoc Wireless Networks
White Paper The paper considers two cases of the problem: the traffic demands are not splittable, and the traffic demands are splittable. This paper discusses the energy efficient QoS topology control problem in ad hoc wireless networks. [18 Jul 2008]
Optimizing Request Denial and Latency in an Agent-Based VPN Architecture
White Paper This paper considers the problem of connecting users of an organization to an optimal VPN server location so that request denial probability and latency are balanced. Agent-Based Virtual private networks Architecture (ABVA) refers to the... [18 Jul 2008]
How Bad Is Selfish Routing?
White Paper This paper considers the problem of routing traffic to optimize the performance of a congested network. A network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge... [11 Jul 2008]
Proportionally Fair Allocation of End-to-End Bandwidth in STDMA Wireless Networks
White Paper This paper considers the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. In the process, the paper introduces a novel decomposition method for convex... [11 Jul 2008]
Optimal Granularity of MPLS Tunnels
White Paper This paper considers the problem of tunneling MPLS Label Switched Paths (LSPs) over an optical network in which รข-channels (lightpaths) of a fixed capacity are the main mechanism of transport. This paper presents an efficient dynamic programming... [11 Jul 2008]
Network Protection Design for MPLS Networks
White Paper This paper considers the problem of designing partially and fully survivable explicit label switched paths for MPLS networks. The paper also evaluates the performance of the models presented, in terms of total used capacity in the network. [11 Jul 2008]
Efficient Use of Memory Bandwidth to Improve Network Processor Throughput
White Paper This paper considers the efficiency of packet buffers used in packet switches built using Network Processors (NPs). The problem addressed in this paper is that a typical NP workload may be unable to utilize the peak DRAM bandwidth. [11 Jul 2008]
Lightpath Topology Configuration for Wavelength-Routed IP/MPLS Networks for Time-Dependent Traffic
White Paper This paper considers the integrated design problem of configuration of lightpath topology and optimal routing of IP/MPLS tunnels on this lightpath topology for time-varying traffic. Two variants of the problem are considered: in the first variant... [11 Jul 2008]
Queueing Model for Performance Analysis of a Network Interface Card
White Paper This paper considers a Network Interface Card (NIC) and develops an analytical model to predict its performance. The complexity of the problem is due to the fact that it is a combination of multi-class queueing network with class switching, polling... [11 Jul 2008]
Semi-Matchings for Bipartite Graphs and Load Balancing
White Paper This paper considers the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. It refers to this problem as the semi-matching problem; it is a relaxation of the known bipartite matching problem. [10 Jul 2008]
Decentralized Dynamic Load Balancing: The Particles Approach
White Paper This paper considers the problem of mapping tasks to processor nodes at run-time in multiprogrammed multicomputer systems (i.e.message passing MIMD-systems). Besides load balancing, the goal is to place intensively communicating tasks close... [10 Jul 2008]
A Truthful Mechanism for Fair Load Balancing in Distributed Systems
White Paper This paper considers the problem of designing load balancing protocols in distributed systems where the participants (e.g.computers, users) are capable of manipulating the load allocation algorithm in their own interest. [10 Jul 2008]
Keep updated for stories matching problem paper considers via RSS
