TON 2008 - PDF Preprint Papers

TON 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TON-2008 Paper

click to vote

TON
2008

239views more TON 2008»

Characterization of failures in an operational IP backbone network

14 years 10 days ago

Download www.ece.ucdavis.edu

Abstract--As the Internet evolves into a ubiquitous communication infrastructure and supports increasingly important services, its dependability in the presence of various failures...

Athina Markopoulou, Gianluca Iannaccone, Supratik ...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	239	Characterization of failures in an operational IP backbone network	claim
2	204	BRA: a bidirectional routing abstraction for asymmetric mobile ad hoc networks	claim
3	160	Label space reduction in MPLS networks: how much can a single stacked label do?	claim
4	159	Optimizing lifetime for continuous data aggregation with precision guarantees in wireless sensor networks	claim
5	155	A comparative analysis of server selection in content replication networks	claim
6	149	Building heterogeneous peer-to-peer networks: protocol and analysis	claim
7	144	A comprehensive analysis of mobility management in MPLS-based wireless access networks	claim
8	139	Stochastic learning solution for distributed discrete power control game in wireless data networks	claim
9	138	On the performance benefits of multihoming route control	claim
10	136	A geometric approach to improving active packet loss measurement	claim
11	136	Density-based anycast: a robust routing strategy for wireless ad hoc networks	claim
12	135	Measurement-based admission control at edge routers	claim
13	134	Efficient broadcasting using network coding	claim
14	133	Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks	claim
15	131	Capacity management and equilibrium for proportional QoS	claim
16	126	Hyperbolic embedding of internet graph for distance estimation and overlay construction	claim
17	125	Two techniques for fast computation of constrained shortest paths	claim
18	124	Designing packet buffers for router linecards	claim
19	122	Distributed throughput maximization in wireless mesh networks via pre-partitioning	claim
20	121	A framework for mitigating attacks against measurement-based adaptation mechanisms in unstructured multicast overlay networks	claim
21	120	Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation	claim
22	119	Polynomial time approximation algorithms for multi-constrained QoS routing	claim
23	110	Analysis of scale effects in peer-to-peer networks	claim
24	109	Efficient routing in intermittently connected mobile networks: the single-copy case	claim
25	109	On hierarchical traffic grooming in WDM networks	claim
26	108	Impact of denial of service attacks on ad hoc networks	claim
27	107	Efficient routing in intermittently connected mobile networks: the multiple-copy case	claim
28	107	On guaranteed smooth switching for buffered crossbar switches	claim
29	106	Statistical techniques for detecting traffic anomalies through packet header data	claim
30	106	On static and dynamic partitioning behavior of large-scale P2P networks	claim
31	105	Supporting multiple protection strategies in optical networks	claim
32	103	On the race of worms, alerts, and patches	claim
33	103	Fixed point analysis of single cell IEEE 802.11e WLANs: uniqueness and multistability	claim
34	102	Designing less-structured P2P systems for the expected high churn	claim
35	102	Internet traffic behavior profiling for network security monitoring	claim
36	100	Impact of hot-potato routing changes in IP networks	claim
37	99	On the computational complexity and effectiveness of N-hub shortest-path routing	claim
38	98	A unified framework for multipath routing for unicast and multicast traffic	claim
39	96	MICRON: a framework for connection establishment in optical networks	claim
40	95	Integration of explicit effective-bandwidth-based QoS routing with best-effort routing	claim
41	92	Entropy based adaptive flow aggregation	claim
42	89	Probabilistic packet marking for large-scale IP traceback	claim
43	89	Simple summaries for hashing with choices	claim
44	88	Traffic modeling and proportional partial caching for peer-to-peer systems	claim
45	87	Large-scale network parameter configuration using an on-line simulation framework	claim
46	86	Faster algorithms for construction of recovery trees enhancing QoP and QoS	claim
47	86	Securing user-controlled routing infrastructures	claim
48	84	Trajectory sampling with unreliable reporting	claim
49	79	A stochastic foundation of available bandwidth estimation: multi-hop analysis	claim
50	79	Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling	claim
51	76	Minimizing file download time in stochastic peer-to-peer networks	claim
52	75	An algorithmic approach to geographic routing in ad hoc and sensor networks	claim
53	75	TVA: a DoS-limiting network architecture	claim
54	74	Race conditions in coexisting overlay networks	claim
55	72	Padded frames: a novel algorithm for stable scheduling in load-balanced switches	claim
56	69	Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks	claim
57	59	Throughput-optimal configuration of fixed wireless networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers