Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Computer Engineering

Specification And Verification Of Generic Cell Rate Algorithms In Pvs, Huseyin Ozgungor Jul 1997

Specification And Verification Of Generic Cell Rate Algorithms In Pvs, Huseyin Ozgungor

Electrical & Computer Engineering Theses & Dissertations

Formal verification methods have been considered as a powerful complementary approach to define standards and to prove correctness of the systems. In this work, formal specification of Generic Cell Rate Algorithms are defined and proved. The specification process enables standardization for constructing Generic Cell Rate Algorithms. Standardization is an important process in the Asynchronous Transfer Mode (ATM) networks. By employing formal methods, the necessary standards could be constructed to allow different algorithms to be employed which still meet system requirements. Those system requirements are quantified in the Quality of Service (QOS).

Congestion management is a vital concept for networks in …


Single Row Routing: Theoretical And Experimental Performance Evaluation, And New Heuristic Development, David A. Hysom May 1997

Single Row Routing: Theoretical And Experimental Performance Evaluation, And New Heuristic Development, David A. Hysom

Computer Science Theses & Dissertations

The Single Row Routing Problem (SRRP) is an abstraction arising from real-world multilayer routing concerns. While NP-Complete, development of efficient SRRP routing heuristics are of vital concern to VLSI design. Previously, researchers have introduced various heuristics for SRRP; however, a comprehensive examination of SRRP behavior has been lacking.

We are particularly concerned with the street-congestion minimization constraint, which is agreed to be the constraint of greatest interest to industry. Several theorems stating lower bounds on street congestion are known. We show that these bounds are not tight in general, and argue they may be in error by at least 50% …