The upcoming gigabit-per-second high-speed networks are expected to support a wide range of communication-intensive real-time multimedia applications. The requirement for timely delivery of digitized audio-visual information raises new challenges for next-generation integrated services broadband networks. One of the key issues is QoS routing. It selects network routes with sufficient resources for the requested QoS parameters. The goal of routing solutions is twofold: (1) satisfying the QoS requirements for every admitted connection, and (2) achieving global efficiency in resource utilization. Many unicast/multicast QoS routing algorithms have been published, and they work with a variety of QoS requirements and resource constraints. Overall, they can be partitioned into three broad classes: (1) source routing, (2) distributed routing, and (3) hierarchical routing algorithms. We give an overview of the QoS routing problem as well as the existing solutions. We present the strengths and weaknesses of different routing strategies, and outline the challenges. We also discuss the basic algorithms in each class, classify and compare them, and point out possible future directions in the QoS routing area.

An overview of quality of service routing for next-generation high-speed networks: problems and solutions

In an ad hoc network, all communication is done over wireless media, typically by radio through the air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The quality-of-service (QoS) routing in an ad hoc network is difficult because the network topology may change constantly, and the available state information for routing is inherently imprecise. In this paper, we propose a distributed QoS routing scheme that selects a network path with sufficient resources to satisfy a certain delay (or bandwidth) requirement in a dynamic multihop mobile environment. The proposed algorithms work with imprecise state information. Multiple paths are searched in parallel to find the most qualified one. Fault-tolerance techniques are brought in for the maintenance of the routing paths when the nodes move, join, or leave the network. Our algorithms consider not only the QoS requirement, but also the cost optimality of the routing path to improve the overall network performance. Extensive simulations show that high call admission ratio and low-cost paths are achieved with modest routing overhead. The algorithms can tolerate a high degree of information imprecision.

/pdf/distributed-quality-of-service-routing-in-ad-hoc-networks-10o0orsb4o.pdf

Distributed quality-of-service routing in ad hoc networks

CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infrastructure called the core for performing route computations, (b) the propagation of the link-state of stable high-bandwidth links in the core through increase/decrease waves, and (c) a QoS route computation algorithm that is executed at the core nodes using only locally available state. But preliminary performance evaluation shows that CEDAR is a robust and adaptive QoS routing algorithm that reacts effectively to the dynamics of the network while still approximating link-state performance for stable networks.

/pdf/cedar-a-core-extraction-distributed-ad-hoc-routing-algorithm-ge6nccbtlg.pdf

CEDAR: a core-extraction distributed ad hoc routing algorithm

During the Internet stock bubble, articles in the trade press frequently said that, in the near future, telephone traffic would be just another application running over the Internet. Such statements gloss over many engineering details that preclude voice from being just another Internet application. This paper deals with the technical aspects of implementing voice over Internet protocol (VoIP), without speculating on the timetable for convergence. First, the paper discusses the factors involved in making a high-quality VoIP call and the engineering tradeoffs that must be made between delay and the efficient use of bandwidth. After a discussion of codec selection and the delay budget, there is a discussion of various techniques to achieve network quality of service. Since call setup is very important, the paper next gives an overview of several VoIP call signaling protocols, including H.323, SIP, MGCP, and Megaco/H.248. There is a section on telephony routing over IP (TRIP). Finally, the paper explains some VoIP issues with network address translation and firewalls.

/pdf/voice-over-internet-protocol-voip-35i0wqc1xn.pdf

Voice over Internet protocol (VoIP)

System, method, and tangible computer-readable storage media are disclosed for providing a brokering service for compute resources The method includes, at a brokering service, polling a group of separately administered compute environments to identify resource capabilities and information, each compute resource environment including the group of managed nodes for processing workload, receiving a request for compute resources at the brokering service system, the request for compute resources being associated with a service level agreement (SLA) and based on the resource capabilities across the group of compute resource environments, selecting compute resources in one or more of the group of compute resource environments The brokering service system receives workload associated with the request and communicates the workload to the selected resources for processing The brokering services system can aggregate resources for multiple cloud service providers and act as an advocate for or a guarantor of the SLA associated with the workload

System and method of brokering cloud computing resources

We formulate the problem of constructing broadcast trees for real-time traffic with delay constraints in networks with asymmetric link loads as a delay-constrained minimum spanning tree (DCMST) problem in directed networks. Then we prove that this problem is NP-complete, and we propose an efficient heuristic to solve the problem based on Prim’s algorithm for the unconstrained minimum spanning tree problem. This is the first heuristic designed specifically for solving the DCMST problem. Simulation results under realistic networking conditions show that our heuristic’s performance is close to optimal when the link loads are symmetric as well as when asymmetric link loads are used. Delay-constrained minimum Steiner tree heuristics can be used to solve the DCMST problem. Simulation results indicate that the fastest delay-constrained minimum Steiner tree heuristic, DMCT [1], is not as efficient as the heuristic we propose, while the most efficient delay-constrained minimum Steiner tree heuristic, BSMA [2], is much slower than our proposed heuristic and does not construct cheaper delay-constrained broadcast trees.

/pdf/an-efficient-delay-constrained-minimum-spanning-tree-4gme60lslv.pdf

An efficient delay-constrained minimum spanning tree heuristic

A method for providing virtual private networks for voice over data network users. A location server is provided that has more than one routing information database. A virtual private network is defined within that location server for each of the routing information databases. As registration information from gateways is received, they are associated with the appropriate virtual private network.

Virtual private networks for voice over networks applications

Usage of TRIP in Gateways for Exporting Phone Routes

MC routing protocols currently being standardized, PIM and CBT, propose the use of shared center-based trees, but they do not specify how to select the centers of these trees. We survey previous work on the center selection problems in the fields of operations research and communication networks.

/pdf/shared-multicast-trees-and-the-center-selection-problem-a-60egzuh1y1.pdf

Hussein F. Salama

Papers

An efficient delay-constrained minimum spanning tree heuristic

Virtual private networks for voice over networks applications

Usage of TRIP in Gateways for Exporting Phone Routes

Shared multicast trees and the center selection problem: A survey

The IP Telephony Border Gateway Protocol Architecture