Sciweavers

95 search results - page 18 / 19
» Node-Capacitated Ring Routing
Sort
View
JSAC
2006
157views more  JSAC 2006»
13 years 10 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
SPAA
1999
ACM
14 years 3 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
TON
2002
117views more  TON 2002»
13 years 10 months ago
Generalized loop-back recovery in optical mesh networks
Current means of providing loop-back recovery, which is widely used in SONET, rely on ring topologies, or on overlaying logical ring topologies upon physical meshes. Loop-back is d...
Muriel Médard, Richard A. Barry, Steven G. ...
ARC
2010
Springer
178views Hardware» more  ARC 2010»
14 years 5 months ago
An Analysis of Delay Based PUF Implementations on FPGA
Physical Unclonable Functions promise cheap, efficient, and secure identification and authentication of devices. In FPGA devices, PUFs may be instantiated directly from FPGA fabri...
Sergey Morozov, Abhranil Maiti, Patrick Schaumont
ISCC
2006
IEEE
14 years 4 months ago
An Optimized Peer-to-Peer Overlay Network for Service Discovery
In this paper, we propose DINPeer, an optimized peer-to-peer (P2P) overlay network for service discovery by overcoming limitations in current multicast discovery approaches and P2...
H. Q. Guo, D. Q. Zhang, Lek Heng Ngoh, Wai-Choong ...