Cisco Technology, Inc.

Frederick Juergens Baker

James Anthony Aviani, Jr

Kenneth Earl Mueller, Ii

Matthew Richard Gnagy

David Eric Swanson

David R Oran

Rong Pan

Preethi Natarajan

James Lewis Fenton

Bruce Arthur Lueckenhoff

Chiara Piglione

Mythili Suryanarayana Prabhu

Gonzalo A Salgueiro

Brian Eliot Weis

Kenneth Durazzo

Paul M Quinn

Michael R Thomas

Sebastian Jeuk

Alon Shlomo Bernstein

Qingming Ma

Chandrashekhar Appanna

Francois Le Faucheur

Ali C Begen

Andrew George Harvey

Joshua B Gahm

Carol Etta Iturralde

Biswaranjan Panda

Robert E Gleichauf

Jeremy Stieglitz

Bruce Stuart Davie

Richard Mandfred Pruss

Saravanakumar Rajendran

Eric G Vyncke

Satish K Gannu

Andrew J Valencia

Kenneth A Moberg

Ian Foo

Vijaynarayanan Subramanian

Claude Alan Cartee

Dean Cheng

Michael V DiBiasio

Michael Allen Thomas

Barry Raveendran Greene

Roger Levesque

Ulana Maria Sonia Legedza

Saamer Akhshabi

Bill Carroll VerSteeg

Luc Billot

Pascal Delprat

A cloud provider supports cloud-based services accessible to tenants of the cloud provider over a network. In the cloud provider, classification information including a cloud-identifier to identify the cloud provider, service-identifiers each to identify a respective one of the services, and tenant-identifiers each to identify a respective one of the tenants is maintained. The classification information is distributed within the cloud provider, including to the services, and may also be distributed outside of the cloud provider, to enable a respective tenant to exchange IP packets with, and thereby access, a respective service based on the classification information, wherein each IP packet includes the cloud-identifier, the service-identifier of the respective service, and the tenant-identifier of the respective tenant.

Cloud provider, service, and tenant classification in cloud computing

In one embodiment, a method includes monitoring power usage parameters in a data center at a controller and automatically modifying components within the data center to reduce power usage based on the power usage parameters. The power usage parameters include routing distances between the components within the data center. An apparatus and logic are also disclosed herein.

Automated power control for reducing power usage in communications networks

An example method for adapting Proportional Integral controller Enhanced (PIE) algorithm for varying network conditions is provided and includes estimating an average dequeue rate at which packets are dequeued from a queue of packets maintained in a buffer in a network element operating, estimating a current queuing latency for the queue of packets based on the average dequeue rate, determining a target delay based on the average dequeue rate, the target delay varying with the average dequeue rate according to a predetermined relationship, and calculating a current drop probability associated with a probability that packets arriving at the buffer will be dropped or marked, the current drop probability being calculated using at least the current queuing latency and the target delay. In some embodiments, a threshold for a number of bytes dequeued from the buffer is estimated based on network conditions.

Adapting proportional integral controller enhanced algorithm for varying network conditions in a network environment

In one embodiment, a method includes identifying a current encoding rate requested by a client device for content received from a content source, setting at a network device a rate limit to limit the rate at which the content is received at the client device based on the current encoding rate, and adjusting the rate limit based on changes in the current encoding rate. The rate limit is set to allow the client device to change the current encoding rate to a next higher available encoding rate.

Stabilization of adaptive streaming video clients through rate limiting

In one embodiment, an apparatus can include a service broker configured to: (i) register a service classifier, and to provide context information to the service classifier; and (ii) register a plurality of service nodes. The service broker can also receive capability and service requests from the service classifier. Further, the context information can include a service header, a reachability indication, and an encapsulation, where the service header and the encapsulation may be attached or related to a packet in the service classifier. In addition, the service classifier can use this information to redirect the packet to a first service node.

Service insertion architecture

In one embodiment, a method includes estimating a current queuing latency, the estimated current queuing latency being associated with a queue of packets maintained in a buffer. The method also includes calculating a current drop or mark probability, the current drop or mark probability being associated with a probability that packets associated with the queue of packets will be dropped or marked. A rate at which the packets associated with the queue of packets are dequeued from the buffer is estimated in order to estimate the current queuing latency. The current drop or mark probability is calculated using the current estimated queuing latency.

Utilizing latency control to alleviate bufferbloat

In one embodiment, an apparatus associated with securing a Resource Reservation Protocol (RSVP) with dynamic group keying is provided. The apparatus may include a group key logic that interacts with a dynamic group key management logic. The dynamic group key management logic provides a group key to members of a set of RSVP-capable devices. The apparatus also includes an RSVP authentication logic to determine whether a received RSVP message was provided by a member of the set of RSVP-capable devices. The determination is made using implicit authorization that depends on the group key and that does not depend on a challenge/response protocol. In one embodiment the apparatus is a router.

Secure resource reservation protocol (RSVP) with dynamic group keying

A method and system for verifying identification of an electronic mail message. An electronic mail message including a signature and a key is received, the signature identifying a domain from which the electronic mail message originated and the key for verifying the signature. A key registration server of the domain is accessed to verify the key. The key registration server provides for verifying that a key used to sign an electronic mail message is valid and that the sender is authorized by the domain to send the electronic mail message from the return address.

Method and system for verifying identification of an electronic mail message

A technique is provided for one or more network nodes to deterministically select data flows to preempt. In particular, each node employs a set of predefined rules which instructs the node as to which existing data flow should be preempted in order to admit a new high-priority data flow. The rules are precisely defined and are common to all nodes configured in accordance with the present invention. Illustratively, a network node not only selects a data flow to preempt, but additionally may identify other 'fate sharing' data flows that may be preempted. As used herein, a group of data flows has a fate-sharing relationship if the application instance(s) containing the data flows functions adequately only when all the fate-shared flows are operational. In a first illustrative embodiment, after a data flow in a fate-sharing group is preempted, network nodes may safely tear down the group's remaining data flows. In a second illustrative embodiment, when a data flow is preempted, all its fate-shared data flows are marked as being 'at risk.' Because the at-risk flows are not immediately torn down, it is less likely that resources allocated for the at-risk flows may be freed then subsequently used to establish relatively lower-priority data flows instead of relatively higher-priority data flows.

Mechanism to improve preemption behavior of resource reservations

A mechanism for generating an address of a cyphertext component of a VPN router in a nested VPN system using an address of a plaintext domain so that a PTX domain has no knowledge about IP addressing in a CTX domain and vice versa. The mechanism advantageously avoids storing correlation between CTX addresses and PTX addresses, thereby maintaining a zero information requirement in a nested VPN routing.

Routing messages in a zero-information nested virtual private network

A method, a system, a machine-readable medium, and an apparatus for managing storage on a shared storage space, for example, on an email server, are provided. A plurality of emails is compared. If the content of each of the plurality of emails is the same, then a single copy is stored on the email server. Further, each recipient of the plurality of emails is enabled access to the stored email via a link to the single copy. Additionally, one or more attachments of the plurality of emails are compared. If an attachment is the same in each of the plurality of emails, then it is stored as a single copy. Further, a link is inserted in each of the plurality of emails, enabling access to the attachment from the single copy.

Method and system for managing storage on a shared storage space

The technique of the present invention provides a solution to the problem of routing or redirecting a given client to a replica or proxy server which has a relatively shortest propagation delay to the client. According to the technique of the present invention, a network device referred to as an intercept server sits in front of a host server, and intercepts packets routed to the host server. When desired, packets which are intercepted by the intercept server are replicated, encapsulated and tunneled to selected client servers in the overlay network. The tunneled packets are received and processed by each of the selected client servers, whereupon each of the selected client servers generates a respective spoofed response to the source device identified in the header of the originally intercepted packet. Further, according to the technique of the present invention, each of the selected client servers transmits its respective spoofed response to the identified source device at substantially the same time. The client server associated with the spoofed response which is first received at the identified source device is considered to have the relatively shortest propagation delay to the identified source device, and is identified as the successful client server. Thereafter, the source device will be directed or redirected to communicate directly with the successful client server when subsequently attempting to access information from the host server.

Distributed network traffic load balancing technique implemented without gateway router

Methods and apparatus providing information about characteristics associated with a network are described. A network node associated with a client for selecting a server that can best provide content to a client transmits a request for a response. A plurality of content servers or content routing agents receive requests corresponding to the request from the network node associated with the client. The content servers provide a response and fragment and/or pad datagrams associated with the response. The content servers transmit these fragmented and/or padded datagrams to the network node associated with the client. The network node associated with the client can reassemble and/or trim the received datagrams and identify as optimal the server that first completes transmission of the response.

Methods and apparatus for content server selection

Growing community of inventors

Goleta, CA, United States of America

Frederick Juergens Baker