Patent application number | Description | Published |
20080259867 | METHOD AND SYSTEM FOR SCHEDULING PACKETS FROM DIFFERENT FLOWS TO PROVIDE FAIR BANDWIDTH SHARING - A method and system for scheduling packets to provide fair bandwidth sharing is provided. A packet scheduling system is composed of a communication link and flows from different network applications. These flows share the same communication link and have different bandwidth reservation according to different application requirements. In this invention, the bandwidth of the communication link is expressed into its binary form, and the binary coefficients are used to form a Square Weight Matrix. Moreover, each non-zero binary coefficient is expressed by a Weighted Binary Tree. The Square Weight Matrix is further spread by a Weight Spread Sequence and each Weighted Binary Tree is spread into a Time-Slot Array by using a Binary Reversal operation. When a flow is accepted by the scheduling system, the system first expresses the requested bandwidth of the flow into binary form, and then for each non-zero coefficients, the system allocates a node with the same weight from the Weighted Binary Trees to the flow. Accordingly, when a flow leaves the system, the Weighted Binary Trees nodes that have been allocated to the flow are de-allocated, and the corresponding terms of the TArrays are reset. The scheduling system schedules packets by sequentially scanning the Weight Spread Sequence. For a specific value of the scanned Weight Spread Sequence term, a corresponding TArray is then selected, and the flow that occupies the current term of the TArray is then chosen and served. | 10-23-2008 |
20090100005 | MAPPING NETWORK ADDRESSES TO GEOGRAPHICAL LOCATIONS - 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. | 04-16-2009 |
20090274043 | MULTI-LEVEL INTERCONNECTION NETWORK - A method and system for providing a multi-level interconnection network is provided. A multi-level interconnection network comprises basic cells that are aggregated into higher level cells at each level of the network. At the first level, the basic cells are aggregated into first level cells. Each first level cell is an aggregation of a number of basic cells that is one more than the number of devices in a basic cell. The basic cells of a first level cell are fully connected; that is, each basic cell has a first level link or connection to each other basic cell. In a first level cell, each device of a basic cell has a first level link to each other basic cell. The multi-level interconnection network has higher level cells that are aggregations of lower level cells in a similar manner. | 11-05-2009 |
20090274063 | MULTI-LEVEL INTERCONNECTION NETWORK - A method and system for providing a multi-level interconnection network is provided. A multi-level interconnection network comprises basic cells that are aggregated into higher level cells at each level of the network. At the first level, the basic cells are aggregated into first level cells. Each first level cell is an aggregation of a number of basic cells that is one more than the number of devices in a basic cell. The basic cells of a first level cell are fully connected; that is, each basic cell has a first level link or connection to each other basic cell. In a first level cell, each device of a basic cell has a first level link to each other basic cell. The multi-level interconnection network has higher level cells that are aggregations of lower level cells in a similar manner. | 11-05-2009 |
20100153523 | SCALABLE INTERCONNECTION OF DATA CENTER SERVERS USING TWO PORTS - Large numbers of commodity servers in a data center may be inexpensively interconnected using low-cost commodity network switches, a first network port on each commodity server, a second network port on each commodity server, and a traffic-aware routing module executed on each commodity server. Connecting two or more commodity servers via the first network ports on each server to a commodity network switch forms a unit. Connecting two commodity servers in different units forms a group. Each unit has a direct connection via a second network port on a commodity server in the unit to another unit. Each group may have a direct connection via a second network port on a commodity server in the group to another group. Traffic-aware routing modules executed on each commodity server determine routing of data between servers and balance traffic across the first and second ports. | 06-17-2010 |
20100153540 | GEOLOCATION MAPPING OF NETWORK DEVICES - A geographic location of a network device is determined using response delay times from internet servers used as landmarks. A coordination server provides to a client a list of area landmark servers (ALS) with known geographic locations. The client probes ALSs, measures response delays, and provides results to the coordination server. The coordination server then provides to the client a list of additional city landmark servers (CLS) within the area. The client probes the CLSs and provides results to the coordination server which then determines the geographic location of the client. | 06-17-2010 |
20100180048 | Server-Centric High Performance Network Architecture for Modular Data Centers - Disclosed are systems and methods for network architecture that is a server-centric network architectural design. | 07-15-2010 |
20110103262 | MULTI-LEVEL INTERCONNECTION NETWORK - A method and system for providing a multi-level interconnection network is provided. A multi-level interconnection network comprises basic cells that are aggregated into higher level cells at each level of the network. At the first level, the basic cells are aggregated into first level cells. Each first level cell is an aggregation of a number of basic cells that is one more than the number of devices in a basic cell. The basic cells of a first level cell are fully connected; that is, each basic cell has a first level link or connection to each other basic cell. In a first level cell, each device of a basic cell has a first level link to each other basic cell. The multi-level interconnection network has higher level cells that are aggregations of lower level cells in a similar manner. | 05-05-2011 |
20110202682 | NETWORK STRUCTURE FOR DATA CENTER UNIT INTERCONNECTION - A number of data center units in a data center system may be directly connected with each other via switch interfaces. The data center system is server-centric and scalable by storing routing logics (e.g., inter-data center unit logic and/or inner-data center unit logic) at each server to achieve routing, load balancing, and/or fault tolerance. Switch interfaces of the data center units, thus, may be dumb devices and a centralized router for routing data among data center units may be omitted. | 08-18-2011 |
20110296052 | Virtual Data Center Allocation with Bandwidth Guarantees - 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. | 12-01-2011 |
20120026917 | SERVER-CENTRIC HIGH PERFORMANCE NETWORK ARCHITECTURE FOR MODULAR DATA CENTERS - Disclosed are systems and methods for network architecture that is a server-centric network architectural design. | 02-02-2012 |
20120140621 | Incast Congestion Control in 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. | 06-07-2012 |
20120151026 | GENERIC AND AUTOMATIC ADDRESS CONFIGURATION FOR DATA CENTER NETWORKS - 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. | 06-14-2012 |
20120287782 | PROGRAMMABLE AND HIGH PERFORMANCE SWITCH FOR DATA CENTER NETWORKS - 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. | 11-15-2012 |
20130145043 | MAPPING NETWORK ADDRESSES TO GEOGRAPHICAL LOCATIONS - 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. | 06-06-2013 |
20140119204 | ONE-TO-MANY AND MANY-TO-ONE COMMUNICATIONS ON A NETWORK - 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. | 05-01-2014 |
20140153387 | Tuning Congestion Notification for Data Center Networks - 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. | 06-05-2014 |
20140281026 | Virtual Data Center Allocation with Bandwidth Guarantees - 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. | 09-18-2014 |
20140344438 | GENERIC AND AUTOMATIC ADDRESS CONFIGURATION FOR DATA CENTER NETWORKS - 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. | 11-20-2014 |