Sciweavers

1204 search results - page 169 / 241
» Optimal Routing in a Small-World Network
Sort
View
COCOON
2008
Springer
15 years 8 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
PE
2007
Springer
112views Optimization» more  PE 2007»
15 years 5 months ago
Performance bounds for feedforward queueing networks with upper-constrained inputs
We propose a simple framework for analyzing feedforward queueing networks that have the following features: each customer belongs to a (customer) flow and the route that a custom...
S. Shioda
ICC
2007
IEEE
125views Communications» more  ICC 2007»
16 years 18 days ago
Analytical Tool to Achieve Wavelength Conversion Performance in No Wavelength Conversion Optical WDM Networks
— We present an analytical tool to enhance the blocking performance in the circuit-switched wide-area optical wavelength division multiplexed (WDM) networks with no wavelength co...
Pachamuthu Rajalakshmi, Ashok Jhunjhunwala
FTDCS
2004
IEEE
15 years 10 months ago
Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
Rolf Winter, Thomas Zahn, Jochen H. Schiller
ASPDAC
2008
ACM
91views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Heuristic power/ground network and floorplan co-design method
It's a trend to consider power supply integrity at early stage to improve the design quality. In this paper, we propose a novel algorithm to optimize floorplan together with P...
Xiaoyi Wang, Jin Shi, Yici Cai, Xianlong Hong