Search
Skip to Search Results- 13_SAT
- 1Augmented Data Manipulator networks
- 1Communication Networks
- 1Completeness
- 1Equivalence
- 1Firewalls
-
An O(N^1.695) Permutation Routing Algorithm on Augmented Data Manipulators
1997
Elmallah, Ehab, Lam, Chin-Hung
Technical report TR97-07. This paper shows an O(N^1.695) time algorithm for routing any arbitrary admissible permutation on Augmented Data Manipulator networks. The devised algorithm appears to be the first known polynomial time algorithm for solving the above problem. | TRID-ID TR97-07
-
2013
Gouda, Mohamed, Elmallah, Ehab
We identify 13 problems whose solutions can significantly enhance our ability to design and analyze firewalls and other packet classifiers. These problems include the firewall equivalence problem, the firewall redundancy problem, the firewall verification problem, and the firewall completeness...
-
1995
Stewart, Lorna, Elmallah, Ehab
Technical report TR95-03. For any fixed integer k >= 2, define the class of k-polygon graphs as the intersection graphs of chords inside a convex k-polygon, where the endpoints of each chord lie on two different sides. The case where k=2 is degenerate; for our purpose, we view any pair of...