TON 2010 - PDF Preprint Papers

TON 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TON-2010 Paper

click to vote

TON
2010

300views more TON 2010»

POPI: a user-level tool for inferring router packet forwarding priority

13 years 10 months ago

Download www.cs.northwestern.edu

— Packet forwarding prioritization (PFP) in routers is one of the mechanisms commonly available to network operators. PFP can have a signiﬁcant impact on the accuracy of networ...

Guohan Lu, Yan Chen, Stefan Birrer, Fabián ...

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	300	POPI: a user-level tool for inferring router packet forwarding priority	claim
2	279	Distributed algorithms for minimum cost multicast with network coding	claim
3	221	Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network	claim
4	210	A New Approach to Optical Networks Security: Attack-Aware Routing and Wavelength Assignment	claim
5	204	Passive Diagnosis for Wireless Sensor Networks	claim
6	198	On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability	claim
7	197	Constrained relay node placement in wireless sensor networks: formulation and approximations	claim
8	196	Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling	claim
9	192	Delay analysis for wireless networks with single hop traffic and general interference constraints	claim
10	189	Analysis, Simulation, and Implementation of VCP: A Wireless Profiling	claim
11	188	Self-Chord: A Bio-Inspired P2P Framework for Self-Organizing Distributed Systems	claim
12	179	Network Coding-Aware Routing in Wireless Networks	claim
13	176	Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels	claim
14	175	Cooperative Adaptive Spectrum Sharing in Cognitive Radio Networks	claim
15	173	Minimizing delay and maximizing lifetime for wireless sensor networks with anycast	claim
16	171	Offline Routing and Wavelength Assignment in Transparent WDM Networks	claim
17	171	Constructing Maximum-Lifetime Data-Gathering Forests in Sensor Networks	claim
18	168	Engineering Wireless Mesh Networks: Joint Scheduling, Routing, Power Control, and Rate Adaptation	claim
19	167	A Machine Learning Approach to TCP Throughput Prediction	claim
20	165	An analytic throughput model for TCP NewReno	claim
21	163	Toward practical opportunistic routing with intra-session network coding for mesh networks	claim
22	163	Usage Patterns in an Urban WiFi Network	claim
23	162	Fast Algorithms for Resource Allocation in Wireless Cellular Networks	claim
24	162	The Delay-Friendliness of TCP for Real-Time Traffic	claim
25	161	Investigating Self-Similarity and Heavy-Tailed Distributions on a Large-Scale Experimental Facility	claim
26	159	Googling the internet: profiling internet endpoints via the world wide web	claim
27	158	Always acyclic distributed path computation	claim
28	157	Random Access Game and Medium Access Control Design	claim
29	152	1 + N network protection for mesh networks: network coding-based protection using p-cycles	claim
30	151	Measurement-Driven Guidelines for 802.11 WLAN Design	claim
31	151	Throughput Optimal Distributed Power Control of Stochastic Wireless Networks	claim
32	147	Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach	claim
33	141	Weighted spectral distribution for internet topology analysis: theory and applications	claim
34	139	Opportunistic and Cooperative Spatial Multiplexing in MIMO Ad Hoc Networks	claim
35	139	KISS: Stochastic Packet Inspection Classifier for UDP Traffic	claim
36	138	SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation	claim
37	136	Distributed Opportunistic Scheduling With Two-Level Probing	claim
38	132	The optimality of two prices: maximizing revenue in a stochastic communication system	claim
39	132	Efficient and dynamic routing topology inference from end-to-end measurements	claim
40	129	QoS-based manycasting over optical burst-switched (OBS) networks	claim
41	127	Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference	claim
42	127	Queue Dynamics With Window Flow Control	claim
43	126	Cost-Effective Multiperiod Spraying for Routing in Delay-Tolerant Networks	claim
44	126	MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns	claim
45	125	Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling	claim
46	125	S4: Small State and Small Stretch Compact Routing Protocol for Large Static Wireless Networks	claim
47	122	The (in)completeness of the observed internet AS-level structure	claim
48	119	Thwarting zero-day polymorphic worms with network-level length-based signature generation	claim
49	119	Modulation Rate Adaptation in Urban and Vehicular Environments: Cross-Layer Implementation and Experimental Evaluation	claim
50	118	ILP formulations for p-cycle design without candidate cycle enumeration	claim
51	118	Capacity Scaling of Wireless Networks With Inhomogeneous Node Density: Lower Bounds	claim
52	118	Multicast Capacity of Wireless Ad Hoc Networks Under Gaussian Channel Model	claim
53	117	Pricing strategies for spectrum lease in secondary markets	claim
54	115	Design and Provisioning of WDM Networks With Many-to-Many Traffic Grooming	claim
55	115	Feedback-Based Scheduling for Load-Balanced Two-Stage Switches	claim
56	113	Transmit Power Estimation Using Spatially Diverse Measurements Under Wireless Fading	claim
57	111	A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks	claim
58	109	Rendered path: range-free localization in anisotropic sensor networks with holes	claim
59	107	Leveraging Dynamic Spare Capacity in Wireless Systems to Conserve Mobile Terminals' Energy	claim
60	107	Rate Quantization and the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches	claim
61	105	Internet QoS and Regulations	claim
62	101	Deploying sensor networks with guaranteed fault tolerance	claim
63	99	Rate Control With Pairwise Intersession Network Coding	claim
64	97	Gradually reconfiguring virtual network topologies based on estimated traffic matrices	claim
65	95	Weak State Routing for Large-Scale Dynamic Networks	claim
66	93	On suitability of Euclidean embedding for host-based network coordinate systems	claim
67	93	Design and field experimentation of an energy-efficient architecture for DTN throwboxes	claim
68	93	On the Validity of IEEE 802.11 MAC Modeling Hypotheses	claim
69	93	Equilibrium of Heterogeneous Congestion Control: Optimality and Stability	claim
70	90	On burst transmission scheduling in mobile TV broadcast networks	claim
71	89	Demand-aware content distribution on the internet	claim
72	87	Measuring Transmission Opportunities in 802.11 Links	claim
73	83	Understanding and modeling the internet topology: economics and evolution perspective	claim
74	80	Replication routing in DTNs: a resource allocation approach	claim
75	70	Low-Power TCAMs for Very Large Forwarding Tables	claim
76	68	Upgrading mice to elephants: effects and end-point solutions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers