1. Agenda 1. Quiz 2. CMIS 3. BI 4. MANET

2. Management In The OSI Stack ACSE ROSE Presentation Session Transport Network Data Link Physical Mgt Appl Process CMISE

3. Common Management Information Services (CMIS) Foundation: Each CMIS service is a single operation that a network management operation can perform. Any application that performs systems manage- ment is a CMISE-service-user. The existence of defined services between peer open systems is an important difference between CMIS and SNMP. CMIS has defined three classes of service Management Association Management Notification Management Operation

4. Common Management Information Services (CMIS) Management Association: M-INITIALIZE institutes an association M-TERMINATE terminates an association M-ABORT is used for abnormal termination Management Notification: M-EVENT-REPORT services are CMIS traps (although less structured)

5. Common Management Information Services (CMIS) Management Operation: M-GET is like Get-Request M-CANCEL-GET cancels M-GET M-SET is like Set-Request allowing modification of info M-ACTION is like Set-Request invoking new action, like delegating fault management M-CREATE creates another instance of a managed object M-DELETE deletes an instance of a managed object

6. CMIS/Common Management Information Protocol (CMIP) Foundation: Is the protocol that accepts operations and initiates instructions Uses ROSE to send messages across the network Problems (because it’s so powerful): Requires large amounts of overhead Is difficult to implement

7. Common Mgt. Information Services over TCP/IP (CMOT) ACSE ROSE Lightweight Presentation Protocol (LPP) Session TCP UDP IP Data Link Physical Mgt Appl Process CMISE Tough, really tough! ACSE (Association Control Service Element) handles association establishment & release. ROSE (Remote Operations Service Element) is the application protocol used to access remote systems. LPP is effectively an abbreviated Presentation Layer.

8. New Network Management Tools: Business Intelligence

9. The Problem (An e.g., of Net Mgt morphing into Knowledge Mgt): What is the “truth”? o Every department has reports, alerts, scores, etc., for IT to automate o Increasingly R&D, Marketing, Maintenance are operating from vastly different baselines & assumptions (e.g., Verizon Wireless) o Companies need a standardized platform to analyze business data o Organizations need to integrate conventional data sources, such as relational databases & on-line analytical processing (OLAP) with flat files, XML & Web services. o What drives standardization? o Architecture o Integration

10. New Network Management Tools: Business Intelligence One increasingly popular solution: Architecturally consistent data integration with BI software: o Ways of cleaning up data Fix the data source (depending on number of inputs) Construct cubes & data sources that filter out bad data Ignore the data and let end users filter it out manually (How you do this is dependent on the BI architecture) o Presenting a single version of the “truth” Integrate this intermediate layer with other data sources Web services XML files Spread sheets Develop calculated fields to ensure consistency Develop translation systems that bring in consistent information

11. New Network Management Tools: Business Intelligence BI By the numbers: 5 to 15 BI tools are used by Global 2000 companies & large government organizations 38% of IT execs have increasing budgets 48% of IT execs plan to maintain budgets $7.3 billion in projected software sales by 2008 65% of report producers selected Excel CIOs surveyed by the Gartner Group identified BI as their # 2 Technology priority this year.

12. Business Intelligence Tools: General Qualities Tool Good ThingBad ThingStarting Price Cognos Ad hoc queries Linking reports $12,500 Enterprise BI Series 7 Actuate 8 Integrating disparate Ad hoc queries $500 per user with Service data sources Pack 1 Information Linking reports Dealing with $400 per seat Builders reserved words WebFocus 7 e.g., TOTAL Microsoft SQL Server Supports all OLAP Report $3,899 per 2000 Rpt & models (HOLAP, generation processor Analysis Svcs MOLAP & ROLAP)

13. Business Intelligence Tools: Functionality Tool Database Operating System Reports Cognos XML, DB2, Sybase, Windows, Easy Enterprise BI Oracle, SQL Server, Linux/AIX/HP-UX Series 7 Ingres Solaris Actuate 8 XML, DB2, Sybase, Windows, Easy with Service Oracle, SQL Server, Linux/AIX/HP-UX Pack 1 Engress, MySQL Solaris Information XML, DB2, Sybase, Windows, Easy Builders Oracle, SQL Server, Linux/AIX/HP-UX WebFocus 7 Engress, MySQL Solaris Microsoft XML, DB2, Sybase, Windows Harder SQL Server Oracle, SQL Server, 2000 Rpt & Engress, MySQL Analysis Svcs

14. New Network Management Tools: Net Comp Evaluation Services Wt. Congnos Actuate InfoBuild Microsoft Reporting 35% 5 4 4 2 OLAP 30% 5 4 4 5 Integration 20% 4 4 4 2 Administration 10% 4 4 4 2 Price 5% 3 4 4 5 Total Score 4.20 4.00 4.00 3.7 B+ B B C Note: Scores weighted 0-5

15. New Network Management Tools: Mobile Ad hoc Networks (MANETs)

16. New Network Management Tools: MANET Three types of protocols: o Proactive Protocols: Any node in the network has oneor more routes to any possible location in its routing table at any given time. o Reactive Protocols: Every node in a network obtains a routed to a destination on a demand fashion o Hybrid Routing Protocols: Every node acts reactively in the region close to its proximity and proactively outside of that region or zone

17. New Network Management Tools: Proactive MANET Optomized Link State Roputing (OLSR): o Based on the basic link state algorithm o Adapts to changes of the network without creating control messages overhead due to protocol flooding nature o Only multi-point relays are designated for link state updates

18. New Network Management Tools: Proactive MANET Optomized Link State Roputing (OLSR): o Principal Advantages (because each node maintains up-to-date routing table): o Low latency o High delivery ratio o Main disadvantage: Because of proactive nature and flooding mechanism, it may introduce a high routing overhead consuming a large portion of the available bandwidth.

19. New Network Management Tools: Reactive MANET Ad hoc On-demand Distance Vector (AODV): o Based on the Bellman-Ford algorithm o Uses originator and destination sequence numbers to avoid loops and the count-to-infinity problem o Routing table does not maintain a route for every possible destination—just destinations recently used (purpose is to reduce overhead) o Supports unicast and multicast routing

20. New Network Management Tools: Reactive MANET Ad hoc On-demand Distance Vector (AODV): o Principal Advantages o Reactive nature reduces the routing overhead o Destination sequence numbers address routing loops and the count-to- infinity problem o Principal Disadvantages o Replies to route discovery messages can introduce storming conditions o Periodic HELLO messages to maintain connectivity can overuse bandwidth

21. New Network Management Tools: Hybrid Routing Protocols Zone Routing Protocol (ZRP): o A distributed routing protocol that combines both a proactive and a reactive scheme for route discovery and maintenance o Creates zones where every node maintains one or more routes to every other node o Reactively maintains routing information for every node outside the zone o Maintains Intrazone Routing Protocol for routes in the zone and Intrazone Routing Protocol for finding available routes outside the zone

22. New Network Management Tools: Hybrid Routing Protocols Zone Routing Protocol (ZRP): o Principal Advantage: o Avoids flooding the network with route-request messages (as do reactive nets) o Principal Disadvantage: o Performance can vary greatly, depending on zone radius

23. Definitions Link State algorithm Definition: The basic concept is that every node receives a map of the connectivity of the network, in the form of a graph showing which nodes are connected to which other nodes. Each node then independently calculates the best next hop from it for every possible destination in the network. Bellman-Ford algorithm Definition: An efficient algorithm to solve the single-source shortest-path problem. Weights may be negative. The algorithm initializes the distance to the source vertex to 0 and all other vertices to ∞. It then does V-1 passes (V is the number of vertices) over all edges relaxing, or updating, the distance to the destination of each edge. Finally it checks each edge again to detect negative weight cycles, in which case it returns false. The time complexity is O(VE), where E is the number of edges.