46931 search results - page 9088 / 9387 » Networking the networks |
168
Voted
WAOA
2005
Springer
16 years 5 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
204
click to vote
CCS
2005
ACM
16 years 4 days ago
2005
ACM
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
186
click to vote
ICN
2005
Springer
16 years 4 days ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
149
click to vote
ACMICEC
2004
ACM
16 years 3 days ago
2004
ACM
In this paper, we describe the operation of barter trade exchanges by identifying key techniques used by trade brokers to stimulate trade and satisfy member needs, and present alg...
195
click to vote
ACMICEC
2004
ACM
16 years 3 days ago
2004
ACM
This paper presents a loosely coupled service-composition paradigm. This paradigm employs a distributed data flow that differs markedly from centralized information flow adopted b...