SPECIAL ISSUE ON ROUTE 2007Networks (New York, NY). 2009, Vol 54, Num 4, issn 0028-3045, 122 p.Conference Proceedings

Routing with QoS using bioinspired Models: An overviewGUILLEN PINTO, Edward Paul; JULIAN CAMARGO, Yeison; PAEZ, Rafael et al.Internet computing. International conferenceWorldComp'2011. 2011, pp 357-362, isbn 1-60132-186-4, 6 p.Conference Paper

Optimal Aircraft Routing in General Wind FieldsBIJLSMA, S. J.Journal of guidance, control, and dynamics. 2009, Vol 32, Num 3, pp 1025-1029, issn 0731-5090, 5 p.Article

Hardware routing lookup with SDRAMTWANG WEIZHANG; GE NING; FENG CHONGXI et al.High technology letters. 2001, Vol 7, Num 4, pp 32-34, issn 1006-6748Article

Routage dans les réseaux Internet = Routing in the internet networkRUBINO, Gerardo; TOUTAIN, Laurent.Techniques de l'ingénieur. Informatique. 2000, Vol HB1, Num H1428, pp H1428.1-H1428.14, issn 0245-9612Article

IP packet forwarding based on comb extraction schemeZHEN XU; DAMM, Gerard; LAMBADARIS, Loannis et al.IEEE International Conference on Communications. 2004, isbn 0-7803-8533-0, vol2, 1065-1069Conference Paper

Comparison of DTN Routing Protocols and Their Buffer Utilization using ONE SimulatorFATHIMA, G; WAHIDABANU, R. S. D.Wireless networks. International conferenceWorldComp'2010. 2010, pp 252-256, isbn 1-60132-150-3 1-60132-164-3 1-60132-165-1, 5 p.Conference Paper

Fighting Physics: A Tough BattleSMITH, Jonathan M.Communications of the ACM. 2009, Vol 52, Num 7, pp 60-65, issn 0001-0782, 6 p.Article

Design issues with MMI-based photonics switches and routersCAHILL, Laurence W.Proceedings of SPIE, the International Society for Optical Engineering. 2007, pp 64750I.1-64750I.9, issn 0277-786X, isbn 978-0-8194-6588-7, 1VolConference Paper

Anycasting in adversarial systems: Routing and admission controlAWERBUCH, Baruch; BRINKMANN, André; SCHEIDELER, Christian et al.Lecture notes in computer science. 2003, pp 1153-1168, issn 0302-9743, isbn 3-540-40493-7, 16 p.Conference Paper

User-level Internet path diagnosisMAHAJAN, Ratul; SPRING, Neil; WETHERALL, David et al.Operating systems review. 2003, Vol 37, Num 5, pp 106-119, issn 0163-5980, 14 p.Conference Paper

Improving InfiniBand routing through multiple virtual networksFLICH, J; LOPEZ, P; SANCHO, J. C et al.Lecture notes in computer science. 2002, pp 49-63, issn 0302-9743, isbn 3-540-43674-X, 15 p.Conference Paper

An Efficient Routing Mechanism in Network SimulationZHIYU HAO; XIAOCHUN YUN; HONGLI ZHANG et al.Simulation (San Diego, Calif.). 2008, Vol 84, Num 10-11, pp 511-520, issn 0037-5497, 10 p.Article

Performance Evaluation of a multi-granularity and multi-connectivity circuit switched networkNAIXING GUO; MAOQING XIN; WEIQIANG SUN et al.Proceedings of SPIE, the International Society for Optical Engineering. 2008, pp 67840H.1-67840H.9, issn 0277-786X, isbn 978-0-8194-6947-2Conference Paper

How do we model attention-dependent signal routing?KREITER, Andreas K.Neural networks. 2006, Vol 19, Num 9, pp 1443-1444, issn 0893-6080, 2 p.Article

Enforcing convergence in inter-domain routingCOBB, Jorge A; MUSUNURI, Ravi.IEEE Global Telecommunications Conference. 2004, pp 1353-1358, isbn 0-7803-8794-5, 6 p.Conference Paper

Routing XML queriesKOUDAS, Nick; RABINOVICH, Michael; SRIVASTAVA, Divesh et al.International Conference on data engineering. 2004, isbn 0-7695-2065-0, 1Vol, p. 844Conference Paper

Multihoming route control among a group of multihomed stub networks : Concurrent multipath transportYONG LIU; NARASIMHA REDDY, A. L.Computer communications. 2007, Vol 30, Num 17, pp 3335-3345, issn 0140-3664, 11 p.Article

Finding min-sum disjoint shortest paths from a single source to all pairs of destinationsBING YANG; ZHENG, S. Q.Lecture notes in computer science. 2006, pp 206-216, issn 0302-9743, isbn 3-540-34021-1, 1Vol, 11 p.Conference Paper

Klein bottle routing : An alternative to onion routing and mix networkKUN PENG; MANUEL, Juan NIETO; DESMEDT, Yvo et al.Lecture notes in computer science. 2006, pp 296-309, issn 0302-9743, isbn 3-540-49112-0, 1Vol, 14 p.Conference Paper

Modelling and constraint hardness characterisation of the unique-path OSPF weight setting problemCHANGYONG ZHANG; RODOSEK, Robert.Lecture notes in computer science. 2005, pp 804-811, issn 0302-9743, isbn 3-540-26032-3, 3Vol, 8 p.Conference Paper

Topology-aware routing in structured peer-to-peer overlay networksCASTRO, Miguel; DRUSCHEL, Peter; HU, Y. Charlie et al.Future directions in distributed computing (research and position papers). Lecture notes in computer science. 2003, pp 103-107, issn 0302-9743, isbn 3-540-00912-4, 5 p.Book Chapter

Self-organizing subsets: From each according to his abilities, to each according to his needsVAHDAT, Amin; CHASE, Jeff; BRAYNARD, Rebecca et al.Lecture notes in computer science. 2002, pp 76-84, issn 0302-9743, isbn 3-540-44179-4, 9 p.Conference Paper

Extremal throughputs in free-choice netsBOUILLARD, Anne; GAUJAL, Bruno; MAIRESSE, Jean et al.Lecture notes in computer science. 2005, pp 108-127, issn 0302-9743, isbn 3-540-26301-2, 20 p.Conference Paper

Low-fragmentation mapping strategies for linear forwarding tables in InfiniBand<^TM>LOPEZ, Pedro; FLICH, José; ROBLES, Antonio et al.Lecture notes in computer science. 2003, pp 947-957, issn 0302-9743, isbn 3-540-40788-X, 11 p.Conference Paper