Abstract: A computer system that implements a quality of service policy. Information defining the quality of service policy is stored in a central location, such as a server within an enterprise. Policy management software on clients in the network download quality of service policy information from the central location to the clients. Within a client, a portion of the policy information is selected based on its applicability to a particular connection. The selected information is cached with an association to the connection so that, as datagrams are generated for transmission over the network, relevant policy information is quickly accessed for use in controlling transmission characteristics of datagrams sent using that connection. The policy information is applied on a datagram-by-datagram basis, allowing policy information to be selectively applied based on network type. Policy information may be selectively applied to those datagrams transmitted over a managed network.

Abstract: A computer system that implements a quality of service policy. Information defining the quality of service policy is stored in a central location, such as a server within an enterprise. Policy management software on clients in the network download quality of service policy information from the central location to the clients. Within a client, a portion of the policy information is selected based on its applicability to a particular connection. The selected information is cached with an association to the connection so that, as datagrams are generated for transmission over the network, relevant policy information is quickly accessed for use in controlling transmission characteristics of datagrams sent using that connection. The policy information is applied on a datagram-by-datagram basis, allowing policy information to be selectively applied based on network type. Policy information may be selectively applied to those datagrams transmitted over a managed network.

Abstract: A computer system that implements a quality of service policy. Information defining the quality of service policy is stored in a central location, such as a server within an enterprise. Policy management software on clients in the network download quality of service policy information from the central location to the clients. Within a client, a portion of the policy information is selected based on its applicability to a particular connection. The selected information is cached with an association to the connection so that, as datagrams are generated for transmission over the network, relevant policy information is quickly accessed for use in controlling transmission characteristics of datagrams sent using that connection. The policy information is applied on a datagram-by-datagram basis, allowing policy information to be selectively applied based on network type. Policy information may be selectively applied to those datagrams transmitted over a managed network.

Abstract: Maps of a particular location are often generated with an inset area map, rendered in an inset region of the location map, of the general area including the location at a lower zoom level than the location map. However, this presentation may be disadvantageous in some scenarios (e.g., the where a user is interested in examining the extended area around the location, the area between two locations, or the spatial layout of the locations.) Instead, a composite map may be generated comprising an area map at an area map zoom level, and an inset location map rendered in an inset region of the location map and illustrating a location at a higher zoom level than the area map zoom level. Such composite maps may also be requested programmatically of a map generating service, and may be provided in an automated manner for use in an application.

Abstract: A computer system that implements a quality of service policy. Information defining the quality of service policy is stored in a central location, such as a server within an enterprise. Policy management software on clients in the network download quality of service policy information from the central location to the clients. Within a client, a portion of the policy information is selected based on its applicability to a particular connection. The selected information is cached with an association to the connection so that, as datagrams are generated for transmission over the network, relevant policy information is quickly accessed for use in controlling transmission characteristics of datagrams sent using that connection. Additionally, time information may be associated with information in the cache as well as policy information available from the server. Whenever a datagram is to be transmitted over a connection associated with out-of-date policy information in the cache, the cache information is updated.

Abstract: To trace an activity through multiple components or applications that may be involved in the performance of the activity, an activity identifier can be generated and utilized by the various components or applications. Each can generate its own activity identifier to minimize changes to existing interfaces. When logging of events has been activated, each application or component can provide, to an event store, an indication of the activity identifier it is using for a given activity. If a preceding or subsequent component utilizes a different activity identifier for aspects of the same activity, a link between the two activity identifiers can be communicated to the event store. Subsequently, examination of the event store can filter out irrelevant entries based on the activity identifiers. A graph linking the various related activity identifiers can be created and only those events associated with activity identifiers not in the graph can be filtered out.

Abstract: Disclosed are methods for handling RDMA connections carried over packet stream connections. In one aspect, I/O completion events are distributed among a number of processors in a multi-processor computing device, eliminating processing bottlenecks. For each processor that will accept I/O completion events, at least one completion queue is created. When an I/O completion event is received on one of the completion queues, the processor associated with that queue processes the event. In a second aspect, semantics of the interactions among a packet stream handler, an RDMA layer, and an RNIC are defined to control RDMA closures and thus to avoid implementation errors. In a third aspect, semantics are defined for transferring an existing packet stream connection into RDMA mode while avoiding possible race conditions. The resulting RNIC architecture is simpler than is traditional because the RNIC never needs to process both streaming messages and RDMA-mode traffic at the same time.

Abstract: To trace an activity through multiple components or applications that may be involved in the performance of the activity, an activity identifier can be generated and utilized by the various components or applications. Each can generate its own activity identifier to minimize changes to existing interfaces. When logging of events has been activated, each application or component can provide, to an event store, an indication of the activity identifier it is using for a given activity. If a preceding or subsequent component utilizes a different activity identifier for aspects of the same activity, a link between the two activity identifiers can be communicated to the event store. Subsequently, examination of the event store can filter out irrelevant entries based on the activity identifiers. A graph linking the various related activity identifiers can be created and only those events associated with activity identifiers not in the graph can be filtered out.

Abstract: Disclosed are methods for handling RDMA connections carried over packet stream connections. In one aspect, I/O completion events are distributed among a number of processors in a multi-processor computing device, eliminating processing bottlenecks. For each processor that will accept I/O completion events, at least one completion queue is created. When an I/O completion event is received on one of the completion queues, the processor associated with that queue processes the event. In a second aspect, semantics of the interactions among a packet stream handler, an RDMA layer, and an RNIC are defined to control RDMA closures and thus to avoid implementation errors. In a third aspect, semantics are defined for transferring an existing packet stream connection into RDMA mode while avoiding possible race conditions. The resulting RNIC architecture is simpler than is traditional because the RNIC never needs to process both streaming messages and RDMA-mode traffic at the same time.

Abstract: A computer system that implements a quality of service policy. Information defining the quality of service policy is stored in a central location, such as a server within an enterprise. Policy management software on clients in the network download quality of service policy information from the central location to the clients. Within a client, a portion of the policy information is selected based on its applicability to a particular connection. The selected information is cached with an association to the connection so that, as datagrams are generated for transmission over the network, relevant policy information is quickly accessed for use in controlling transmission characteristics of datagrams sent using that connection. The policy information is applied on a datagram-by-datagram basis, allowing policy information to be selectively applied based on network type. Policy information may be selectively applied to those datagrams transmitted over a managed network.

Abstract: A computer system that implements a quality of service policy. Information defining the quality of service policy is stored in a central location, such as a server within an enterprise. Policy management software on clients in the network download quality of service policy information from the central location to the clients. Within a client, a portion of the policy information is selected based on its applicability to a particular connection. The selected information is cached with an association to the connection so that, as datagrams are generated for transmission over the network, relevant policy information is quickly accessed for use in controlling transmission characteristics of datagrams sent using that connection. Additionally, time information may be associated with information in the cache as well as policy information available from the server. Whenever a datagram is to be transmitted over a connection associated with out-of-date policy information in the cache, the cache information is updated.

Abstract: A computer system that implements a quality of service policy. Information defining the quality of service policy is stored in a central location, such as a server within an enterprise. Policy management software on clients in the network download quality of service policy information from the central location to the clients. Within a client, a portion of the policy information is selected based on its applicability to a particular connection. The selected information is cached with an association to the connection so that, as datagrams are generated for transmission over the network, relevant policy information is quickly accessed for use in controlling transmission characteristics of datagrams sent using that connection. Additionally, time information may be associated with information in the cache as well as policy information available from the server. Whenever a datagram is to be transmitted over a connection associated with out-of-date policy information in the cache, the cache information is updated.

Abstract: Disclosed are methods for handling RDMA connections carried over packet stream connections. In one aspect, I/O completion events are distributed among a number of processors in a multi-processor computing device, eliminating processing bottlenecks. For each processor that will accept I/O completion events, at least one completion queue is created. When an I/O completion event is received on one of the completion queues, the processor associated with that queue processes the event. In a second aspect, semantics of the interactions among a packet stream handler, an RDMA layer, and an RNIC are defined to control RDMA closures and thus to avoid implementation errors. In a third aspect, semantics are defined for transferring an existing packet stream connection into RDMA mode while avoiding possible race conditions. The resulting RNIC architecture is simpler than is traditional because the RNIC never needs to process both streaming messages and RDMA-mode traffic at the same time.

Abstract: Disclosed are methods for handling RDMA connections carried over packet stream connections. In one aspect, I/O completion events are distributed among a number of processors in a multi-processor computing device, eliminating processing bottlenecks. For each processor that will accept I/O completion events, at least one completion queue is created. When an I/O completion event is received on one of the completion queues, the processor associated with that queue processes the event. In a second aspect, semantics of the interactions among a packet stream handler, an RDMA layer, and an RNIC are defined to control RDMA closures and thus to avoid implementation errors. In a third aspect, semantics are defined for transferring an existing packet stream connection into RDMA mode while avoiding possible race conditions. The resulting RNIC architecture is simpler than is traditional because the RNIC never needs to process both streaming messages and RDMA-mode traffic at the same time.

Abstract: Disclosed are methods for handling RDMA connections carried over packet stream connections. In one aspect, I/O completion events are distributed among a number of processors in a multi-processor computing device, eliminating processing bottlenecks. For each processor that will accept I/O completion events, at least one completion queue is created. When an I/O completion event is received on one of the completion queues, the processor associated with that queue processes the event. In a second aspect, semantics of the interactions among a packet stream handler, an RDMA layer, and an RNIC are defined to control RDMA closures and thus to avoid implementation errors. In a third aspect, semantics are defined for transferring an existing packet stream connection into RDMA mode while avoiding possible race conditions. The resulting RNIC architecture is simpler than is traditional because the RNIC never needs to process both streaming messages and RDMA-mode traffic at the same time.