Tomoya Kitani - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged routing

Maintaining colored trees for disjoint multipath routing under node failuresGiridhar Jayavelu, Srinivasan Ramasubramanian, Ossama Younis. ton, 17(1):346-359, 2009. [doi]

Efficient VANET-Based Traffic Information Sharing using Buses on Regular RoutesTomoya Kitani, Takashi Shinkawa, Naoki Shibata, Keiichi Yasumoto, Minoru Ito, Teruo Higashino. vtc 2008: 3031-3036 [doi]

Compact roundtrip routing with topology-independent node namesjcss, 74(5):775-795, 2008. [doi]

Freight Train Routing and Scheduling in a passenger rail Network: Computational Complexity and the Stepwise Dispatching HeuristicT. Godwin, Ram Gopalan, T. T. Narendran. apjor, 24(4):499-533, 2007. [doi]

Route Reservation in Ad Hoc Wireless NetworksSooksan Panichpapiboon, GianLuigi Ferrari, Nawaporn Wisitpongphan, Ozan K. Tonguz. tmc, 6(1):56-71, 2007. [doi]

Advances in Onion Routing: Description and backtracing/investigation problemsDario V. Forte. di, 3(2):85-88, 2006. [doi]

The Medium Time Metric: High Throughput Route Selection in Multi-rate Ad Hoc Wireless NetworksBaruch Awerbuch, David Holmer, Herbert Rubens. monet, 11(2):253-266, 2006. [doi]

Trusted Computing for Protecting Ad-hoc RoutingMichael Jarrett, Paul Ward. cnsr 2006: 61-68 [doi]

Analytical Evaluation of the Overhead Generated by a Routing Scheme with Subnets for MANETsJohann López, Steluta Gheorghiu, José M. Barceló. eurongi 2007: 126-143 [doi]

An Infrastructure Supporting Secure Internet RoutingStephen T. Kent. europki 2006: 116-129 [doi]

Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networksNina Skorin-Kapov. jsac, 24(S-8):2-15, 2006. [doi]

A genetic algorithm for unmanned aerial vehicle routingMatthew A. Russell, Gary B. Lamont. gecco 2005: 1523-1530 [doi]

Inter-domain routing: Algorithms for QoS guaranteesSamphel Norden. cn, 49(4):593-619, 2005. [doi]

The Multi-depot Periodic Vehicle Routing ProblemAristide Mingozzi. sara 2005: 347-350 [doi]

An automated technique for topology and route generation of application specific on-chip interconnection networksKrishnan Srinivasan, Karam S. Chatha, Goran Konjevod. iccad 2005: 231-237

An Adaptive Routing Algorithm for Intelligent and Transparent Optical NetworksReinaldo G. Dante, Fabiano J. L. Pádua, Edson Moschim, Joaquim F. Martins-Filho. ICT 2004: 336-341 [doi]

Solving a vehicle routing problem by balancing the vehicles time utilizationGeorge Nikolakopoulou, S. Kortesis, A. Synefaki, R. Kalfakakou. eor, 152(2):520-527, 2004. [doi]

On interactions between routing and detailed placementDevang Jariwala, John Lillis. iccad 2004: 387-393 [doi]

A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of ResourcesJosé Duato, Timothy Mark Pinkston. tpds, 12(12):1219-1235, 2001. [doi]

Measuring Web Navigational Capability Using Paths, Distances, Loops, and Routes - the WebStruct ToolThawatchai Piyawat, Jantawan Noiwan, Anthony F. Norcio. webnet 2001: 1013

Efficient routability check algorithms for segmented channel routingCheng-Hsing Yang, Sao-Jie Chen, Jan-Ming Ho, Chia-Chun Tsai. todaes, 5(3):735-747, 2000. [doi]

The channeled-BSG: a universal floorplan for simultaneous place/route with IC applicationsShigetoshi Nakatake, Keishi Sakanushi, Yoji Kajitani, Masahiro Kawakita. iccad 1998: 418-425 [doi]

Worst Case Bounds for Shortest Path Interval RoutingCyril Gavoille, Eric Guévremont. jal, 27(1):1-25, 1998.

Norton s Equivalent for Queueing Networks Comprised of Quasireversible Components Linked by State-Dependent RoutingRichard J. Boucherie. pe, 32(2):83-99, 1998.

Routing Multicast Streams in Clos NetworksDe-Ron Liang, Chen-Liang Fang. euro-pds 1997: 231-236

A Permutation Routing Algorithm for Double Loop NetworksFrank K. Hwang, Tzai-Shunne Lin, Rong-Hong Jan. ppl, 7(3):259-265, 1997.

The Artificial Life Route to Artificial Intelligence: Building Embodied, Situated Agents, edited by Luc Steels and Rodney BrooksAlan MacLennan. jasis, 47(6):482-483, 1996.

Results Given by a New Evaluation System for Placement and Routing HeuristicsReinhard Rauscher, Dieter Klawan, Hans-Jürgen Bandelt. euromicro 1996: 259-266 [doi]

Routing on longest-matching prefixesWillibald A. Doeringer, Günter Karjoth, Mehdi Nassehi. ton, 4(1):86-97, 1996. [doi]

An investigation of iterative routing algorithmsZahir Moosa, Douglas Edwards. eurodac 1995: 91-96 [doi]

A Universal Proof Technique for Deadlock-Free Routing in Interconnection NetworksLoren Schwiebert, D. N. Jayasimha. spaa 1995: 175-184 [doi]

Evaluating Traffic Effects of a Route Guidance System by Dynamic SimulationQ. Chen, Hans-Jürgen Stauss. eurosim 1995: 1071-1076

Channel-driven global routing with consistent placement (extended abstract)Shigetoshi Nakatake, Yoji Kajitani. iccad 1994: 350-355 [doi]

Routing in multidomain networksDragomir D. Dimitrijevic, Basil S. Maglaris, Robert Boorstyn. ton, 2(3):252-262, 1994. [doi]

Latency Reduction in VLSI RoutersChris R. Jesshope. ppl, 3:485-494, 1993.

An Efficient Routing Scheme for Scalable Hierarchical NetworksHyunmin Park, Dharma P. Agrawal. spdp 1993: 158-165

Maze router without a grid mapJiri Soukup. iccad 1992: 382-385 [doi]

Optimality of routing and servicing in dependent parallel processing systemsRonald Menich, Richard F. Serfozo. questa, 9(4):403-418, 1991. [doi]

School-bus routing for program schedulingJames H. Bookbinder, Steven H. Edwards. cor, 17(1):79-94, 1990. [doi]

SNA Virtual Route PerformanceRichard Hammond. cmg 1990: 198-206

A Deadlock Free Routing Algorithm with Network Size Independent Buffering SpaceLéon Mugwaneza, Traian Muntean, Ibrahima Sakho. conpar 1990: 489-501

Measurement and Prediction of Computer Performance at the FAA s en Route Air Traffic Control CentersEric W. Brehm, Shin-Sun Chow, Robert T. Goettge. cmg 1988: 317-320

On Efficiency of Interval Routing AlgorithmsPeter Ruzicka. mfcs 1988: 492-500

Dynamic Routing & Prospects for On-Line ImplementationEmmanuel N. Protonotarios, George I. Stassinopoulos. icc 1986: 141-144

A K-Shortest Path Algorithm for Adaptive Routing in Communication NetworksDonald M. Topkis. icc 1986: 108-113

A Direct Routing Algorithm for the Bit-Reversal Permutation on a Shuffle-Exchange NetworkIngrid J. M. Birkhoff. ipl, 21(5):259-268, 1985.

Datagram routing for internet multicastingLorenzo Aguilar. ccr, 14(2):58-63, 1984. [doi]

A New Flood Routing Technique For Fibre Optic Local Area Networks With Arbitrary TopologyH. K. Pung, P. A. Davies. icc 1984: 1154-1158

Capacity Planning Queueing Model for an ACP/TPF Message Routing SystemBijay Roy, Bill Hamilton. cmg 1984: 640-642

Dynamic Routing in WISPAC: A Continuous System Simulation MachineJ. Castillo, S. D. Smith. icdcs 1982: 590-595

runs on WebDSL