Sciweavers

TON
2008
110views more  TON 2008»
13 years 11 months ago
Analysis of scale effects in peer-to-peer networks
Yung-Ming Li, Yong Tan, Yong-Pin Zhou
TON
2008
119views more  TON 2008»
13 years 11 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
TON
2008
86views more  TON 2008»
13 years 11 months ago
Securing user-controlled routing infrastructures
Designing infrastructures that give untrusted third parties (such as end-hosts) control over routing is a promising research direction for achieving flexible and efficient communic...
Karthik Lakshminarayanan, Daniel Adkins, Adrian Pe...
TON
2008
106views more  TON 2008»
13 years 11 months ago
Statistical techniques for detecting traffic anomalies through packet header data
This paper proposes a traffic anomaly detector, operated in postmortem and in real-time, by passively monitoring packet headers of traffic. The frequent attacks on network infrastr...
Seong Soo Kim, A. L. Narasimha Reddy
TON
2008
124views more  TON 2008»
13 years 11 months ago
Designing packet buffers for router linecards
-- Internet routers and Ethernet switches contain packet buffers to hold packets during times of congestion. Packet buffers are at the heart of every packet switch and router, whic...
Sundar Iyer, Ramana Rao Kompella, Nick McKeown
TON
2008
86views more  TON 2008»
13 years 11 months ago
Faster algorithms for construction of recovery trees enhancing QoP and QoS
M
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...
TON
2008
99views more  TON 2008»
13 years 11 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
TON
2008
107views more  TON 2008»
13 years 11 months ago
On guaranteed smooth switching for buffered crossbar switches
Scalability considerations drive the evolution of switch design from output queueing to input queueing and further to combined input and crosspoint queueing (CICQ). However, CICQ s...
Simin He, Shutao Sun, Hong-Tao Guan, Qiang Zheng, ...
TON
2008
102views more  TON 2008»
13 years 11 months ago
Designing less-structured P2P systems for the expected high churn
Abstract--We address the problem of highly transient populations in unstructured and loosely-structured peer-to-peer systems. We propose a number of illustrative query-related stra...
Fabián E. Bustamante, Yi Qiao
TON
2008
126views more  TON 2008»
13 years 11 months ago
Hyperbolic embedding of internet graph for distance estimation and overlay construction
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
Yuval Shavitt, Tomer Tankel