by

DOI: 10.1023/A:1018715227166
Print publication date: 6/1/1999
View article on SpringerLink

by Ho, L. Lawrence

DOI: 10.1023/A:1018763110328
Print publication date: 6/1/1999
View article on SpringerLink

by Mathan, Luc

DOI: 10.1023/A:1018711126257
Print publication date: 6/1/1999
View article on SpringerLink

by Bush, Stephen F.; Frost, Victor S.

There is a trend toward the use of predictivesystems in communications networks. At the systems andnetwork management level predictive capabilities arefocused on anticipating network faults and performance degradation. Simultaneously, mobilecommunication networks are being developed withpredictive location and tracking mechanisms. Theinteractions and synergies between these systems presenta new set of problems. A new predictive network managementframework is developed and examined. The interactionbetween a predictive mobile network and the proposednetwork management system is discussed. The Rapidly Deployable Radio Network (RDRN) is used as aspecific example to illustrate theseinteractions.

DOI: 10.1023/A:1018759009419
Print publication date: 6/1/1999
View article on SpringerLink

by Grover, W. D.; Li, D. Y.

To date, mesh network design theory has beendeveloped for the case where working and protectioncapacity is terminated at every node. It is recognizedthat express routes, which bypass some nodes en-route, would decrease the total DCS port costs but ithas been unclear how to incorporate bypass planning inthe optimal spare capacity design for a mesh-restorablenetwork. An important issue is whether the introduction of nodal bypass will increase the total sparecapacity needed for restorability, due to a reduction ofrestoration re-routing flexibility. To address thesequestions, we introduce the forcer concept for analysis of the relationship between workingand spare capacity in a mesh-restorable network. Weapply the forcer concept to show theoretically whybypass in fact need never require an increase in sparing and may actually permit a decrease in somecases. In tests to validate and exploit these findings,an average reduction of 12% in total spare capacity and16% in DCS port count totals were obtainedsimultaneously with an Integer Programming optimization. Thesesavings are relative to an already optimized fullyterminated network design. The work thus contributes togreater theoretical understanding and designcost-effectiveness for mesh-based restorable networks.

DOI: 10.1023/A:1018707025349
Print publication date: 6/1/1999
View article on SpringerLink

by Demestichas, P. P.; Demesticha, V. P.; Manolessos, Y. I.; Stamoulis, G. D.; Theologou, M. E.

The complexity and sophistication of integratedbroadband networks call for a broad repertoire ofmanagement methods. Foreseen intensive competition ofthe communications market, and the upgrade ofend-customer’s satisfaction as the focal point of anymanagement policy, raise a very important problem: howto utilize efficiently the resources of the networkwhile maintaining the Quality of Service (QoS) provided to end-users within a pre-negotiated range. Inthis paper, a QoS management architecture for multimediaapplications based on an application control scheme isproposed. Adhering to the Total Quality Management (TQM) paradigm, we let management span over theentire communication stack, the entire network(end-to-end) and the entire call duration. Applicationcontrol scheme aims to meet pre-specified QoS goals by adjusting the traffic produced by theend-user applications. The adjustment technique is basedon the notion that each multimedia session is allowed tooperate on a set of discrete application quality levels. A method for monitoring and assessingthe end-user perceived quality is presented. Themathematical problem of optimal resources allocation andan associated heuristic are specified. Finally, a specific instantiation of the introduced QoSmanagement architecture on a real testbed is describedand experimentation results are presented andevaluated.

DOI: 10.1023/A:1018754908511
Print publication date: 6/1/1999
View article on SpringerLink

by Tsotras, Vassilis J.; Phalke, Vidyadhar; Kumar, Anil; Gopinath, B.

In many network management applications, likepost-mortem fault analysis or performance trendsprofiling, it is advantageous to have the ability toview the state of the network as it was at some time in the past. To support such Temporal Views anefficient data organization, or access method, is neededfor storing and updating network related data (as thenetwork evolves over time) and for retrieving requested past network states. For applications where thenetwork manager is not interested in the full (and maybetoo large) snapshot of a past network state it is usefulif partial state snapshots can be extracted quickly. It is thus of particular interest toconstruct an access method that can efficiently supportPartial Temporal Views. Efficiency implies that arequested partial temporal view should be constructed directly, without first computing the elaboratefull temporal view. In this paper we present a newaccess method (called the Neighbor History Index) forthis problem. One of the advantages of this method is that the update processing is independent ofthe evolution size (the total number of changes in theevolution). In addition, our method uses a small diskspace overhead. We then present a general framework for organizing time-evolving network data. Ourframework distinguishes between flat and hierarchicalevolutions and subsequently between flat andhierarchical temporal views. We also provide a way toefficiently construct temporal views on hierarchicalevolutions. This paper shows that supporting temporalviews on flat or hierarchical evolutions is notexpensive: our solutions use small space overhead, havesmall updating and compute temporal viewsfast.

DOI: 10.1023/A:1018702924440
Print publication date: 6/1/1999
View article on SpringerLink

by Man, Fu-Tin

DOI: 10.1023/A:1018750807602
Print publication date: 6/1/1999
View article on SpringerLink