Sciweavers

260 search results - page 18 / 52
» Quorum placement in networks: minimizing network congestion
Sort
View
IDEAS
2005
IEEE
124views Database» more  IDEAS 2005»
14 years 1 months ago
Flexible Update Management in Peer-to-Peer Database Systems
Promising the combination of dynamic configuration, scalability and redundancy, peer-to-peer (P2P) networks have garnered tremendous interest lately. Before long, this interest ex...
David Del Vecchio, Sang Hyuk Son
ORL
2006
105views more  ORL 2006»
13 years 7 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
INFOCOM
2010
IEEE
13 years 6 months ago
Layered Internet Video Engineering (LIVE): Network-Assisted Bandwidth Sharing and Transient Loss Protection for Scalable Video S
—This paper presents a novel scheme, Layered Internet Video Engineering (LIVE), in which network nodes feed back virtual congestion levels to video senders to assist both media-a...
Xiaoqing Zhu, Rong Pan, Nandita Dukkipati, Vijay S...
JNSM
2008
93views more  JNSM 2008»
13 years 7 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
ESA
1999
Springer
105views Algorithms» more  ESA 1999»
13 years 11 months ago
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
Friedhelm Meyer auf der Heide, Berthold Vöcki...