摘要:
A first level of control over operation of slave Digitally Controlled Frequency Selectors (DCFSs), such as DCOs or DDSs, may occur by periodic transmission of control words from the master clock to the slave clocks. To allow enhanced control over the output of the slave clocks, the frequency of the local oscillator used to generate the synthesized output of the master clock may also be conveyed to the slave clocks to allow a second level of control to take place. The second level of control allows the local oscillators at the slave clocks to lock onto the frequency of the master local oscillator to thereby allow the slave local oscillators to operate the slave DCFSs using the same local oscillator frequency. The first level of control synchronizes operation of the DCFSs while the second level control prevents instabilities in the local oscillators from causing long term drift between the slave and master clock outputs. Timestamps may be used to synchronize the master and slave local oscillators.
摘要:
A novel beacon-based position location technique for efficient location discovery of untethered clients in packet networks is disclosed. The position location technique utilizes the time-difference-of-arrival (“TDOA”) of a first signal transmitted by a beacon of known location and a second signal transmitted by an untethered client. The TDOA of these two signals is measured locally by at least three non-collinear signal receivers. For each of the receivers, the TDOA is used to calculate a perceived distance to the client. A circle is then calculated for each receiver, centered on the receiver and having a radius equal to the perceived distance. At least two lines defined by points of intersection of the calculated circles are then calculated. The point of intersection of the lines represents the location of the client. To facilitate operation, the signal receivers may be arranged on vertices which define a convex polygon as viewed from above. The location system requires no time (time-of-day) synchronization of the signal receivers, and only the coarse frequency synchronization, on the order of, tens of parts-per-million (ppm). The technique even works for the case where the signal receivers are run asynchronously, provided the frequency accuracies of the signal receivers are on the order of about 50ppm or better. The technique introduces no communication overhead for the beacon, client and signal receivers. Further, the computation overhead at the signal receivers is relatively low because the location detection algorithm involves only simple algebraic operations over scalar values.
摘要:
Algorithms and data structure are described for constructing and maintaining a clock distribution tree (“CDT”) for timing loop avoidance. The CDT algorithms and data structure allows a node to make an automated and unattended path switch to the most desirable clock source in the network. In response to a network topology change, a clock root node distributes new clock paths to all nodes in the network. In particular, the root node calculates a new clock path for each affected node by building a clock source topology tree, and identifying from that tree a path to the network node from a clock source of higher or equal stratum relative to that network node. The root node then sends a network message to each node indicating the new path that the node should use. Each node receives the message and compares the new path with the existing path. If the paths are different then the node acquires the new path just received in the message. If the paths are the same then the node does nothing and discards the message.
摘要:
A technique for adaptively distributing a web server request in a system having a plurality of web servers is disclosed. In one embodiment, the technique is realized by first generating a web server request distribution function for each of the plurality of web servers based upon performance measures of each of the plurality of web servers, wherein each of the plurality of web servers is assigned a respective probability range based upon each respective web server request distribution function. A random probability number is then generated for a web server request. The particular probability range encompassing the random probability number is then determined so as to identify the corresponding web server to which the web server request is to be distributed.
摘要:
A system and method for synchronizing a local clock to a reference clock using a linear model of the clock error between the local clock and the reference clock is disclosed. In one embodiment, a double-exponential smoothing process is used in conjunction with the linear model to estimate a frequency offset by which the frequency of an oscillator of the local clock is adjusted. Also disclosed herein is a phased-lock loop (PLL) adapted to synchronize a local clock with a reference clock using the double-exponential smoothing process, as well as a system implementing the PLL for timing the playout of data received from a transmitter.
摘要:
A technique for adaptively controlling a gain of an optical amplifier is disclosed. In one particular exemplary embodiment, the technique may be realized by a method comprising the steps of measuring an output power signal of the optical amplifier; computing a command signal from an input power signal; computing a model state signal of a reference model; computing a model output signal of the reference model based at least in part on the model state signal; computing an error signal between the model output signal and the output power signal of the optical amplifier; adjusting at least one adaptive control gain value to minimize the error signal; and computing a control input signal for driving the optical amplifier based at least in part on the at least one adaptive control gain value, the error signal, the model state signal and the command signal.
摘要:
A method and apparatus for controlling a rate at which packets are transmitted to a network node having a queue and a network element employing same is described. The method and apparatus cooperate to generate a probability value in response to queue occupancy and desired queue occupancy and to control the packet in response to the probability value and a reference value to cause a source of the packet to change its transmission rate. Control of the packet is achieved by dropping the packet or by modifying the packet to include a message informing the source that it should adjust its transmission rate. In one embodiment, the probability value is converted into an inter-drop/mark value representing the number of packets to be admitted into the queue between dropped or marked packets.
摘要:
A technique for wave-mixing bulk frequency conversion in a network comprising one or more channels is disclosed that enables cost-effective wavelength-conversion. In one particular exemplary embodiment, the technique may be realized by a new class of multi-log wave-mixing-cross-connects that are based on arbitrary b×b space-switching elements, where b>2. In such cross-connects, for any light-path, the worst case number of cascaded frequency-conversions is O(logb(FW)), F being the number of fibers. One benefit of the new design may be maximized when W=O(F), b=O(F), and the worst-case number of cascaded conversions is O(1).
摘要:
A technique for wave-mixing frequency translation is disclosed. In one particular exemplary embodiment, the technique may be realized as a general construction for multi-log wave-mixing unicast or multicast cross-connects, with b×b space-switching elements, where b≧2. The resulting cross-connects support all-optical frequency-conversion, and they exploit multi-stage wave-mixing bulk frequency-translation In these cross-connects, for any light-path the worst case number of cascaded frequency-conversions is O(logb W), where W is the number of wavelengths per fiber. The wavelength-converter requirements are of between O(F) and O(F logb W), per stage and per plane, where F is the number of fibers.
摘要:
A method of allocating bandwidth for transmitting upstream cells from a CPE unit to a BTS. The CPE determines arrival time information associated with each cell and sends arrival time information associated with at least one cell to the BTS. The BTS allocates future bandwidth to the CPE as a function of the arrival time information received from the CPE. For example, the BTS estimates the number of cell arrivals occurring in the current scheduling period based on past cell arrival times. The BTS then sends information to the CPE in which the allocated future bandwidth is specified. Finally, the CPE groups a number of cells into a burst packet occupying the allocated bandwidth and sends the burst packet to the BTS. Rather than respond in a delayed manner to a bandwidth deficiency or surplus at an individual CPE unit, the BTS produces an estimate of a CPE unit's bandwidth demands, resulting in more efficient bandwidth utilization and reduced cell loss ratio.