Graph Theory Applications in Developing Software Test Strategies for Networking Services

#Computer #Society #Student #Branch #Networking #Graph #Theory
Share

ABSTRACT

 

The graph-based metrics (cyclomatic complexity, essential complexity, module design complexity, system design complexity, and system integration complexity) are reviewed and applied for analyzing the C-code complexity and estimating the number of integration and unit tests for two networking systems: Carrier Networks Support system with switches and routers, and Aggregation System for networking services. Comparing different code releases, it is found that the reduction of the code complexity leads to significant reduction of errors and maintainability efforts. The test and code coverage issues for networking systems are also discussed.

 



  Date and Time

  Location

  Hosts

  Registration



  • Date: 30 Oct 2019
  • Time: 12:00 PM to 02:00 PM
  • All times are (GMT-05:00) US/Eastern
  • Add_To_Calendar_icon Add Event to Calendar
  • Nashua Community College
  • 505 Amherst St
  • Nashua, New Hampshire
  • United States 03063
  • Building: Wellness Center 2nd floor
  • Room Number: McIntire Room #200
  • Click here for Map

  • Contact Event Host
  • Co-sponsored by Nashua Community College IEEE Student Branch
  • Starts 14 October 2019 10:11 PM
  • Ends 29 October 2019 01:00 PM
  • All times are (GMT-05:00) US/Eastern
  • No Admission Charge


  Speakers

Rivier University 420 S. Main Street • Nashua, NH 03060-5086 E-mails: vriabov@rivier.edu

Topic:

Graph Theory Applications in Developing Software Test Strategies for Networking Services

ABSTRACT

 

The graph-based metrics (cyclomatic complexity, essential complexity, module design complexity, system design complexity, and system integration complexity) are reviewed and applied for analyzing the C-code complexity and estimating the number of integration and unit tests for two networking systems: Carrier Networks Support system with switches and routers, and Aggregation System for networking services. Comparing different code releases, it is found that the reduction of the code complexity leads to significant reduction of errors and maintainability efforts. The test and code coverage issues for networking systems are also discussed

Biography:

BRIEF BIOGRAPHY

 

Dr. Vladimir V. Riabov is a professor and director of Computer Science programs at Rivier University, Nashua, NH. He published more than 140 chapters, journal articles and conference papers on Networking Technologies, Computer Security, Computational Algorithms, Code Testing, Aerothermodynamics, and Hypersonic Flows. Vladimir received a Ph.D. in Mathematics and Physics from Moscow Institute of Physics and Technology and M.S. in Computer Information Systems from Southern New Hampshire University. He is a senior member of ACM and AIAA, and a member of IEEE and MAA.