Sciweavers

431 search results - page 29 / 87
» Information Flows in Causal Networks
Sort
View
103
Voted
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
15 years 11 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
FPL
2006
Springer
108views Hardware» more  FPL 2006»
15 years 5 months ago
Implementation of Network Application Layer Parser for Multiple TCP/IP Flows in Reconfigurable Devices
This paper presents an implementation of a high-performance network application layer parser in FPGAs. At the core of the architecture resides a pattern matcher and a parser. The ...
James Moscola, Young H. Cho, John W. Lockwood
INFOCOM
2012
IEEE
13 years 4 months ago
Origin-destination flow measurement in high-speed networks
—An origin-destination (OD) flow between two routers is the set of packets that pass both routers in a network. Measuring the sizes of OD flows is important to many network man...
Tao Li, Shigang Chen, Yan Qiao
FGCN
2007
IEEE
109views Communications» more  FGCN 2007»
15 years 8 months ago
Flow Balancing Hardware for Parallel TCP Streams on Long Fat Pipe Network
Parallel TCP streams are used for data transfer between clusters in today's high performance applications. When parallel TCP streams are used on LFN, part of streams fail to ...
Yutaka Sugawara, Mary Inaba, Kei Hiraki
ISCC
2003
IEEE
113views Communications» more  ISCC 2003»
15 years 7 months ago
Channel Sharing of Competing Flows in Ad Hoc Networks
This paper studies the fairness with which competing flows share the channel in ad hoc networks using collision avoidance protocols. It is shown that the required multihop coordi...
Yu Wang, J. J. Garcia-Luna-Aceves