Chad Peyton

According to our database, Chad Peyton authored at least 3 papers between 2001 and 2002.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2002

An Efficient Routing Algorithm for All-Optical Networks with Turn Constraints.

Hamdy S. Soliman, Chad Peyton

Proceedings of the 10th International Workshop on Modeling, 2002

A Link-Labeling Algorithm for Computing the Shortest Path based upon Edge and Turn Constraints.

Hamdy S. Soliman, Chad Peyton

Proceedings of the ISCA 17th International Conference Computers and Their Applications, 2002

2001

Modeling technological limitations in all-optical networks.

Chad Peyton, Hamdy S. Soliman

Proceedings of the ISCA 16th International Conference Computers and Their Applications, 2001