IEEE/ACM Transactions on Networking

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking - Tập 10 Số 4 - Trang 477-486 - 2002
M. Grossglauser, D.N.C. Tse
The capacity of ad hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale ...... hiện toàn bộ
#Wireless networks #Diversity reception #Base stations #Delay #Throughput #Fading #Interference constraints #Network topology #Cellular networks #Diversity methods
The BLUE active queue management algorithms
IEEE/ACM Transactions on Networking - Tập 10 Số 4 - Trang 513-528 - 2002
Wu-chang Feng, K.G. Shin, D.D. Kandlur, D. Saha
In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, the IETF has been considering the deployment of active queue management techniques such as RED (random early detection) (see Floyd, S. and Jacobson, V., IEEE/ACM Trans. Networking, vol.1, p.397-413, 1993). While active queue management can potentially reduce packet loss rates in the Internet, we...... hiện toàn bộ
#Internet #Telecommunication traffic #Traffic control #Bandwidth #Size control #Filters #Stochastic processes #Loss measurement #IP networks #Computer science
Delay jitter bounds and packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking - Tập 10 Số 4 - Trang 529-540 - 2002
J.C.R. Bennett, K. Benson, A. Charny, W.F. Courtney, J.-Y. Le Boudec
We consider the definition of the expedited forwarding per-hop behavior (EF PHB) as given in RFC 2598 and its impact on worst case end-to-end delay jitter. On the one hand, the definition in RFC 2598 can be used to predict extremely low end-to-end delay jitter, independent of the network scale. On the other hand, the worst case delay jitter can be made arbitrarily large, while each flow traverses ...... hiện toàn bộ
#Delay #Jitter #Traffic control #Aggregates #Bandwidth #Telecommunication traffic #Diffserv networks #Context-aware services #Spine #Electronic mail
A Billion-Scale Approximation Algorithm for Maximizing Benefit in Viral Marketing
IEEE/ACM Transactions on Networking - Tập 25 Số 4 - Trang 2419-2429 - 2017
Hung T. Nguyen, My T. Thai, Thang N. Dinh
Online social networks have been one of the most effective platforms for marketing and advertising. Through the “world-of-mouth” exchanges, so-called viral marketing, the influence and product adoption can spread from few key influencers to billions of users in the network. To identify those key influencers, a great amount of work has been devoted for the influence maximization (IM) problem that s...... hiện toàn bộ
#Viral marketing #Influence maximization #sampling Alg
TCP performance over end-to-end rate control and stochastic available capacity
IEEE/ACM Transactions on Networking - Tập 9 Số 4 - Trang 377-391 - 2001
Sanjay Shakkottai, Anurag Kumar, A. Karnik, A. Anvekar
Jitter-based delay-boundary prediction of wide-area networks
IEEE/ACM Transactions on Networking - Tập 9 Số 5 - Trang 578-590 - 2001
Qiong Li, David L. Mills
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking - Tập 1 Số 4 - Trang 397-413 - 1993
Sally Floyd, Van Jacobson
Energy-efficient packet transmission over a wireless link
IEEE/ACM Transactions on Networking - Tập 10 Số 4 - Trang 487-499 - 2002
E. Uysal-Biyikoglu, B. Prabhakar, A. El Gamal
The paper considers the problem of minimizing the energy used to transmit packets over a wireless link via lazy schedules that judiciously vary packet transmission times. The problem is motivated by the following observation. With many channel coding schemes, the energy required to transmit a packet can be significantly reduced by lowering transmission power and code rate and therefore transmittin...... hiện toàn bộ
#Energy efficiency #Optimal scheduling #Wireless sensor networks #Power control #Delay #Algorithm design and analysis #Wireless LAN #Batteries #Signal processing #Interference
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking - Tập 3 Số 5 - Trang 489-500 - 1995
R. Ramaswami, K.N. Sivarajan
Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet
IEEE/ACM Transactions on Networking - Tập 10 Số 4 - Trang 541-550 - 2002
J.L. Sobrinho
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and optimal paths can be computed with a generalization of E.W. Dijkstra's algorithm (see Numer. Math., vol.1, p.269-71, 1959). We define an algebra of weights which contains a binary operation, for the composition of link w...... hiện toàn bộ
#Algebra #Quality of service #Delay #Circuits #Computer networks #Web and internet services #Routing protocols #Telecommunication traffic #Telecommunication computing #Throughput
Tổng số: 59   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6