All Stories

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