Microsoft Technology Licensing, LLC

Sharad Agarwal

Paramvir Bahl

Ryan Andrew Beckett

Rachee Singh

Jitendra Dattatraya Padhye

Abhishek Udupa

Ratul Mahajan

Alastair Wolman

Venkata N Padmanabhan

Gursharan Singh Sidhu

Shai Guday

Joseph H Matthews, Iii

Ming Zhang

Raman Kumar Sarin

Lin Zhong

Joseph Alton Schrader

Ted Tai-Yu Chen

Joseph Spencer King

Lenin Ravindranath Sivalingam

Ardalan Amiri Sani

Albert Gordon Greenberg

Daniel Ron Simon

David A Maltz

Shahin Shayandeh

Rajatish Mukherjee

Ian Obermiller

Ivan Jelev Tashev

Yu Zheng

Nikolaj Skallerud Bjorner

Stefan Saroiu

Jyh-Han Lin

David Chiyuan Chu

Lihua Yuan

Thekkthalackal Varugis Kurien

Matthai Philipose

Shawn M Thomas

Kevin T Damour

John Yovin

Karthick Jayaraman

Nuno Claudino Pereira Lopes

Haichen Shen

Randall Kern

Hang Kwong Lee

Weili Liu

Maik Riechert

Ionut Constandache

Neha Milind Raje

Christopher Scott Johnston

Steven Jeffrey Benaloh

Andrey Aleksandrovic Rybalchenko

Nuno Cerqueira Afonso

Aniruddha Parkhi

Alex Hehmeyer

Ranveer Chandra

Jie Jerry Liu

James Robert Hamilton

Nissanka Arachchige Bodhi Priyantha

John David Dunagan

Bongshin Lee

Prashanth Hosabettu Mohan

Alice Jane Bernheim Brush

Jacob Rubin Lorch

Srikanth Kandula

Aaron Naoyoshi Sheung Yan Woo

Ronnie Chaiken

Brian Don Zill

Michael J Manos

Andrew Paul Begun

Landon Prentice Cox

Behrooz Chitsaz

Alice Zheng

Manuel Silverio Da Silva Costa

Somesh Chaturmohta

John Charles Curlander

Parantap Lahiri

Michael Burt Goulding

David A Braun

John D Skovron

Andrew Haon

Alan Bennett Auerbach

Noor-E-Gagan Singh

Youngki Lee

William B Gail

Nilanjan Banerjee

Eduardo A Cuervo Laffaye

Irena Atov

Sirius Kuttiyan

Christopher Charles John Butcher

Zongxiang Yang

Todd Myles Derksen

Bernardo Iturriaga Dubost

Lara Deek

Christopher M Moore

John D Skovorn

Christopher Riederer

Colin Kimm Dixon

Najam Ahmad

Henry Frick

Janani C Sriram

Patrick D Verkaik

The present application relates to a system for ingress traffic management. The system includes a collection system within a network configured to collect traffic arrival information for peering links of the network. The system includes a training system configured to train a model based on the traffic arrival information to predict a probability of a traffic flow arriving on a peering link. The system includes a congestion mitigation system configured to predict based on the model, for traffic flows arriving on one or more peering links, other peering links to which the traffic flows would be shifted due to a condition affecting the one or more peering links. The congestion mitigation system may determine, in response to the condition, a set of prefixes to withdraw based on the other peering links to which traffic would be shifted.

Method and system to predict the ingress interface of internet traffic

A network verification system uses general-purpose programming language to create network verification tests. A test orchestrator builds a model of the network only using data from the network verification test. An optimization testing manager creates symbolic packets for verification tests using assertions based on a packet library embedded into the testing manager and the general-purpose programming language.

Network verification systems and methods

The present application relates to egressing traffic from a public cloud network. An egress traffic manager configures routing at hosts and edge routers within the public cloud network. The egress traffic manager determines, for an edge router, a plurality of current border gateway protocol (BGP) sessions with external networks. The egress traffic manager configures a virtual router hosted on the edge router to route a portion of egress traffic to a selected one of the external networks via one of the BGP sessions. A host is configured to route the portion of egress traffic within the public cloud network to the edge router. An edge router configured to route, by the virtual router, the portion of egress traffic from the edge router to the selected one of the external networks.

Egress traffic engineering in public clouds with commodity routers on the WAN edge

Described are examples for providing a system for managing configuration and policies for a virtualized wide area network (vWAN) support on a wide area network (WAN). The vWAN includes a plurality of virtual network entities associated with geographic locations including the physical computing resources of the WAN and virtual connections between the virtual network entities. The system includes a network safety component for managing configurations and policies of the vWAN on the WAN. The network safety component receives a change to a policy or configuration of the vWAN from an operator of a network connected to the vWAN. The network safety component evaluates a set of safety rules for the operator based on the change and a network state of a physical WAN underlying the vWAN. The network safety component generates an error message in response to at least one of the set of safety rules failing the evaluation.

Automatic verification of safety for virtualized networks

Systems and methods for routing packet data for transmission via a plurality of communication links are described. A method may include dividing a usage cycle for the plurality of communication links into a plurality of timeslots. Packet data traffic demands for the packet data for transmission via the plurality of communication links may be received. Based on a mixed integer linear programming model, an allocation of the packet data traffic demands to the plurality of communication links during the usage cycle may be determined using binary constraints of the mixed integer linear programming model. The binary constraints may prioritize respective subsets of the plurality of timeslots for at least some of the plurality of communication links. For each of the plurality of timeslots, an allocation of the packet data traffic demands to each of the plurality of communication links may be determined using the mixed integer linear programming model.

Traffic engineering for improved bandwidth allocations

Described are examples for providing management of a virtual wide area network (vWAN) based on operator policies. A network orchestrator presents, to a network operator, a representation of the vWAN including virtual network entities associated with respective geographic locations and virtual connections between the virtual network entities. The network orchestrator receives a policy for the virtual wide area network from the network operator via the representation, the policy to be implemented at one or more of the virtual connections. The network orchestrator translates the policy for the virtual wide area network into a configuration of an underlying wide area network (WAN). The underlying WAN a plurality of geographically distributed physical computing resources in geographic regions corresponding to the virtual network entities and connections there between.

Representation and orchestration for virtual wide area networks

The present application relates to communications between a partner network and a wide area network (WAN) via the Internet. Although Internet service providers may act as autonomous systems, the WAN may control routing from the partner network by advertising unicast border gateway protocol (BGP) address prefixes for a plurality of front-end devices in the WAN. An agent in the partner network measures a plurality of paths to a service within the WAN. Each of the plurality of paths is associated with one of the plurality of front-end devices and a respective unicast BGP address prefix. The WAN selects a path within the WAN for the service. The WAN exports a routing rule to the agent. The agent forwards data packets for the service to the respective BGP address prefix via the Internet. The WAN receives data packets for the service of the partner network at the selected device.

Guarantying SLA thru edge cloud path orchestration

The system disclosed herein implements an improved end-to-end network performance for data transmissions that span multiple networks operated by different organizations. The improvements are achieved as a result of exchanging routing information. For instance, the exchanged routing information can be representative of network performance factors. When different operators of different networks agree to exchange routing information, an optimal end-to-end path between two endpoint devices can be identified and selected for data transmission. This benefits both network operators as the users served by the networks are more likely to be satisfied with the user experience (e.g., faster download and upload of data).

Routing information exchange between separate networks to improve end-to-end network performance for users

The present application relates to communications between a partner network and a wide area network (WAN). The partner network and WAN may exchange representations of the respective networks including a delay profile for the partner network. The WAN receives a network delay profile for multiple virtual network entities within the partner network. The multiple virtual network entities include at least a plurality of peering locations with the WAN. The WAN determines a path from the partner network through the WAN via a selected peering location of the plurality of peering locations with the WAN to a destination based on at least the network delay profile. The WAN deploys a policy for an agent within the partner network. The policy identifies traffic for the destination to route through the WAN via the selected peering location. The WAN routes traffic from the selected peering location to the destination along the path.

Stitching multiple wide area networks together

Network capacity is provisioned in a computing environment comprising a computing service provider and an edge computing network. A cost function is applied to usage data for a number of user endpoints at the edge computing network, a number and type of workloads at the edge computing network, offload capability of the edge computing network, and resource capacities at the edge computing network. An estimated network capacity is determined, where the workloads are dynamic, and the cost function is usable to optimize the network capacity with respect to one or more criteria.

Provisioning edge backhauls for dynamic workloads

The present application relates to communications between a partner network and a wide area network (WAN) via the Internet. The WAN advertises unicast border gateway protocol (BGP) address prefixes for a plurality of front-end devices in the WAN. An agent in the partner network measures a plurality of paths to a service within the WAN. Each of the plurality of paths is associated with one of the plurality of front-end devices and a respective unicast BGP address prefix. The agent provides measurements of the plurality of paths to the WAN. The WAN selects a path within the WAN for the service. The agent receives a routing rule specifying a unicast address prefix for a selected device of the plurality of front-end devices of the WAN. The agent forwards data packets for the service to the respective border gateway protocol address prefix of the selected device via the Internet.

Network diagnostic to control path between partner network and WAN

The present application relates to traffic routing for overlay paths in a public cloud network. A path orchestrator receives a configuration of a set of overlay paths for a wide area network virtualization from a client, each overlay path including virtual routing nodes associated with respective geographic regions and at least one policy for a link between the virtual routing nodes. The path orchestrator is configured to instantiate a plurality of virtual routers on computing resources of the public cloud network located within the respective geographic regions based on the configuration, each virtual router configured to route traffic according to the policy for each link associated with the virtual routing node corresponding to the virtual router. The path orchestrator is configured to scale the plurality of virtual routers based on traffic for the client on the set of overlay paths.

Orchestration of overlay paths for wide area network virtualization

Methods and devices for encoding and decoding data streams are disclosed. In some aspects, the data streams are multimedia data streams. One method disclosed includes obtaining, by a client device, a first multimedia data stream and a second multimedia data stream, the second multimedia data stream being a lower fidelity version of the first multimedia data stream, generating, by the client device, a third multimedia data stream based on differences between the first and second multimedia data streams, compressing, by the client device, the second multimedia data stream to generate a first compressed multimedia data stream, compressing, by the client device, the third multimedia data stream to generate a second compressed multimedia data stream; and transmitting, by the client device, the first and second compressed multimedia data steams to the server.

Client side data stream processing

Growing community of inventors

Seattle, WA, United States of America

Sharad Agarwal