Microsoft Technology Licensing, LLC

Chuanxiong Guo

Yongguang Zhang

Haitao Wu

Guohan Lv

Songwu Lu

Dan Li

Jiahe Helen Wang

Qian Zhang

Wenwu Zhu

Kun Tan

Danfeng Zhang

Yunfeng Shi

Lihua Yuan

Yongqiang Xiong

Yunxin Liu

Qing Yu

Jun Feng Yuan

Guohan Lu

Shuang Yang

Jason Garms

Daniel Ron Simon

Lei Shi

David A Maltz

Kai Chen

Youjun Liu

Shi Lei

Hongbin Liao

Jiaxin Cao

Alf Peter Zugenmaier

Techniques are described for balancing traffic load for networks configured in multi-rooted tree topologies, in the presence of link failures. Maximum flows (through minimum cuts) are calculated for subgraphs that incorporate effective link capacities on links between source and destination nodes. Effective link capacities may be determined that take into account link failures, as well as sharing of current available link capacities by multiple nodes. Traffic is balanced while simultaneously fully utilizing available link capacities, even available link capacities on partially failed links (e.g., partially failed Link Aggregation Groups (LAGs)).

Fault tolerant and load balanced routing

In some cases, a network monitoring system may determine an operating or health condition of a node or connection link in a network (e.g., a datacenter network) by preparing an encapsulated data packet according to a tunneling protocol. Depending on a result of routing the encapsulated data packet, the network monitoring system determines whether the node or connection link is functioning normally or is experiencing an issue such as overloading or malfunctioning.

Fine-grained network monitoring

Disclosed are systems and methods for network architecture that is a server-centric network architectural design.

Server-centric high performance network architecture for modular data centers

This application describes routing packets from a source server to a plurality of ports of a switch. The switch is programmed by the control server and is used to direct incoming data packets to one or more ports of the switch in a manner that reduces congestion of incoming data packets to a destination server. Further, the control server queries congestion information from the switch, and then sends congestion notification back to the source server to either increase or decrease the amount of data being sent to the destination server.

Programmable and high performance switch for data center networks

A virtual data center allocation architecture with bandwidth guarantees that provides for the creation of multiple virtual data centers from a single physical infrastructure. The virtual data center allocation is accomplished in three steps. First, clusters are created from the servers in the physical infrastructure. Second, a bipartite graph is built to map the virtual machines to the servers located in a particular cluster and finally a path is calculated between two virtual machines. The virtual data centers may be dynamically expanded or contracted based on changing bandwidth guarantees.

Virtual data center allocation with bandwidth guarantees

A system, method or computer readable medium to provide efficient congestion notification is described herein. In various embodiments, a packet is received at an intermediate node of one or more data center networks. A current queue length at the intermediate node is determined. A threshold value for the current queue length is tuned by dynamically computing an upper bound and a lower bound based at least in part on the network. The packet is marked to indicate possible congestion in the one or more data center networks when the current queue length exceeds the threshold value. In some embodiments, the packet is marked when it is being de-queued. In a further embodiment, Flexible Initial Packet Size (FIPS) may be utilized to improve the efficiency of the tuning.

Tuning congestion notification for data center networks

Some implementations include routing and/or delivering communications within a network system. In one example, a packet source may be configured to recursively encode a data delivery tree so that any sub-tree formed from the data delivery tree compresses a continuous data block of the data delivery tree.

One-to-many and many-to-one communications on a network

Implementations are described for controlling, avoiding, and/or minimizing incast congestion in a network. In various embodiments, the network may be a data center network, which may include one or more senders and a receiver that transmit data across the network using Transmission Control Protocol. The receiver may be associated with a receive window that may determine amount of data that may be received by the receiver at a single time. Moreover, a size of the receive window may be adjusted based at least in part on an available bandwidth of the receiver. As a result of an increase or decrease in the receive window, the one or more senders may not be constrained in transmitting data to the receiver and incast congestion at the receiver may be reduced and/or avoided.

Incast congestion control in a network

This application describes a system and method for auto configuring data center networks. The networks include a plurality of electronic devices that may include switches, servers, routers, or any other device that may be used in a data center network. Graph theory is applied to the arrangement of the network devices to determine if the intended design of the data network matches the actual implementation of the network. This may be achieved by resolving the blueprint graph with the physical graph to determine if they are isomorphic. Also, the isomorphic techniques may be used to detect miswirings in the network that do not cause a node degree change for any of the network components.

Generic and automatic address configuration for data center networks

A network address mapping system is described. The network address mapping system can identify a set of Web pages, collects information from the Web pages indicating geographical locations ('geolocations'), and correlate the geolocations with the network addresses from which the identified Web pages are served. The collected information can be weighted based on various factors, such as its relative position in a Web page. The collected information can then be used to identify a geolocation. The network mapping system can deduce geolocations for portions of ranges of network addresses based on the score, and can infer geolocations for other portions based on the deduced geolocations. This mapping can then be stored in a database and provided as a geomapping service. The network address mapping system is able to map network addresses to geographical locations. Thereafter, when a user's client computing device accesses a Web server, the Web server can easily and accurately determine a geographical location by querying the database storing the mapping or a geomapping service.

Mapping network addresses to geographical locations

Growing community of inventors

Nanjing, China

Chuanxiong Guo