Sciweavers

658 search results - page 96 / 132
» Lower bounds for sorting networks
Sort
View
COMCOM
2004
110views more  COMCOM 2004»
13 years 7 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu
ANCS
2007
ACM
13 years 11 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
INFOCOM
2010
IEEE
13 years 6 months ago
The Capacity of Heterogeneous Wireless Networks
—Although capacity has been extensively studied in wireless networks, most of the results are for homogeneous wireless networks where all nodes are assumed identical. In this pap...
Pan Li, Yuguang Fang
MST
2002
107views more  MST 2002»
13 years 7 months ago
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
INFOCOM
2010
IEEE
13 years 6 months ago
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Ngu...