Sciweavers

211 search results - page 37 / 43
» Inter-Domain Routing in Optical Networks
Sort
View
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
14 years 28 days ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
FOCS
1993
IEEE
13 years 11 months ago
Throughput-Competitive On-Line Routing
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, ...
Baruch Awerbuch, Yossi Azar, Serge A. Plotkin
MOBIHOC
2007
ACM
14 years 7 months ago
Balancing traffic load in wireless networks with curveball routing
We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink ...
Lucian Popa 0002, Afshin Rostamizadeh, Richard M. ...
ICCCN
2008
IEEE
14 years 1 months ago
Logical Topology Design for IP-over-WDM Networks: A Hybrid Approach for Minimum Protection Capacity
—The problem of designing high capacity and high bit rate IP-over-WDM networks, which can provide uninterrupted service in the presence of network equipment failures, continues t...
Muhammad S. Javed, Krishnaiyan Thulasiraman, Guoli...
NOCS
2007
IEEE
14 years 1 months ago
On the Design of a Photonic Network-on-Chip
Recent remarkable advances in nanoscale siliconphotonic integrated circuitry specifically compatible with CMOS fabrication have generated new opportunities for leveraging the uni...
Assaf Shacham, Keren Bergman, Luca P. Carloni