|
New Content
|
 |
Computing
Minimal Update Sequences for Graceful Router-Wide Reconfigurations
|
| |
Clad, F. ; Vissicchio, S. ; Merindol, P. ; Francois, P. ; Pansiot, J.-J. |
| |
Page(s): 1373 - 1386 |
 |
 |
Exact
Worst-Case Delay in FIFO-Multiplexing Feed-Forward Networks |
| |
Bouillard, A. ; Stea, G. |
| |
Page(s): 1387 - 1400 |
 |
 |
Energy-Efficient
Randomized Switching for Maximizing Lifetime in Tree-Based Wireless Sensor Networks
|
| |
Imon, S.K.A. ; Khan, A. ; Di Francesco, M. ; Das, S.K. |
| |
Page(s): 1401 - 1415 |
 |
 |
Topology-Transparent
Scheduling via the Chinese Remainder Theorem |
| |
Su, Y.-S. |
| |
Page(s): 1416 - 1429 |
 |
 |
Deadline-Aware
Scheduling With Adaptive Network Coding for Real-Time Traffic |
| |
Yang, L. ; Sagduyu, Y.E. ; Zhang, J. ; Li, J.H. |
| |
Page(s): 1430 - 1443 |
 |
 |
Stable
Distributed P2P Protocols Based on Random Peer Sampling |
| |
Oguz, B. ; Anantharam, V. ; Norros, I. |
| |
Page(s): 1444 - 1456 |
 |
 |
Confidentiality-Preserving
Control of Uplink Cellular Wireless Networks Using Hybrid ARQ |
| |
Sarikaya, Y. ; Ercetin, O. ; Koksal, C.E. |
| |
Page(s): 1457 - 1470 |
 |
 |
Exploiting
Social Ties for Cooperative D2D Communications: A Mobile Social Networking Case
|
| |
Chen, X. ; Proulx, B. ; Gong, X. ; Zhang, J. |
| |
Page(s): 1471 - 1484 |
 |
 |
Does
Network Coding Combined With Interference Cancellation Bring Any Gain to a Wireless Network?
|
| |
Yazdanpanah, M. ; Assi, C. ; Sebbah, S. ; Shayan, Y. |
| |
Page(s): 1485 - 1500 |
 |
 |
On
the Area and Energy Scalability of Wireless Network-on-Chip: A Model-Based Benchmarked Design Space Exploration
|
| |
Abadal, S. ; Iannazzo, M. ; Nemirovsky, M. ; Cabellos-Aparicio, A. ; Lee, H. ; Alarcon, E. |
| |
Page(s): 1501 - 1513 |
 |
 |
CEDAR:
A Low-Latency and Distributed Strategy for Packet Recovery in Wireless Networks
|
| |
Qiu, C. ; Shen, H. ; Soltani, S. ; Sapra, K. ; Jiang, H. ; Hallstrom, J.O. |
| |
Page(s): 1514 - 1527 |
 |
 |
A
Message-Passing Algorithm for Wireless Network Scheduling |
| |
Paschalidis, I.C. ; Huang, F. ; Lai, W. |
| |
Page(s): 1528 - 1541 |
 |
 |
Throughput-Optimal
Scheduling Design With Regular Service Guarantees in Wireless Networks
|
| |
Li, B. ; Li, R. ; Eryilmaz, A. |
| |
Page(s): 1542 - 1552 |
 |
 |
Completion
Delay Minimization for Instantly Decodable Network Codes |
| |
Sorour, S. ; Valaee, S. |
| |
Page(s): 1553 - 1567 |
 |
 |
CloudNet:
Dynamic Pooling of Cloud Resources by Live WAN Migration of Virtual Machines
|
| |
Wood, T. ; Ramakrishnan, K.K. ; Shenoy, P. ; Van der Merwe, J. ; Hwang, J. ; Liu, G. ; Chaufournier, L. |
| |
Page(s): 1568 - 1583 |
 |
 |
MaxWeight
Versus BackPressure: Routing and Scheduling in Multichannel Relay Networks
|
| |
Moharir, S. ; Shakkottai, S. |
| |
Page(s): 1584 - 1598 |
 |
 |
Exploiting
Excess Capacity, Part II: Differentiated Services Under Traffic Growth
|
| |
Dikbiyik, F. ; Tornatore, M. ; Mukherjee, B. |
| |
Page(s): 1599 - 1609 |
 |
 |
On
the Scalability of Routing With Policies |
| |
Gulyas, A. ; Retvari, G. ; Heszberger, Z. ; Agarwal, R. |
| |
Page(s): 1610 - 1618 |
 |
 |
Skewless
Network Clock Synchronization Without Discontinuity: Convergence and Performance
|
| |
Mallada, E. ; Meng, X. ; Hack, M. ; Zhang, L. ; Tang, A. |
| |
Page(s): 1619 - 1633 |
 |
 |
A
Double-Auction Mechanism for Mobile Data-Offloading Markets |
| |
Iosifidis, G. ; Gao, L. ; Huang, J. ; Tassiulas, L. |
| |
Page(s): 1634 - 1647 |
 |
 |
Guaranteeing
Heterogeneous Bandwidth Demand in Multitenant Data Center Networks
|
| |
Li, D. ; Zhu, J. ; Wu, J. ; Guan, J. ; Zhang, Y. |
| |
Page(s): 1648 - 1660 |
 |
 |
Rating
Network Paths for Locality-Aware Overlay Construction and Routing
|
| |
Du, W. ; Liao, Y. ; Tao, N. ; Geurts, P. ; Fu, X. ; Leduc, G. |
| |
Page(s): 1661 - 1673 |
 |
 |
High-Performance
Centralized Content Delivery Infrastructure: Models and Asymptotics
|
| |
Shah, V. ; de Veciana, G. |
| |
Page(s): 1674 - 1687 |
 |
 |
Protecting
Multi-Lateral Localization Privacy in Pervasive Environments |
| |
Shu, T. ; Chen, Y. ; Yang, J. |
| |
Page(s): 1688 - 1701 |
 |
 |
Corrections
to “Link-State Routing With Hop-By-Hop Forwarding Can Achieve Optimal Traffic Engineering”
|
| |
Xu, D. ; Chiang, M. ; Rexford, J. |
| |
Page(s): 1702 - 1703 |
 |
|
CHANGE or UNSUBSCRIBE from this service
|
 |