Unlock instant, AI-driven research and patent intelligence for your innovation.

Method and system for global routing and bandwidth sharing

A routing and bandwidth technology, applied in the field of network communication, can solve problems such as impossibility, link failure robustness, unfairness, etc.

Inactive Publication Date: 2006-07-12
MICROSOFT CORP
View PDF0 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Multipath routing also yields robustness to link failures that cannot be achieved using single shortest path routing
Unfortunately, current per-flow or localized bandwidth allocation implementations of multipath routing are sometimes even less fair than more traditional single-path routing protocols

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and system for global routing and bandwidth sharing
  • Method and system for global routing and bandwidth sharing
  • Method and system for global routing and bandwidth sharing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] Turning to the drawings, the invention is shown as implemented in a suitable computing environment, wherein like numerals refer to like elements. The following description is based on various embodiments of the invention and should not be construed as limiting the invention with respect to alternative embodiments not explicitly described herein. Section I of this description presents an exemplary routing and bandwidth allocation architecture. Section II defines node demand fairness as a metric that can be used in the present invention, and Section III presents a multi-stream implementation of node demand fairness. Finally, Node IV presents simulation results for various embodiments of the invention.

[0034] In the following description, the invention is described with reference to acts and symbolic representations of operations that are performed by one or more computing devices, unless indicated otherwise. As such, it will be understood that these acts and operation...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A routing and bandwidth allocation system that maximizes network throughput while maintaining global fairness in the sharing of network resources. From gathered global network information, routing tables and bandwidth allocation policies are computed for routers (110-118). In some embodiments, the computations involve applying multi-commodity flow methods to provide a ''max-fair'' allocation of network resources. While in some embodiments each router (110-118) collects global network information and then locally produces its own routing and bandwidth allocation tables, it can be simpler and cheaper in terms of both computation and security for a centralized, trusted control unit to perform the calculations and then to distribute the results to the routers (110-118). The computed routing tables can include multiple paths (122-124) leading to greater link utilization and to robustness to link failure.

Description

technical field [0001] The present invention relates generally to network communications, and more particularly to providing routing and bandwidth allocation information. Background technique [0002] After receiving an incoming packet, a router decides which of its outgoing links to send the packet on. Routers in the Internet typically make this decision based on the shortest distance from the router to the packet's destination. Routers independently and locally compute this shortest path to the packet's destination. Although a router may take into account various metrics such as the latency of its outgoing links, the capacity of those links, and the current load on the links, a router chooses an outgoing link independently of the actual communication patterns between end hosts in the Internet. path. [0003] This independent and localized decision-making process in routing protocols is crucial to the Internet's scale scalability: new routers and new links can be easily ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/16H04L12/56
CPCH04L63/029H04L45/44H04L45/125H04L45/24H04L45/02H04L45/42H04L12/28H04L12/16H04L65/00
Inventor J·D·督纳甘J·王
Owner MICROSOFT CORP