Efficient and robust routing independent of traffic pattern variability

摘要

A scheme for a carrier to route one or more packets of traffic to their destination after ensuring that they pass through a pre-determined intermediate node also in the carrier's domain permits the carrier to handle all permissible traffic patterns without knowledge of the traffic matrix, subject to edge-link capacity constraints. A method of routing data through a network of nodes interconnected by links and having at least one ingress point and at least one egress point, comprises the steps of: receiving a request for a path with a service demand for routing data between the ingress point and the egress point; selecting a set of one or more intermediate nodes between the ingress point and the egress point; determining, based on a bandwidth of said network, respective fractions of the data to send from the ingress point to each node of the set of one or more intermediate nodes; routing the data in the determined respective fractions from the ingress point to each node of the set of one or more intermediate nodes; and routing the data from each node of the set of one or more intermediate nodes to the egress point.