Filters








8,649 Hits in 6.2 sec

Packet clustering introduced by routers: Modeling, analysis and experiments

Chiun Lin Lim, Ki Suh Lee, Han Wang, Hakim Weatherspoon, Ao Tang
2014 2014 48th Annual Conference on Information Sciences and Systems (CISS)  
All the results predicted by the model are validated with experiments with real routers.  ...  We propose a simple pipeline model incorporating the inherent variation and a metric to measure packet clustering.  ...  The analysis to derive the interpacket delay and packet clustering follow the same path as the model with no cross traffic.  ... 
doi:10.1109/ciss.2014.6814168 dblp:conf/ciss/LimLWWT14 fatcat:akpdmf2alja6hl6cjtpc4ls7jy

Can software routers scale?

Katerina Argyraki, Sylvia Ratnasamy, Salman Baset, Byung-Gon Chun, Kevin Fall, Gianluca Iannaccone, Allan Knies, Eddie Kohler, Maziar Manesh, Sergiu Nedevschi
2008 Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow - PRESTO '08  
We identify the challenges in achieving this scalability and propose a solution: a cluster-based router architecture that uses an interconnect of commodity server platforms to build software routers that  ...  are both incrementally scalable and fully programmable.  ...  Our preliminary results are encouraging: back-of-the-envelope analysis combined with experiments on an unoptimized PC platform show that cluster-based software routers could indeed offer the scalability  ... 
doi:10.1145/1397718.1397724 dblp:conf/sigcomm/ArgyrakiBCFIKKMNR08 fatcat:zrqdp6dg2bckfdrpa5lxpslbfe

A detailed path-latency model for router geolocation

Sandor Laki, Peter Matray, Peter Haga, Istvan Csabai, Gabor Vattay
2009 2009 5th International Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities and Workshops  
The introduced techniques are validated in a wide range of experiments performed in the ETOMIC measurement infrastructure.  ...  The approach introduced in this paper can be used to localize all the network routers along the network path between the measurement nodes and can be combined with other existing geolocation techniques  ...  By means of ETOMIC experiments we collected two reference node sets that contain backbone routers with known .  ... 
doi:10.1109/tridentcom.2009.4976258 dblp:conf/tridentcom/LakiMHCV09 fatcat:r7tzhfuwn5fallinnlfw6xg7qe

Capturing Router Congestion and Delay

N. Hohn, K. Papagiannaki, D. Veitch
2009 IEEE/ACM Transactions on Networking  
Using a unique monitoring experiment, we capture all packets crossing a (lightly utilized) operational access router from a Tier-1 provider, and use them to provide a detailed examination of router congestion  ...  and packet delays.  ...  Kress, and T. Ye for facilitating the collection of the measurement data and making it possible, and for the development of the packet matching code.  ... 
doi:10.1109/tnet.2008.927258 fatcat:mvz77gulafcypfrx75medyp6be

Experimental study of router buffer sizing

Neda Beheshti, Yashar Ganjali, Monia Ghobadi, Nick McKeown, Geoff Salmon
2008 Proceedings of the 8th ACM SIGCOMM conference on Internet measurement conference - IMC '08  
If correct, buffers could be reduced by 99% in a typical backbone router today without loss in throughput.  ...  In this paper, we report buffer-sizing experiments performed on real networks -either laboratory networks with commercial routers as well as customized switching and monitoring equipment (UW Madison, Sprint  ...  Lakshman, Marina Thottan from Alcatel-Lucent, Pat Kush, and Tom Wilkes from Verizon communications for helping us with these experiments.  ... 
doi:10.1145/1452520.1452545 dblp:conf/imc/BeheshtiGGMS08 fatcat:iqs2xkif6bckdpfnxcdlhtnm3y

Router level filtering for receiver interest delivery

Manuel Oliveira, Jon Crowcroft, Christophe Diot
2000 Proceedings of NGC 2000 on Networked group communication - COMM '00  
The paper discusses protocol specification and implementation details of RLF, and shows how it may be implemented in routers.  ...  Contrary to other router filtering proposals, the filter semantics is determined by the application.  ...  ACKNOWLEDGMENTS The authors would like to thank the insightful and detailed comments given by the reviewers.  ... 
doi:10.1145/354644.354663 fatcat:rznxaw2smzfr3niwbguj76jleu

A model based approach for improving router geolocation

S. Laki, P. Mátray, P. Hága, I. Csabai, G. Vattay
2010 Computer Networks  
The techniques introduced in this paper are validated in wide range of experiments performed in the ETOMIC measurement infrastructure and in PlanetLab.  ...  First we introduce a detailed path-latency model to be able to determine the overall propagation delays along the network paths more accurately.  ...  Acknowledgements The authors thank the partial support of the National Office for Research and Technology (NAP 2005/KCKHA005) and the EU ICT OneLab2 Integrated Project (Grant agreement No. 224263).  ... 
doi:10.1016/j.comnet.2009.12.004 fatcat:bt3s2pfpjncqpc7aiijy56a6fi

Energy-efficient interconnect via Router Parking

A. Samih, Ren Wang, A. Krishna, C. Maciocco, C. Tai, Y. Solihin
2013 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA)  
Router Parking ensures that network connectivity is maintained, and limits the average interconnect latency impact of packet detouring around parked routers.  ...  However, even in state-of-the-art CMP designs, when a core goes to sleep the router attached to it remains active in order to continue packet forwarding.  ...  Moreover, since in RP-A, a cluster of routers can be parked as long as no network partitions are created, long detours may be introduced.  ... 
doi:10.1109/hpca.2013.6522345 dblp:conf/hpca/SamihWKMTS13 fatcat:nw7jjrza2zfmdbekdkob7hpgny

End-to-End Inference of Router Packet Forwarding Priority

G. Lu, Y. Chen, S. Birrer, F. E. Bustamante, C. Y. Cheung, X. Li
2007 IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications  
We validated our approach via statistical analysis, simulation, and wide-area experimentation in PlanetLab.  ...  Packet forwarding prioritization (PFP) in routers is one of the mechanisms commonly available to network administrators.  ...  This work was supported by China 863 Program under grant 2006AA01Z201130, for which we are very grateful.  ... 
doi:10.1109/infcom.2007.208 dblp:conf/infocom/LuCBBCL07 fatcat:ifn2ylb4w5fv7pv4unfaci62ge

Next generation routers

H.J. Chao
2002 Proceedings of the IEEE  
applications and protocols, shortening the design cycle and time-to-market, and reducing the implementation cost by avoiding the ASIC approach.  ...  This paper first points out the issues of building such routers, such as memory speed constraint, packet arbitration bottleneck, and interconnection complexity.  ...  Rojas-Cessa and G. Zhang for their assistance in preparing this paper.  ... 
doi:10.1109/jproc.2002.802001 fatcat:abbtxhetq5hwdisgdqavfgi2y4

Virtual routers on the move

Yi Wang, Eric Keller, Brian Biskeborn, Jacobus van der Merwe, Jennifer Rexford
2008 Computer communication review  
Hence, we propose VROOM (Virtual ROuters On the Move), a new network-management primitive that avoids unnecessary changes to the logical topology by allowing (virtual) routers to freely move from one physical  ...  We present the design, implementation, and evaluation of novel migration techniques for virtual routers with either hardware or software data planes.  ...  Migration based on a SD router introduces minimal delay increase and no packet loss to data traffic. 2. What is the impact of virtual router migration on routing protocols?  ... 
doi:10.1145/1402946.1402985 fatcat:bdwisclbwzh6lpjrggvtfikjaa

Virtual routers on the move

Yi Wang, Eric Keller, Brian Biskeborn, Jacobus van der Merwe, Jennifer Rexford
2008 Proceedings of the ACM SIGCOMM 2008 conference on Data communication - SIGCOMM '08  
Hence, we propose VROOM (Virtual ROuters On the Move), a new network-management primitive that avoids unnecessary changes to the logical topology by allowing (virtual) routers to freely move from one physical  ...  We present the design, implementation, and evaluation of novel migration techniques for virtual routers with either hardware or software data planes.  ...  Migration based on a SD router introduces minimal delay increase and no packet loss to data traffic. 2. What is the impact of virtual router migration on routing protocols?  ... 
doi:10.1145/1402958.1402985 dblp:conf/sigcomm/WangKBMR08 fatcat:4ezrpwdyibeeli4tat7j76tzqi

Fair scheduling in Internet routers

Nan Ni, L.N. Bhuyan
2002 IEEE transactions on computers  
Our studies indicate that early packet discard in anticipation of congestion is necessary and per-flow based buffering is effective for protecting benign users from being adversely affected by misbehaved  ...  AbstractÐInput buffered switch architecture has become attractive for implementing high performance routers and expanding use of the Internet sees an increasing need for quality of service.  ...  This research was supported by US National Science Foundation Grant CCR 0105676. Another version of this paper was presented at IEEE INFOCOM 2002.  ... 
doi:10.1109/tc.2002.1009152 fatcat:3w6z3l2nuvaqda2fnwz7664qgy

Detecting and Isolating Malicious Routers

A.T. Mizrak, Yu-Chung Cheng, K. Marzullo, S. Savage
2006 IEEE Transactions on Dependable and Secure Computing  
Finally, we present a prototype system, called Fatih, that implements this approach on a PC router and describe our experiences with it.  ...  By manipulating, diverting, or dropping packets arriving at a compromised router, an attacker can trivially mount denial-of-service, surveillance, or man-in-the-middle attacks on end host systems.  ...  ACKNOWLEDGMENTS This work was supported by US National Science Foundation Grant 0311690.  ... 
doi:10.1109/tdsc.2006.34 fatcat:u32t56ybsjcmvau7wyi25c2noy

Intelligent Packet Delivery in Router Using Structure Optimized Neural Network

R. Deebalakshmi, V. L. Jyothi
2018 Indonesian Journal of Electrical Engineering and Computer Science  
The router carries out this by using headers and routing tables to establish the best path for routing the data packets.  ...  Classification output forwarded to router dynamically for intellectual packet delivery. The method will improve router competence by greater than before throughput and decreased latency.  ...  Flows classified based on k-cluster centers. The cluster centers are defined by packet length and packets arrival time of application.  ... 
doi:10.11591/ijeecs.v10.i2.pp545-553 fatcat:h7ca3jf3hfar7hnzixuvjtxvey
« Previous Showing results 1 — 15 out of 8,649 results