All Stories

  1. Ranking a Set of Objects Using Heterogeneous Workers: QUITE an Easy Problem
  2. Information Retrieval in the Age of Generative AI: The RGB Model
  3. Re-Identification Attacks against the Topics API
  4. Competition of Influencers: A Model for Maximizing Online Social Impact
  5. Federated Learning Under Heterogeneous and Correlated Client Availability
  6. Planning Interventions in a Controlled Pandemic: The COVID-19 Case
  7. Asynchronous Semianonymous Dynamics over Large-Scale Networks
  8. GRADES: Gradient Descent for Similarity Caching
  9. Bootstrap percolation on the stochastic block model
  10. Practical anonymization for data streams: z-anonymity and relation with k-anonymity
  11. Effective and Efficient Heuristic Approaches for Solving the Capacitated P-Median Clustering Problem
  12. Similarity Caching: Theory and Algorithms
  13. Asymptotic analysis of Poisson shot noise processes, and applications
  14. A Swiss Army Knife for Online Caching in Small Cell Networks
  15. Temporal dynamics of posts and user engagement of influencers on Facebook and Instagram
  16. Ranking a Set of Objects: A Graph Based Least-Square Approach
  17. Opinion Dynamics on Correlated Subjects in Social Networks
  18. Cache Subsidies for an Optimal Memory for Bandwidth Tradeoff in the Access Network
  19. User Interaction with Online Advertisements
  20. Load Imbalance and Caching Performance of Sharded Systems
  21. A large deviation approach to super-critical bootstrap percolation on the random graph G
  22. Parallel Simulation of Very Large-Scale General Cache Networks
  23. Implicit Coordination of Caches in Small Cell Networks Under Unknown Popularity Profiles
  24. Selecting the Top-Quality Item Through Crowd Scoring
  25. De-anonymizing Clustered Social Networks by Percolation Graph Matching
  26. Modeling LEAST RECENTLY USED caches with Shot Noise request processes
  27. Social Network De-Anonymization Under Scale-Free User Relations
  28. Running ModelGraft to Evaluate Internet-scale ICN
  29. A Control-Theoretic Analysis of Low-Priority Congestion Control Reprioritization under AQM
  30. Generalized Threshold-Based Epidemics in Random Graphs
  31. A Unified Approach to the Performance Analysis of Caching Systems
  32. Content-Centric Wireless Networks With Limited Buffers: When Mobility Hurts
  33. How Much Can Large-Scale Video-on-Demand Benefit From Users' Cooperation?
  34. Impact of Clustering on the Performance of Network De-anonymization
  35. Unravelling the Impact of Temporal and Geographical Locality in Content Caching Systems
  36. Hierarchical Content Stores in High-Speed ICN Routers
  37. Neighborhood Filtering Strategies for Overlay Construction in P2P-TV Systems: Design and Experimental Comparison
  38. De-anonymizing scale-free social networks by percolation graph matching
  39. Efficient analysis of caching strategies under dynamic content popularity
  40. Least recently used caches under the Shot Noise Model
  41. The importance of being earnest in crowdsourcing systems
  42. Physics-inspired methods for networking and communications
  43. A performance comparison of hose rate controller approaches for P2P-TV applications
  44. Peer-Assisted VoD Systems: An Efficient Modeling Framework
  45. Large Deviations of the Interference in the Ginibre Network Model
  46. Throughput optimal scheduling policies in networks of constrained queues
  47. A unified approach to the performance analysis of caching systems
  48. Multi-Terabyte and multi-Gbps information centric routers
  49. New Directions into the Stochastic Geometry Analysis of Dense CSMA Networks
  50. Asymptotic Properties of Sequential Streaming Leveraging Users' Cooperation
  51. Temporal locality in today's content caching
  52. Modeling the interdependency of low-priority congestion control and active queue management
  53. Stochastic optimization of service provision with selfish users
  54. Content-centric wireless networks with limited buffers: When mobility hurts
  55. How much can large-scale Video-on-Demand benefit from users' cooperation?
  56. On the interaction between TCP-like sources and throughput-efficient scheduling policies
  57. Simulating the Tail of the Interference in a Poisson Network Model
  58. A delay-based aggregate rate control for P2P streaming systems
  59. Modeling and evaluation of multisource streaming strategies in P2P VoD systems
  60. Experimental comparison of neighborhood filtering strategies in unstructured P2P-TV systems
  61. Fluid-diffusive modelling for large P2P file-sharing systems
  62. Performance analysis of non-stationary peer-assisted VoD systems
  63. Stochastic analysis of self-sustainability in peer-assisted VoD systems
  64. Impact of Correlated Mobility on Delay–Throughput Performance in Mobile Ad Hoc Networks
  65. Large-Scale Available Bandwidth Measurements: Interference in Current Techniques
  66. Information-Theoretic Capacity of Clustered Random Networks
  67. Hose rate control for P2P-TV streaming systems
  68. Architecture of a network-aware P2P-TV application: the NAPA-WINE approach
  69. Impact of adverse network conditions on P2P-TV systems: Experimental evidence
  70. Exploiting Heterogeneity in P2P Video Streaming
  71. New insights into the stochastic geometry analysis of dense CSMA networks
  72. Chunk Distribution in Mesh-Based Large-Scale P2P Streaming Systems: A Fluid Approach
  73. Capacity scaling of large wireless networks with heterogeneous clusters
  74. Capacity Scaling of Wireless Networks With Inhomogeneous Node Density: Lower Bounds
  75. Restricted Mobility Improves Delay-Throughput Tradeoffs in Mobile Ad Hoc Networks
  76. Self-Chord: A Bio-Inspired P2P Framework for Self-Organizing Distributed Systems
  77. Network Friendly P2P-TV: The Napa-Wine Approach
  78. QoE in Pull Based P2P-TV Systems: Overlay Topology Design Tradeoffs
  79. Information-theoretic capacity of clustered random networks
  80. Impact of Correlated Mobility on Delay-Throughput Performance in Mobile Ad-Hoc Networks
  81. The quest for bandwidth estimation techniques for large-scale distributed systems
  82. Network Awareness of P2P Live Streaming Applications: A Measurement Study
  83. Capacity Scaling in Ad Hoc Networks With Heterogeneous Mobile Nodes: The Subcritical Regime
  84. How Much Can The Internet Be Greened?
  85. Delay-throughput performance in mobile ad-hoc networks with heterogeneous nodes
  86. Capacity Scaling in Ad Hoc Networks With Heterogeneous Mobile Nodes: The Super-Critical Regime
  87. A Lagrangean relaxation approach for QoS networks CFA problems
  88. Capacity scaling of wireless networks with inhomogeneous node density: upper bounds
  89. Route Stability in MANETs under the Random Direction Mobility Model
  90. Multihop Control Schemes in Switches With Reconfiguration Latency
  91. Adaptive overlay topology for mesh-based P2P-TV systems
  92. Network awareness of P2P live streaming applications
  93. On the Capacity Region of MANET: Scheduling and Routing Strategy
  94. Bandwidth Allocation for Video Streaming in WiMax Networks
  95. Capacity Scaling of Wireless Networks with Inhomogeneous Node Density: Lower Bounds
  96. P2P-TV Systems under Adverse Network Conditions: A Measurement Study
  97. Network Awareness in P2P-TV Applications
  98. A Bandwidth-Aware Scheduling Strategy for P2P-TV Systems
  99. Sensor Deployment and Relocation: A Unified Scheme
  100. Building a cooperative P2P-TV application over a wise network: the approach of the European FP-7 strep NAPA-WINE
  101. Capacity Scaling of Sparse Mobile Ad Hoc Networks
  102. Asymptotic Performance Limits of Switches With Buffered Crossbars Supporting Multicast Traffic
  103. Understanding P2P-TV Systems Through Real Measurements
  104. Optimal Scheduling and Routing for Maximum Network Throughput
  105. Analysis of Random Mobility Models with Partial Differential Equations
  106. A Distributed Sensor Relocatlon Scheme for Environmental Control
  107. Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
  108. Distributed Scheduling in Input Queued Switches
  109. Estimating Dynamic Traffic Matrices by Using Viable Routing Changes
  110. On the Effectiveness of the 2-hop Routing Strategy in Mobile Ad Hoc Networks
  111. Throughput Region of Finite-Buffered Networks
  112. Beyond fluid models: Modelling TCP mice in IP networks under non-stationary random traffic
  113. On the Capacity of Ad Hoc Wireless Networks Under General Node Mobility
  114. Algorithms for IP network design with end-to-end QoS constraints
  115. Asymptotic Performance Limits of Switches with Buffered Crossbars Supporting Multicast Traffic
  116. Design of switches with reconfiguration latency
  117. Using partial differential equations to model TCP mice and elephants in large IP networks
  118. A statistical physics approach for modelling P2P systems
  119. On the Stability of Isolated and Interconnected Input-Queueing Switches Under Multiclass Traffic
  120. Underload Instabilities in Packet Networks With Flow Schedulers
  121. On the Design of Fault-Tolerant Logical Topologies in Wavelength-Routed Packet Networks
  122. Multiclass Scheduling Algorithms for the DAVID Metro Network
  123. Delay bounds for combined input–output switches with low speedup
  124. Guest editorial high-performance optical switches/routers for high-speed internet
  125. Bounds on delays and queue lengths in input-queued cell switches
  126. Gated asymptotic modEls (GAMEs)
  127. Multicast traffic in input-queued switches: Optimal scheduling and maximum throughput
  128. Compression of multicast labels in large IP routers
  129. Guest editorial high-performance electronic switches/routers for high-speed internet
  130. On the stability of local scheduling policies in networks of packet switches with input queues
  131. Scheduling algorithms for multicast traffic in TDM/WDM networks with arbitrary tuning latencies
  132. Incremental scheduling algorithms for WDM/TDM networks with arbitrary tuning latencies
  133. Network interface multicast protocols for wormhole-based networks of workstations
  134. Next Generation Optical Network Design and Modelling
  135. Packet-mode scheduling in input-queued cell-based switches
  136. Input-queued router architectures exploiting cell-based switching fabrics
  137. Supporting TCP connections in wormhole routing and ATM networks
  138. Logical topologies design over WDM wavelength routed networks robust to traffic uncertainties
  139. Efficient estimation of call blocking probabilities in cellular mobile telephony networks with customer retrials
  140. New Trends in Optical Network Design and Modeling
  141. On the stability of input-queued switches with speed-up
  142. Routing in the bidirectional shufflenet
  143. Network controller design for SONATA-a large-scale all-optical passive network
  144. Modeling slotted WDM rings with discrete-time Markovian models
  145. A posteriori versus a priori access strategies in slotted all-optical WDM rings
  146. Multihop packet scheduling in WDM/TDM networks with nonnegligible transceiver tuning times
  147. Analysis of call blocking probability in TDM/WDM networks with transparency constraint
  148. Modulation and coding for the Gaussian collision channel
  149. All-optical WDM multi-rings with differentiated QoS
  150. RPA: a flexible scheduling algorithm for input buffered switches
  151. <title>QoS support in all-optical WDM multiring LANs</title>
  152. RPA: a simple, efficient, and flexible policy for input buffered ATM switches
  153. <title>Multicast traffic in a WDM-ring-based ATM switch</title>
  154. MAC protocols and fairness control in WDM multirings with tunable transmitters and fixed receivers
  155. The Supercomputer Supernet testbed: a WDM-based supercomputer interconnect
  156. Congestion control in asynchronous, high-speed wormhole routing networks
  157. Square Grid Topologies for Wavelength-Routing All-Optical Networks
  158. Topologies for wavelength-routing all-optical networks
  159. On the behavior of optimal scheduling algorithms under TCP sources
  160. Design of IP Virtual Private Networks under End-To-End QoS Constraints
  161. On the maximal throughput of networks with finite buffers and its application to buffered crossbars
  162. A framework for differential frame-based matching algorithms in input-queued switches
  163. Using partial differential equations to model TCP mice and elephants in large IP networks
  164. On the number of input queues to efficiently support multicast traffic in input queued switches
  165. Exploiting OTDM technology in WDM networks
  166. Frame-based matching algorithms for input-queued switches