by Lutfiyya, Hanan; Burgess, Mark; Wijesekera, Duminda

DOI: 10.1007/s10922-006-9046-5
Online Date: 10/18/2006
Print publication date: 12/1/2006
View article on SpringerLink

by Gupta, Ankur

This article analyzes the frameworks employed by existing network management solutions and points out their shortcomings. It also examines the current trends as observed in various commercial solutions in the network management domain. Finally, the paper presents some future perspectives on the concepts/technologies which could be utilized to build the next generation of network management solutions.

DOI: 10.1007/s10922-006-9044-7
Online Date: 10/17/2006
Print publication date: 12/1/2006
View article on SpringerLink

by Boujelben, Yassine; Girard, André; Sansò, Brunilde

We consider the problem of deciding on which transmission systems to carry a given number of services or sessions to minimize link cost and to guarantee a required degree of reliability. The sessions come in a variety of types, each with different requirements and the transmission systems can meet some of these requirements at some cost. We define a new optimization model for the Link Dimensioning and Service Assignment (LDSA) problem, an extension of current work on link dimensioning problems where a common assumption is that there is a single transmission system type on each link. We find that under realistic assumptions about the number of session types and transmission classes, it is possible to solve the LDSA problem to optimality in reasonable time using a combinatorial approach based on the maximal configuration concept. We also propose an efficient stopping criterion for large problems that gives near-optimal solutions within a few seconds. This efficient solution procedure can then be used to solve different network management problems where capacity assignment and survivability issues are involved.

DOI: 10.1007/s10922-006-9042-9
Online Date: 10/17/2006
Print publication date: 12/1/2006
View article on SpringerLink

by Malaney, Robert A.; Percival, Terence; Rogers, Glynn

In order to increase bandwidth utilization, next generation communication networks could offer a Quality of Service (QoS) to active connections in a statistical sense rather than deterministic sense. For this to be practical the presence of new regulation algorithms at the network edge would be required. These new algorithms would be designed to bound incoming traffic flows with predetermined statistical descriptors. Here, we propose a novel yet simple regulation algorithm which bounds an arrival process with the statistical traffic descriptor known as exponentially bounded burstiness (EBB). We show that by setting the parameters of the algorithm appropriately, the arrival process can be regulated so as to bound the flow with another statistical descriptor—the effective bandwidth. Both of these statistical descriptors have a well-developed network calculus related to bandwidth utilization for a requested statistical QoS metric. Our algorithm allows us to apply with confidence the EBB and effective bandwidth network calculus to traffic flows within the network core.

DOI: 10.1007/s10922-006-9040-y
Online Date: 10/17/2006
Print publication date: 12/1/2006
View article on SpringerLink

by Weeks, Michael; Altun, Gulsah

Routing is a must for networks that do not have a fixed point-to-point infrastructure, such as in an ad hoc wireless network that offers unrestricted mobility. A source node in such a network can communicate with a distant destination node after finding a route, relying on the intermediate nodes to transfer the packets. However, some intermediate nodes might act selfishly and drop packets for other nodes in order to save their own battery power.In this paper, we propose an algorithm to find selfish nodes and deal with them, using a modified Dynamic Source Routing (DSR) protocol, that we call Efficient Secure Dynamic Source Routing (ESDSR). Our results show an increase in the packet delivery ratio in a network containing selfish/unreliable nodes when we compare DSR with our protocol.

DOI: 10.1007/s10922-006-9043-8
Online Date: 10/6/2006
Print publication date: 12/1/2006
View article on SpringerLink

by Marty, Christopher; Ali, Mohamed A

This paper introduces a framework to support explicit rate congestion control for best-effort service in MPLS networks. We devise the two basic mechanisms required, namely, a signaling component to convey explicit-rate congestion control information and associated algorithm for calculating explicit fair rates. The proposed signaling component uses Resource Reservation Protocol (RSVP) in a novel way to convey explicit rate congestion control information. An algorithm to calculate Weight Proportional Max-Min (WPMM) fair rates appropriate for MPLS networks is introduced. Simulations are presented that show the effectiveness of the RSVP explicit rate signaling method when combined with the proposed max-min fair rate algorithm.

DOI: 10.1007/s10922-006-9041-x
Online Date: 10/6/2006
Print publication date: 12/1/2006
View article on SpringerLink