Abstract: In an asynchronous transfer mode switch, a plurality of queues is provided for accumulating transfer cells, and a queue assignment processing section, receives a message for establishing a connection and assigns to the connection one of the queues having a forwarding rate close to a declared rate included in the message and not exceeding the declared rate.
Abstract: A system permits queues to use more than an allocated amount of bandwidth. The system allocates an amount of bandwidth to each of the queues and determines whether any of the queues is using less than the allocated amount of bandwidth. If so, the system reallocates the allocated bandwidth from one of the queues to at least one other one of the queues based on the amount of bandwidth used by each of the queues.
Abstract: A layer 2 transport network, and components thereof, supporting virtual network functionality among customer edge devices. Virtual private network configuration can be accomplished with merely local intervention by preprovisioning extra channel (or circuit) identifiers at each customer edge device and by advertising label base and range information corresponding to a list of channel (or circuit) identifiers.
Abstract: A device may include a service activation engine (SAE) including: a policy information base (PIB) file that defines a plurality of attachments that correspond to a plurality of network policies; and a server. The server may receive a request, using common open policy service for policy provisioning (COPS-PR), for a network service related to an interface handle associated with a subscriber device; determine which ones of the network policies correspond to the network service; and send, using COPS-PR, a provisioning instance (PRI) including a first of the attachments to implement the ones of the network policies to the interface handle based on the attachments.
Type:
Grant
Filed:
April 23, 2010
Date of Patent:
August 30, 2011
Assignee:
Juniper Networks, Inc.
Inventors:
Wladimir Araujo, Mohammad H. Sajedi, Altaf H. Ali
Abstract: A device may obtain a flow signature, identify a destination collector to which packets bearing the flow signature are sent, obtain a list of potential source collectors that may have sent the packets bearing the flow signature to the destination collector, and identify a source collector, among the potential source collectors, that sent the packets to the destination collector. In addition, the device may output information related to a path from the source collector the destination collector.
Abstract: A first-in-first-out (FIFO) queue optimized to reduce latency in dequeuing data items from the FIFO. In one implementation, a FIFO queue additionally includes buffers connected to the output of the FIFO queue and bypass logic. The buffers act as the final stages of the FIFO queue. The bypass logic causes input data items to bypass the FIFO and to go straight to the buffers when the buffers are able to receive data items and the FIFO queue is empty. In a second implementation, arbitration logic is coupled to the queue. The arbitration logic controls a multiplexer to output a predetermined number of data items from a number of final stages of the queue. In this second implementation, the arbitration logic gives higher priority to data items in later stages of the queue.
Abstract: A device may include two or more line interfaces. One of the line interfaces may include a component to buffer a packet that is received at the line interface, perform a lookup of information related to selecting a flow based on a header of the packet, apply a symmetric hash function to addresses in the header to obtain a hash when the information related to selecting the flow indicates the flow is to be selected based on a random method, compare the hash to a particular number using the information related to selecting the flow, the particular number being same for the line interfaces, sample a flow when the hash matches the particular number, create a flow record for the flow, and sample packets based on the flow record.
Type:
Application
Filed:
April 30, 2011
Publication date:
August 25, 2011
Applicant:
JUNIPER NETWORKS, INC.
Inventors:
Jack Kohn, Gunes Aybay, Fuguang Shi, David Rowell
Abstract: A profiler may analyze processes being run by a processor. The profiler may include logic to periodically sample a value of an instruction pointer that indicates an instruction in the first process that is currently being executed by the processor and logic to update profile data based on the sampled value. The profiler may additionally include logic to determine, in response to a context switch that includes the operating system switching the active process from the first process to another of the plurality of processes, whether the first process executes for greater than a first length of time; logic to stop operation of the profiler when the first process executes for greater than the first length of time; and logic to clear the profile data when the first process fails to execute for greater than the first length of time.
Abstract: A system for determining the burst start timing of a signal includes logic configured to receive the signal, generate correlation moduli and generate a first timing output based on the correlation moduli. The logic may also be configured to receive operating mode information and timing information and generate search controls. The logic may further be configured to identify a maximum of the correlation moduli using the search controls and determine a second timing output associated with the maximum correlation modulus. The second timing output represents a more accurate approximation of a burst start time than the first timing output.
Abstract: In a PPP terminating equipment 100 connected with a switch fabric and terminating PPP link, the PPP terminating equipment 100 has an LCP echo requirement detecting section 20 detecting whether or not a received packet is the LCP echo requirement packet, and an LCP echo response producing section 40 producing a response packet to the LCP echo requirement by rewriting the LCP header of the received LCP echo requirement packet. The PPP terminating equipment 100 thereby produces and returns the response packet to the LCP echo requirement.
Abstract: Improved approaches for providing secure access to resources maintained on private networks are disclosed. The secure access can be provided through a public network using client software of client-server software and/or with file system software. Multiple remote users are able to gain restricted and controlled access to at least portions of a private network through a common access point, such as an intermediate server of the remote network.
Type:
Application
Filed:
April 29, 2011
Publication date:
August 25, 2011
Applicant:
JUNIPER NETWORKS, INC.
Inventors:
Christopher THOMAS, Theron Tock, Sriram Ramachandran
Abstract: Configuration information for a network device may be associated with a protection state that may restrict the modification of portions of the configuration information that are set to the protected state. The network device may be configured using configuration information defined as a group of hierarchically arranged configuration statements. Permissions may be stored for the network device relating to users permitted to modify the configuration information. The permissions may include permission tags, or other information defining the protection state, associated with the configuration statements. Intended modifications to the configuration information may be processed based on whether the intended modifications affect configuration statements associated with one of the permission tags.
Abstract: A cable modem termination system measures signal qualities of upstream transmissions associated with one or more cable modems. The system monitors the measured upstream signal qualities, and selectively commands at least one of the one or more cable modems to switch between upstream channels based on the signal quality monitoring.
Abstract: A transmission source bridge collects packets sent from nodes connected to a serial bus in accordance the IEEE1394 Standards, into one packet in an order they are to be transmitted and then sends them onto an ATM network, so that a transmission destination bridge receives this packet and divides it into a plurality of smaller packets and transfers them, in the order they were sent, to nodes connected to the serial bus in accordance with the IEEE1394 Standards.
Abstract: A network optimization device may receive a stream of data and generate a signature for a plurality of fixed length overlapping windows of the stream of data. The device may select a predetermined number of the generated signatures for each Ln-byte segment of the data stream, wherein Ln is greater than a length of each of the windows. The network device may store the selected signatures in a bucketed hash table that includes a linked-list of entries for each bucket.
Abstract: A user device receives a request to perform an automatic clock insertion operation for an integrated circuit; retrieves location information regarding a group of components, of the integrated circuit, that use a clock signal; deploys a clock mesh based on the location information regarding the group of components; and inserts drop points into the clock mesh; deploys a particular buffer for a particular drop point; maps a component, of the group of components, to the particular buffer; generates a clock box for the particular buffer, where dimensions of the clock box are based on a location of the component; deploys an H-tree for the clock box, where dimensions of the H-tree are proportional to the clock box dimensions; connects the H-tree to the component; and displays or stores clock mesh information, information regarding the group of buffers, information regarding the H-tree, and the location information regarding the group of components.
Abstract: A computing device may include a memory to store instructions and a processor. The processor may execute the instructions to conduct an initial cell optimization for an integrated circuit layout; designate clock loads associated with a first-level clock buffer; receive, after the initial standard-cell optimization, a set of initial placement locations; align the clock loads according to the set of placement locations; conduct, using the aligned clock loads, a re-optimization of the integrated circuit layout; and store, in the memory, a circuit layout based on the re-optimization.
Abstract: In general, techniques are described to increase customer awareness within a network device of a cable network. Based on this increased awareness, a layer 3 network device, such as a router, may apply services that augment services applied by a Cable Modem Termination System (CMTS). The network device may be positioned between the CMTS and a backend network of the cable network. The network device may include a control unit to access the CMTS to determine network information and at least one network interface that receives network traffic. The control unit may apply at least one of a plurality of services provided by the network device to the network traffic based on the network information learned from the CMTS. Often, at least one of the differentiated services may comprise a service not provided by the CMTS and, consequently, a service that may augment those services currently provided by the CMTS.
Abstract: A data flow rate policer enforces data flow policies for a number of data flows using a probabilistic policy enforcement mechanism. The policer includes a memory that stores the state of each data flow in a compact data structure. Additionally, the policer includes one or more policing engines that implement the actual data flow policies based on information derived from the data structures. The policing engines may be implemented in hardware to increase performance.
Type:
Grant
Filed:
March 26, 2010
Date of Patent:
August 23, 2011
Assignee:
Juniper Networks, Inc.
Inventors:
Dennis C Ferguson, Devereaux C Chen, John W Stewart, III, James Washburn, Jeffrey R Zimmer
Abstract: Techniques are described for distributing network traffic across parallel data paths. For example, a router may perform a hash on routing information of the packet to generate a hash value corresponding to the packet flow associated with the packet. The router may map the hash value of the packet to a forwarding element associated with a data path. The router may dynamically update the mapping of hash values to forwarding elements in accordance with traffic flow statistics. In this manner, the router may distribute the packet flows from data paths with high volumes of traffic to data paths with smaller volumes of traffic. The router may further prevent out of sequence delivery of packets by updating the mapping upon a gap in the packet flow exceeding a threshold gap. For example, the router may update the mapping when a packet for a packet flow associated with the particular hash value has not been received for at least a defined time interval.