All Stories

  1. On Optimal Server Allocation for a Loss System With Moldable Jobs
  2. On Optimal Server Allocation for Moldable Jobs with Concave Speed-Up
  3. Asymptotic analysis of the sojourn time of a batch in a M [ X ] / M /1 processor sharing queue
  4. Packet Delivery Ratio Guarantees for Differentiated LoRaWanServices
  5. Traffic Control and Channel Assignment for Quality Differentiation in Dense Urban LoRaWANs
  6. Container placement and migration strategies for cloud, fog, and edge data centers: A survey
  7. On the Robustness of Controlled Deep Reinforcement Learning for Slice Placement
  8. Analysis of business opportunities for tower companies enabled by virtualization
  9. Latency and network aware placement for cloud-native 5G/6G services
  10. DRL-based Slice Placement Under Non-Stationary Conditions
  11. DRL-based Slice Placement under Realistic Network Load Conditions
  12. Controlled Deep Reinforcement Learning for Optimized Slice Placement
  13. Batch sojourn time in the processor sharing queue with geometric batch size
  14. Evaluating the impact of Tower Companies on the telecommunications market
  15. A Heuristically Assisted Deep Reinforcement Learning Approach for Network Slice Placement
  16. Heuristic for Edge-enabled Network Slicing Optimization using the “Power of Two Choices”
  17. A new linear inversion formula for a class of hypergeometric polynomials
  18. Cloud-RAN Factory: Instantiating virtualized mobile networks with ONAP
  19. Edge-enabled Optimized Network Slicing in Large Scale Networks
  20. Cloud-RAN functional split for an efficient fronthaul network
  21. Location-based Data Model for Optimized Network Slice Placement
  22. Network Slice Management on top of ONAP
  23. On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue
  24. 5G E2E Network Slicing Management with ONAP
  25. Optimized Network Slicing Proof-of-Concept with Interactive Gaming Use Case
  26. Automating the deployment of 5G Network Slices using ONAP
  27. A Processor-Sharing Model for the Performance of Virtualized Network Functions
  28. Uplink Scheduling In Multi-Cell OFDMA Networks With and Without Coordination
  29. Higher aggregation of gNodeBs in Cloud-RAN architectures via parallel computing
  30. Network Calculus for Mean Delay Analysis Through a Network
  31. Performance of a trunk reservation policy in distributed data centres
  32. Sojourn time in a Processor Sharing queue with batch arrivals
  33. 5G Edge Resource Federation: Dynamic and Cross-domain Network Slice Deployment
  34. Federation of Cross-Domain Edge Resources: A Brokering Architecture for Network Slicing
  35. Cloud-RAN Modeling Based on Parallel Processing
  36. Sojourn time in an M/M/1 processor sharing queue with permanent customers
  37. CLOSE: A costless service offloading strategy for distributed edge cloud
  38. On dimensioning Cloud-RAN systems
  39. Correlation between QoS and QoE for HTTP YouTube content in Orange cellular networks
  40. Performance analysis of VNFs for sizing cloud-RAN infrastructures
  41. Towards a dynamic adaptive placement of virtual network functions under ONAP
  42. Verifying the configuration of virtualized network functions in software defined networks
  43. A benchmark for D2D in cellular networks: The importance of information
  44. On virtual network functions' placement in future distributed edge cloud
  45. SloMo: An implicit cross-layer mechanism for a better experience on mobile networks
  46. Allocation schemes of resources with downgrading
  47. Towards the deployment of a fully centralized Cloud-RAN architecture
  48. Fast and smooth data delivery using MPTCP by avoiding redundant retransmissions
  49. VNF modeling towards the cloud-RAN implementation
  50. Stationary analysis of the “Shortest Queue First” service policy: The asymmetric case
  51. Analysis of Downgrading for Resource Allocation
  52. Analysis of an Offloading Scheme for Data Centers in the Framework of Fog Computing
  53. Performance analysis of resource pooling for network function virtualization
  54. Volume and duration of losses in finite buffer fluid queues
  55. Mean field and propagation of chaos in multi-class heterogeneous loss models
  56. Controlling Impatience in Cellular Networks Using QoE-aware Radio Resource Allocation
  57. The Power of Randomized Routing in Heterogeneous Loss Systems
  58. Volume and duration of losses in finite buffer fluid queues
  59. Two Parallel Queues with Infinite Servers andJoin the Shortest QueueDiscipline
  60. Impatience in mobile networks and its application to data pricing
  61. Erratum to: Wireless three-hop networks with stealing II: exact solutions through boundary value problems
  62. First response to letter of G. Fayolle and R. Iasnogorodski
  63. Analysis of the Shortest Queue First service discipline with two classes
  64. Stationary analysis of the shortest queue first service policy
  65. Experimental analysis of caching efficiency for YouTube traffic in an ISP network
  66. Alternate architectures for an all-optical core network based on new subwavelength switching paradigms
  67. Volatility of YouTube content in Orange networks and consequences
  68. Wireless three-hop networks with stealing II: exact solutions through boundary value problems
  69. Design and performance of future networks
  70. Wireless Multihop Networks with Stealing: Large Buffer Asymptotics via the Ray Method
  71. Rare event asymptotics for a random walk in the quarter plane
  72. Wireless multi-hop networks with stealing: Large buffer asymptotics
  73. On the statistical characterization of flows in Internet traffic with application to sampling
  74. AN IDENTIFICATION PROBLEM IN AN URN AND BALL MODEL WITH HEAVY TAILED DISTRIBUTIONS
  75. A heuristic method of finding heavy hitter prefix pairs in IP traffic
  76. Analysis of Steiner subtrees of random trees for traceroute algorithms
  77. Perturbation analysis of an M/M/1 queue in a diffusion random environment
  78. Inference of flow statistics via packet sampling in the internet
  79. Buffer overflow asymptotics for multiplexed regulated traffic
  80. Boundary behavior and product-form stationary distributions of jump diffusions in the orthant with state-dependent reflections
  81. A queueing system for modeling a file sharing principle
  82. Peer-to-Peer Traffic: From Measurements to Analysis
  83. Existence and characterization of product-form invariant distributions for state-dependent stochastic networks in the heavy-traffic diffusion limit
  84. Dynamic Binary Tree for Hierarchical Clustering of IP Traffic
  85. A stochastic ordering property for leaky bucket regulated flows in packet networks
  86. Distribution of traffic among applications as measured in the French METROPOLIS project
  87. Stationary Analysis of a Fluid Queue Driven by Some Countable State Space Markov Chain
  88. Perturbation analysis of a variable M/M/1 queue: a probabilistic approach
  89. Integration of streaming services and TCP data transmission in the Internet
  90. Sojourn Times in the M/PH/1 Processor Sharing Queue
  91. On product-form stationary distributions for reflected diffusions with jumps in the positive orthant
  92. Scale functions of L�vy processes and busy periods of finite-capacity M/GI/1 queues
  93. Analysis of generalized processor-sharing systems with two classes of customers and exponential services
  94. Rate Conservation Laws for Multidimensional Processes of Bounded Variation with Applications to Priority Queueing Systems
  95. Tail asymptotics for processor-sharing queues
  96. AIMD algorithms and exponential functionals
  97. Experimental analysis of the impact of peer-to-peer applications on traffic in commercial IP networks
  98. Analysis of the fluid weighted fair queueing system
  99. A Markovian analysis of additive-increase multiplicative-decrease algorithms
  100. Analysis of the M/M/1 Queue with Processor Sharing via Spectral Theory
  101. The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions
  102. Lightweight signaling in ATM networks for high quality transfer of Internet traffic
  103. Excursions of birth and death processes, orthogonal polynomials, and continued fractions
  104. Excursions of the workload process in G/GI/1 queues
  105. Cell conformance testing with respect to the peak cell rate in ATM networks
  106. Analysis of cell clumping caused by ATM network GFC protocols
  107. On pathwise behavior of multiserver queues
  108. On the capability of the policing function to release an ATM connection
  109. A note on the pathwise version of Little's formula
  110. On pathwise rate conservation for a class of semi-martingales
  111. Burstiness and resource management in ATM networks
  112. Jitter in ATM networks and its impact on peak rate enforcement
  113. On pathwise behavior of queues
  114. Burstiness in broadband integrated networks
  115. Spacing cells protects and enhances utilization of ATM network links
  116. A basic requirement for the policing function in ATM networks
  117. A generalization of some policing mechanisms
  118. Relations entre distribution stationnaire et distribution aux instants d’arrivée pour des files d’attente usuelles
  119. Extremal traffic and bounds for the mean delay of multiplexed regulated traffic streams
  120. On characterizing an ATM source via the sustainable cell rate traffic descriptor
  121. Estimating Local Cardinalities in a Multidimensional Multiset
  122. Management of cell delay variation in ATM networks
  123. Transient analysis of statistical multiplexing on an ATM link