Sciweavers

6682 search results - page 174 / 1337
» networks 2006
Sort
View
NETWORK
2007
86views more  NETWORK 2007»
13 years 8 months ago
Quality of Service and the End-to-End Argument
—Audio-visual services are now commonly used on the Internet. Many are based on batch downloading of contents for later replay, but real-time interactive and streaming services a...
Gunnar Karlsson, Ignacio Más Ivars
CSREAESA
2006
13 years 10 months ago
An Efficient Design of High Speed Network Security Platform using Network Processor
: The explosive growth of internet traffic and the increasing complexity of the functions performed by network nodes have given rise to a new breed of programmable micro-processors...
Yong-Sung Jeon, Sang-Woo Lee, Ki-Young Kim
NETWORKS
2006
13 years 9 months ago
A simple algorithm that proves half-integrality of bidirected network programming
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
Ethan D. Bolker, Thomas Zaslavsky
FTNET
2006
47views more  FTNET 2006»
13 years 9 months ago
Cooperative Communications
This article reviews progress in cooperative communication networks. Our survey is by no means exhaustive. Instead, we assemble a representative sample of recent results to serve ...
Gerhard Kramer, Ivana Maric, Roy D. Yates
NETWORKS
2006
13 years 9 months ago
Lower bounds for the relative greedy algorithm for approximating Steiner trees
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
Stefan Hougardy, Stefan Kirchner