Institute for Systems Research
Permanent URI for this communityhttp://hdl.handle.net/1903/4375
Browse
2 results
Search Results
Item Hybrid Network Management(1996) Baras, John S.; Ball, Michael O.; Karne, Ramesh K.; Whitefield, David; Kelley, Stephen; Jang, Kap D.; Plaisant, Catherine; Roussopoulos, Nick; Stathatos, Kostas; Vakhutinsky, Andrrew; Valluri, Jaibharat; ISR; CSHCNWe describe our collaborative efforts towards the design and implementation of a next generation integrated network management system for hybrid network (INMS/HN). We describe the overall software architecture of the system at its current stage of development. This network management system if specifically designed to address issues relevant for complex heterogeneous networks consisting of seamlessly interoperable terrestrial and satellite networks. Network management systems are a key element for interoperability in such networks. We describe the integration of configuration management and performance management. The next step in this integration is fault management. In particular we describe the object model, issues of the Graphical User Interface (GUI), browsing tools and performance data graphical widget displays, management, information database (MIB) organization issues. Several components of the system are being commercialized by Hughes Networks Systems.- A revised version of this technical report has been published in
Proceedings of the AIAA: 16th International Communications Satellite Systems Conference and Exhibit, Part 1, pp. 490-500, Washington, D.C., February 25- 29, 1996.Item Call Rerouting in an ATM Environment(1995) Ball, Michael O.; Vakhutinsky, A.; ISR; CSHCNATM networks must handle multiclass traffic with diverse quality of service requirements. We consider a multiclass routing model in which routes are calculated in a distributed fashion by the call origination nodes. Within this general context, we address the problem of rerouting a set of previously routed calls to avoid a failed link. Under the approach we propose, a single node executes an aggregate global rerouting of all affected calls and then converts the set of aggregate routes into an allocation of bandwidth on each link to call origination nodes for the purpose of rerouting. The bandwidth allocation is distributed to each origination node, which in turn then calculates routes for the individual calls. The problem faced by each call origination node is a variant of the so-called bandwidth packing problem. We develop and analyze an approximate algorithm for solving the problem in the specific context that arises in our setting.