Sciweavers

605 search results - page 118 / 121
» Reducing complexity in tree-like computer interconnection ne...
Sort
View
ICDCS
2012
IEEE
11 years 11 months ago
Scalable Name Lookup in NDN Using Effective Name Component Encoding
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junche...
HPDC
1998
IEEE
14 years 26 days ago
Metascheduling: A Scheduling Model for Metacomputing Systems
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...
Jon B. Weissman
CCR
2008
170views more  CCR 2008»
13 years 8 months ago
Probe-Aided MulTCP: an aggregate congestion control mechanism
An aggregate congestion control mechanism, namely ProbeAided MulTCP (PA-MulTCP), is proposed in this paper. It is based on MulTCP, a proposal for enabling an aggregate to emulate ...
Fang-Chun Kuo, Xiaoming Fu
ANCS
2009
ACM
13 years 6 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
NSDI
2008
13 years 11 months ago
Hot Crap!
esn't display abstracts. Similar issues beset START (www.softconf.com), Linklings's RM 3.2 (www. linklings.com), and EasyChair (www.easychair.org). For instance, EasyChai...
Eddie Kohler