1,150 Hits in 6.1 sec

Table of Contents

2021 IEEE/ACM Transactions on Networking  
Ma June 2021 Volume 29, Number 3, IEANEP (ISSN 1063-6692) Transactions Papers(Continued from Front Cover) Mitigating Packet Reordering for Random Packet Spraying in Data Center Networks 1088 1105  ...  Spyropoulos Optical Protection Cost of Loop Free Alternates on Completely Connected IP Networks Over Optical Rings C. Rožc and G. Sasaki Parallel Backscatter: Channel Estimation and BeyondM. Jin, Y.  ... 
doi:10.1109/tnet.2021.3073330 fatcat:g2q33pbve5gabgqw7var5qavve

Table of Contents

2021 IEEE/ACM Transactions on Networking  
Bérczi-Kovács August 2021 Volume 29, Number 4, IEANEP (ISSN 1063-6692) Contents Continued on Back Cover Transactions Papers (Continued from Front Cover) 1662 1676  ...  Wang On the Theoretical Gap of Channel Hopping Sequences With Maximum Rendezvous Diversity in the Multichannel Rendezvous Problem C.-S. Chang, J.-P. Sheu, and Y.-J.  ... 
doi:10.1109/tnet.2021.3100942 fatcat:czc7rsrs4bgxte7sxgtpslarly

2021 Index IEEE/ACM Transactions on Audio, Speech, and Language Processing Vol. 29

2021 IEEE/ACM Transactions on Audio Speech and Language Processing  
., +, TASLP 2021 1609-1625 Minimum-Volume Multichannel Nonnegative Matrix Factorization for Blind Audio Source Separation.  ...  Shi, L., +, TASLP 2021 823-837 Geometry Calibration for Acoustic Transceiver Networks Based on Network Newton Distributed Optimization.  ... 
doi:10.1109/taslp.2022.3147096 fatcat:7nl52k7sjfalbhpxtum3y5nmje

Wireless Network Intrinsic Secrecy

Alberto Rabbachin, Andrea Conti, Moe Z. Win
2015 IEEE/ACM Transactions on Networking  
This research provides insights into the essence of wireless network intrinsic secrecy and offers a new perspective on the role of network interference in communication confidentiality. 1 For a discrete  ...  network interference.  ...  Thus, and 3 Spatial densities are measured in nodes per unit volume (UV).  ... 
doi:10.1109/tnet.2013.2297339 fatcat:zbx4agyedvhbdpg25fmmqbdyse

Path-Based Epidemic Spreading in Networks

Wei Koong Chai, George Pavlou
2017 IEEE/ACM Transactions on Networking  
In realworld networks, however, the infectious agent as the physical contagion medium usually flows from one node to another via specific directed routes (i.e., path-based infection).  ...  Based on this, we derive the critical pathbased epidemic threshold below which the epidemic will die off, as well as conditional bounds of this threshold which network operators may use to promote/suppress  ...  Based on our model, the critical epidemic thresholds are diminishingly small with λ and this re-affirms the observations reported in [29] , [30] that epidemics in communication networks are extremely  ... 
doi:10.1109/tnet.2016.2594382 fatcat:5qrdq6qpcnce5jrjv52knji2le

Robust Localization From Incomplete Local Information

Amin Karbasi, Sewoong Oh
2013 IEEE/ACM Transactions on Networking  
In particular, for a network consisting of devices positioned randomly, we provide a bound on the resulting error for both algorithms.  ...  probability of failure depends on how far apart those devices are.  ...  Urbanke for stimulating discussions on the subject of this paper.  ... 
doi:10.1109/tnet.2012.2220378 fatcat:4cbmg4mxtjgdngqkwu5r2aa34e

Price Differentiation for Communication Networks

Shuqin Li, Jianwei Huang
2014 IEEE/ACM Transactions on Networking  
We study the optimal usage-based pricing problem in a resource-constrained network with one profit-maximizing service provider and multiple groups of surplus-maximizing users.  ...  ., 50%) compared to no price differentiation, when the total network resource is comparably limited and the high willingness to pay users are minorities.  ...  IEEE TRANSACTIONS ON NETWORKING VOL:PP NO:99 YEAR 2013 • Complete network information: We propose a polynomial algorithm to compute the optimal solution of the partial price differentiation problem, which  ... 
doi:10.1109/tnet.2013.2258173 fatcat:e7d5mpa5qfbodacbsunesdwjs4

The cache location problem

P. Krishnan, D. Raz, Y. Shavitt
2000 IEEE/ACM Transactions on Networking  
This paper studies the problem of where to place network caches.  ...  Our techniques can be used by network providers to reduce traffic load in their network. Index Terms-Location problem, mirror placement, transparent cache.  ...  and Manuscript received February 19, 1999; revised August 9, 1999 and March 14, 2000; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor K. Calvert. P.  ... 
doi:10.1109/90.879344 fatcat:25dlzgfhq5hk3fyenr5i36iy74

ProgME: Towards Programmable Network MEasurement

Lihua Yuan, Chen-Nee Chuah, Prasant Mohapatra
2011 IEEE/ACM Transactions on Networking  
Traffic measurements provide critical input for a wide range of network management applications, including traffic engineering, accounting, and security analysis.  ...  Existing measurement tools collect traffic statistics based on some predetermined, inflexible concept of "flows".  ...  This is crucial for high-speed network devices. Second, it reduces the volume of data to be exported.  ... 
doi:10.1109/tnet.2010.2066987 fatcat:e5mbs7qx4beezlipxeq7ahs23m

Demystifying Internet-Wide Service Discovery

Derek Leonard, Dmitri Loguinov
2013 IEEE/ACM Transactions on Networking  
This paper develops a high-performance, Internet-wide service discovery tool, which we call IRLscanner, whose main design objectives have been to maximize politeness at remote networks, allow scanning  ...  ACKNOWLEDGMENT The authors are grateful to the Network Security team at Texas A&M University for helpful suggestions and professional handling of network administrator complaints.  ...  received May 28, 2011; revised July 17, 2012 and September 15, 2012; accepted November 25, 2012; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor S. Kasera.  ... 
doi:10.1109/tnet.2012.2231434 fatcat:2edg7ac53vcqlkkb65ai7q7ypm

Reliable Rateless Wireless Broadcasting With Near-Zero Feedback

Weiyao Xiao, Sachin Agarwal, David Starobinski, Ari Trachtenberg
2012 IEEE/ACM Transactions on Networking  
Both protocols rely on a single-round learning phase, requiring the transmission of a few feedback packets from a small subset of receivers.  ...  We develop and analyze two new data dissemination protocols, called Random Sampling (RS) and Full Sampling with Limited Feedback (FSLF), based on the moment and maximum likelihood estimators in extreme  ...  Upon collecting enough responses, the source estimates the δ-reliable volume using either the moment estimator based on Eq. (9) and Eq. (10), or the ML estimator based on Eq. (21) .  ... 
doi:10.1109/tnet.2012.2189016 fatcat:d2waj3mwhraqxmareyjta4u4sy

Anomaly Extraction in Backbone Networks Using Association Rules

Daniela Brauckhoff, Xenofontas Dimitropoulos, Arno Wagner, Kavé Salamatian
2012 IEEE/ACM Transactions on Networking  
It is important for root-cause analysis, network forensics, attack mitigation, and anomaly modeling.  ...  In addition, it triggers a very small number of false positives, on average between 2 and 8.5, which exhibit specific patterns and can be trivially sorted out by an administrator.  ...  Finally, substantial work has focused on dimensionality reduction for anomaly detection in backbone networks [2] , [29] , [33] , [18] , [11] , [4] , [14] .  ... 
doi:10.1109/tnet.2012.2187306 fatcat:c3ooachwzjgutnmswb6qljxp7q

Graceful Network State Migrations

Saqib Raza, Yuanbo Zhu, Chen-Nee Chuah
2011 IEEE/ACM Transactions on Networking  
His research interests span network algorithms, traffic engineering, network measurement, optimization and graph theory.  ...  A significant fraction of network events (such as topology or route changes) and the resulting performance degradation stem from premeditated network management and operational tasks.  ...  GM specifies three volume categories for traffic demands [4] .  ... 
doi:10.1109/tnet.2010.2097604 fatcat:kfjnbpm3bvbq7p4eft5z5fiztu

Provisioning algorithms for WDM optical networks

M. Alanyali, E. Ayanoglu
1999 IEEE/ACM Transactions on Networking  
This paper concerns connection provisioning for optical networks employing wavelength division multiplexing.  ...  The proposed algorithm is based on taking all failures into consideration simultaneously, and performs better than developing independent designs for each failure.  ...  of limited number of wavelengths per fiber, where provisioning Manuscript received February 2, 1998; revised March 18, 1999 ; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor K.  ... 
doi:10.1109/90.803389 fatcat:exkmo6lapzac3aed2wtv7sng44

Optimizing Gradual SDN Upgrades in ISP Networks

Konstantinos Poularakis, George Iosifidis, Georgios Smaragdakis, Leandros Tassiulas
2019 IEEE/ACM Transactions on Networking  
Nowadays, there is a fast-paced shift from legacy telecommunication systems to novel Software Defined Network (SDN) architectures that can support on-the-fly network reconfiguration, therefore, empowering  ...  We consider a general model that captures different migration costs and network topologies, and two plausible ISP objectives: (1) the maximization of the traffic that traverses at least one SDN node, and  ...  This benefit will be higher for flows that carry large volumes of traffic and paths with sufficient spare capacity to carry these volumes.  ... 
doi:10.1109/tnet.2018.2890248 fatcat:v4awqfmicbcwzfvvrggoavrdie
« Previous Showing results 1 — 15 out of 1,150 results