Method and apparatus for circuit emulation services over cell and packet networks
Summary by NHIP
Circuit emulation mapping
The method maps constant bit rate traffic streams to cell or packet structures using a single shared dejitter buffer. A flag sets the packet stream selection, and clock recovery optionally uses shared hardware for both received stream types.
Claim Score by NHIP
Abstract
Methods and apparatus are provided for circuit emulation services over cell and packet networks. A constant bit rate traffic stream is mapped to one of a cell and packet structure. The constant bit rate traffic stream is mapped to one or more cells and the one or more cells are selectively translated to one or more packets if a packet stream is selected. In addition, one of a received cell and packet stream are mapped to a constant bit rate traffic stream. The packet stream is selectively translated to one or more cells and the one or more cells are translated to the constant bit rate traffic stream. A clock can optionally be recovered from the received cell or packet stream.

Term
Projected expiry 14 August 2029.
- Priority and filed
- Granted
- Today
- Projected expiry
24 claims: 4 independent, 20 dependent
- 1A method for mapping a constant bit rate traffic stream to one of a cell and packet structure, comprising:translating said constant bit rate traffic stream to one or more cells;and selectively translating said one or more cells to one or more packets if a packet stream is selected, wherein said translating steps utilize a single shared dejitter buffer.
- 6Broadest claimClaim Score 78, broad(NHIP)A method for mapping one of a received cell and packet stream to a constant bit rate traffic stream, comprising:selectively translating a packet stream to one or more cells;and translating said one or more cells to said constant bit rate traffic stream, wherein said translating steps utilize a single shared dejitter buffer.
- 13An apparatus for mapping a constant bit rate traffic stream to one of a cell and packet structure, comprising:a memory;and at least one processor, coupled to the memory, operative to: translate said constant bit rate traffic stream to one or more cells;and selectively translate said one or more cells to one or more packets if a packet stream is selected, wherein said translating steps utilize a single shared dejitter buffer.
- 18An apparatus for mapping one of a received cell and packet stream to a constant bit rate traffic stream, comprising:a memory;and at least one processor, coupled to the memory, operative to: selectively translate a packet stream to one or more cells;and translate said one or more cells to said constant bit rate traffic stream, wherein said translating steps utilize a single shared dejitter buffer.
Independent claims4
29 paragraphs in 5 sections, as filed
FIELD OF THE INVENTION
The present invention relates generally to communication systems, and more particularly, to techniques for providing circuit emulated services over packet and cell networks.
BACKGROUND OF THE INVENTION
In an increasingly heterogeneous network environment, it is often necessary to map circuit emulated services (CES), such as T1/E1 private line services, to a cell or packet infrastructure, such as an Asynchronous Transfer Mode (ATM) or Internet Protocol (IP) network environment, respectively. A number of techniques have been proposed or suggested for mapping CES to cells or packets. Typically, independent hardware is employed to map CES to a cell structure (such as associated with an ATM network) and to map CES to a packet structure (such as associated with an IP network). While such independent circuits effectively map CES to cells and packets, this independent approach results in increased power dissipation, additional logic design and a larger surface area
Constant Bit Rate (CBR) services have been employed to emulate leased lines. Since ATM networks generally employ cells and IP networks generally employ packets, as opposed to a circuit-based transmission technology, circuit characteristics must be emulated in these networks in order to support CBR traffic. The need for circuit emulation within ATM and/or IP networks reflects an increasing demand for carrying CBR traffic over such networks. “Circuit Emulation Service Interoperability Specification, Version 2.0,” ATM Forum Specification, atm-vtoa-0078 (CES 2.0) (January, 1997), describes the use of an ATM Adaptation Layer 1 (AAL1) format for circuit emulation over ATM. Y Stein et al., “TDM Over IP,” Internet Engineering Task Force (IETF), draft-ietf-pwe3-tdmoip-03.txt (Feb. 27, 2005), describe a technique for transmitting N ATM AAL1 payloads per packet over an IP network to achieve circuit emulation over IP networks.
A need exists for methods and apparatus for simultaneous support of Circuit Emulated Services over a cell infrastructure or over a packet infrastructure. A further need exists for methods and apparatus for simultaneous support of Circuit Emulated Services using a mapping/demapping function between ATM cells and packets. Yet another need exists for methods and apparatus for simultaneous support of Circuit Emulated Services using shared hardware for one or more of cell/packet translation, dejitter buffering and clock recovery. In addition, a need exists for multiple services over a packet switched network with a common management approach
SUMMARY OF THE INVENTION
Generally, methods and apparatus are provided for circuit emulation services over cell and packet networks. According to one aspect of the invention, a constant bit rate traffic stream is mapped to one of a cell and packet structure. The constant bit rate traffic stream is mapped to one or more cells and the one or more cells are selectively translated to one or more packets if a packet stream is selected. The constant bit rate traffic stream can be associated with, for example, a T1/E1 circuit connection. The cell structure can be associated with, for example, an ATM network and the packet structure can be associated with, for example, one or more of an IP network and an Ethernet network.
According to one aspect of the invention, one of a received cell and packet stream are mapped to a constant bit rate traffic stream. The packet stream is selectively translated to one or more cells and the one or more cells are translated to the constant bit rate traffic stream. A clock can optionally be recovered from the received cell or packet stream. In one exemplary implementation, one or more of the clock recovery, translation and buffer storage are performed using the same hardware for the received cell and packet streams.
A more complete understanding of the present invention, as well as further features and advantages of the present invention, will be obtained by reference to the following detailed description and drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
<figref idrefs="DRAWINGS">FIG. 1</figref> illustrates a communication system incorporating features of the present invention;
<figref idrefs="DRAWINGS">FIGS. 2A and 2B</figref> illustrate exemplary 53 byte ATM cell formats that may be employed for the ATM circuit emulation;
<figref idrefs="DRAWINGS">FIG. 3</figref> is a flow chart describing an exemplary implementation of a translation algorithm that may be implemented by the ALG block in the IWF of <figref idrefs="DRAWINGS">FIG. 1</figref>; and
<figref idrefs="DRAWINGS">FIG. 4</figref> illustrates the exemplary egress gateway node of <figref idrefs="DRAWINGS">FIG. 1</figref> in further detail.
DETAILED DESCRIPTION
The present invention provides simultaneous support for CES over ATM and CES over packets. According to one aspect of the invention, a mapping/demapping algorithm is disclosed that translates between ATM cells and packets. According to a further aspect of the invention, simultaneous support of Circuit Emulated Services is provided using shared hardware for one or more of cell/packet translation, dejitter buffering and clock recovery. While the present invention is illustrated in the context of mapping a constant bit rate (CBR) T1/E1 stream to cells or packets, the present invention can be applied to any constant bit rate stream, as would be apparent to a person of ordinary skill in the art.
<figref idrefs="DRAWINGS">FIG. 1</figref> illustrates a communication system <b>100</b> incorporating features of the present invention. As shown in <figref idrefs="DRAWINGS">FIG. 1</figref>, an ingress gateway node <b>105</b> communicates with an egress gateway node <b>155</b> over one or more networks, such as an IP network <b>140</b> and an ATM network <b>150</b>. The exemplary ingress gateway node <b>105</b> comprises a T1/E1 framer <b>110</b> and an interworking function (IWF) <b>120</b>. The T1/E1 framer <b>110</b> receives a CBR stream over T1/E1 circuits, identifies the start of each frame and generates circuit traffic with a frame start indicator, in a known manner.
The T1 frame delineated circuit traffic is then processed by the IWF <b>120</b>. Generally, the IWF <b>120</b> is a network processor. According to one aspect of the invention, the IWF <b>120</b> processes the CBR circuit traffic and generates either cells or packets. As shown in <figref idrefs="DRAWINGS">FIG. 1</figref>, the exemplary IWF <b>120</b> comprises an AAL1 stage that maps the CBR circuit traffic (T1 frames) to, for example, 53 byte ATM cells (such as a 48 byte payload and a five byte header). Thereafter, an exemplary mapping algorithm (ALG) selectively generates ATM cells or packets, as discussed further below in conjunction with <figref idrefs="DRAWINGS">FIG. 3</figref>. The packets are generally variable sized packets, such as IP or Ethernet packets in a Structured Agnostic Transport over Packet (SAToP) format. The cells or packets generated by the IWF <b>120</b> are processed by a Wide Area Network Interface (WAN I/F) <b>130</b> and transmitted on, for example, an ATM network <b>140</b> for cells, or an IP network <b>150</b> for packets.
The exemplary egress gateway node <b>155</b> comprises a T1/E1 framer <b>160</b> and an IWF <b>170</b>. A WAN I/F <b>180</b> receives cells from the exemplary ATM network <b>140</b>, or packets from the exemplary IP network <b>150</b> and applies the received cells or packets to the IWF <b>170</b>. As shown in <figref idrefs="DRAWINGS">FIG. 1</figref>, the exemplary IWF <b>170</b> comprises an exemplary demapping algorithm (ALG) that selectively translates the ATM cells or packets to cells. An AAL1 stage maps the ATM cells to CBR circuit traffic (T1 frames). The T1/E1 framer <b>160</b> processes the CBR stream for transmission over the T1/E1 circuits, in a known manner.
<figref idrefs="DRAWINGS">FIGS. 2A and 2B</figref> illustrate exemplary 53 byte ATM cell formats <b>200</b>, <b>250</b> that may be employed for the ATM circuit emulation. As shown in <figref idrefs="DRAWINGS">FIGS. 2A and 2B</figref>, both exemplary ATM cell formats <b>200</b>, <b>250</b> comprise a 5 byte (i.e., octet) header and a 48 byte payload. In a first exemplary ATM cell format mode <b>200</b> (AAL0), shown in <figref idrefs="DRAWINGS">FIG. 2A</figref>, all 48 bytes of the payload are used to transport T1/E1 data. In a second exemplary ATM cell format mode <b>250</b> (AAL1), shown in <figref idrefs="DRAWINGS">FIG. 2B</figref>, 47 bytes of the payload are used to transport T1/E1 data and one byte is used for timestamps and sequence numbers, in a known manner. The AAL1 format is used in the ATM examples described herein.
Packet circuit emulation, as in a SAToP approach, relies upon mapping T1/E1 circuits to a fixed packet payload. Exemplary fixed payload sizes include 192 bytes, 188 bytes and, 96 bytes. Typical packet circuit emulation approaches use fixed length payloads (as opposed to asynchronous oriented data services which use variable sized payload containers).
<figref idrefs="DRAWINGS">FIG. 3</figref> is a flow chart describing an exemplary implementation of a translation algorithm <b>300</b> that may be implemented by the ALG block in the IWF <b>120</b> of <figref idrefs="DRAWINGS">FIG. 1</figref>. Generally, the translation algorithm <b>300</b> translates between ATM CES (cell to cell) and packet CES (cell to packet). In an exemplary implementation, the translation algorithm <b>300</b> initially accesses a flag associated with the T1 circuit during step <b>310</b>, such as a bit setting in a header, to determine if the bit control indicates that the CES is being performed over an ATM or packet network.
If CES over ATM is desired, then the cell from the AAL1 block is passed through by the translation algorithm <b>300</b> during step <b>320</b>. If, however, CES over packet is desired, then four cells from the AAL1 block are translated into one packet during step <b>330</b>. In particular, in one exemplary AAL1 implementation, the 47 byte payload from four cells are mapped into one 188 byte payload for a packet (e.g., an AAL1 to SAToP translation). In an exemplary AAL0 implementation, the 48 byte payload from four cells are mapped into one 192 byte payload for a packet. It is noted that additional overhead changes may be necessary, but are outside the scope of the present invention. For example, a sequence number, length, and launch and recovery (L/R) bits may be added.
On an egress path, the demapping algorithm in the IWF <b>170</b> performs the inverse function of the translation algorithm <b>300</b>. For example, for an exemplary AAL1 implementation, the 188 byte payload for a packet is mapped into four 47 byte cells. In an exemplary AAL0 implementation, the 192 byte payload for a packet is mapped into four 48 byte cells. It is noted that additional overhead changes may be necessary, but are outside the scope of the present invention. For example, a sequence number (16 bits), channel state information (CSI), cyclic redundancy check (CRC), and high priority (HP) bits may be added.
<figref idrefs="DRAWINGS">FIG. 4</figref> illustrates the exemplary egress gateway node <b>155</b> of <figref idrefs="DRAWINGS">FIG. 1</figref> in further detail. As shown in <figref idrefs="DRAWINGS">FIG. 4</figref>, information is received from the packet or cell networks <b>140</b>, <b>150</b> and is processed by the IWF <b>170</b>. According to one aspect of the invention, a clock recovery operation <b>405</b> is performed to recover the clock needed for the T1/E1 circuits. In one exemplary implementation, an adaptive buffer <b>410</b> having a queue <b>420</b> is used to store the received data. The dejitter buffer <b>410</b> absorbs packet/cell delay variations across the network. The received cells and packets are placed by the IWF <b>170</b> in the queue <b>420</b>. The clock recovery circuit <b>405</b> monitors the level of the queue to generate the recovered clock. In particular, as the level of the data in the queue <b>420</b> exceeds a desired threshold, the speed of a clock signal, clk, generated by a digital phase locked loop (DPLL) <b>430</b> and an oscillator <b>440</b> is increased, and as the level of the data in the queue <b>420</b> falls below a desired threshold, the clock speed is decreased. The data is then provided from the queue <b>420</b> to a line interface unit (LIU) <b>450</b> with the recovered clock.
According to a further aspect of the invention, simultaneous support of Circuit Emulated Services is provided using shared hardware for one or more of cell/packet translation, dejitter buffering and clock recovery. As previously indicated, the IWF <b>170</b> includes a translation algorithm <b>300</b> that translates between cells and packets. In this manner, the IWF <b>170</b> provides a mapping function from the circuit domain to the cell/packet domain. By using the mapping algorithm that maps/demaps from ATM cells to packets, the hardware design can have a single instance of a dejitter buffer and a single instance of a clock recovery block. Thus, as shown in <figref idrefs="DRAWINGS">FIG. 4</figref>, the same dejitter buffer <b>410</b> and clock recovery circuit <b>405</b> are used for both CES over packets and CES over cells.
While <figref idrefs="DRAWINGS">FIG. 3</figref> shows an exemplary sequence of steps, it is also an embodiment of the present invention that the sequence may be varied. Various permutations of the algorithm are contemplated as alternate embodiments of the invention.
While exemplary embodiments of the present invention have been described with respect to digital logic blocks, as would be apparent to one skilled in the art, various functions may be implemented in the digital domain as processing steps in a software program, in hardware by circuit elements or state machines, or in combination of both software and hardware. Such software may be employed in, for example, a digital signal processor, micro-controller, or general-purpose computer. Such hardware and software may be embodied within circuits implemented within an integrated circuit.
Thus, the functions of the present invention can be embodied in the form of methods and apparatuses for practicing those methods. One or more aspects of the present invention can be embodied in the form of program code, for example, whether stored in a storage medium, loaded into and/or executed by a machine, or transmitted over some transmission medium, wherein, when the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the invention. When implemented on a general-purpose processor, the program code segments combine with the processor to provide a device that operates analogously to specific logic circuits.
System and Article of Manufacture Details
As is known in the art, the methods and apparatus discussed herein may be distributed as an article of manufacture that itself comprises a computer readable medium having computer readable code means embodied thereon. The computer readable program code means is operable, in conjunction with a computer system, to carry out all or some of the steps to perform the methods or create the apparatuses discussed herein. The computer readable medium may be a recordable medium (e.g., floppy disks, hard drives, compact disks, memory cards, semiconductor devices, chips, application specific integrated circuits (ASICs)) or may be a transmission medium (e.g., a network comprising fiber-optics, the world-wide web, cables, or a wireless channel using time-division multiple access, code-division multiple access, or other radio-frequency channel). Any medium known or developed that can store information suitable for use with a computer system may be used. The computer-readable code means is any mechanism for allowing a computer to read instructions and data, such as magnetic variations on a magnetic media or height variations on the surface of a compact disk.
The computer systems and servers described herein each contain a memory that will configure associated processors to implement the methods, steps, and functions disclosed herein. The memories could be distributed or local and the processors could be distributed or singular. The memories could be implemented as an electrical, magnetic or optical memory, or any combination of these or other types of storage devices. Moreover, the term “memory” should be construed broadly enough to encompass any information able to be read from or written to an address in the addressable space accessed by an associated processor. With this definition, information on a network is still within a memory because the associated processor can retrieve the information from the network.
It is to be understood that the embodiments and variations shown and described herein are merely illustrative of the principles of this invention and that various modifications may be implemented by those skilled in the art without departing from the scope and spirit of the invention.
Contents5
4 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4
Every citation, both waysCites: the store holds 8 of 9
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US2006050743A1 | Cites | United States of America | Search report |
| US5420858A | Cites | United States of America | Search report |
| US6094432A | Cites | United States of America | Search report |
| US6526057B1 | Cites | United States of America | Search report |
| US6795431B2 | Cites | United States of America | Search report |
| US6870837B2 | Cites | United States of America | Search report |
| US6944182B1 | Cites | United States of America | Search report |
| US7184440B1 | Cites | United States of America | Search report |
| Y Stein et al., "TDM Over IP," Internet Engineering Task Force (IETF), draft-ietf-pwe3-tdmoip-03.txt (Feb. 27, 2005). | Non-patent | – | Applicant |
| ATM Forum Specification, atm-vtoa-0078 (CES 2.0) (Jan. 1997). | Non-patent | – | Applicant |
2 members in 1 office
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 48032006 | United States of America | A | |
| US20060480320 | – | – | – |
Members2
| Document | Office | Kind | |
|---|---|---|---|
| US2008002738A1 | United States of America | A1 | |
| US8005094B2This record | United States of America | B2 |
76 transactions on the USPTO file
Allowed after 4 non-final rejections, 2 final rejections and 3 appeals.
- Non-final rejections
- 4
- Final rejections
- 2
- RCEs
- 0
- Appeals
- 3
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Expire PatentEXP. | EXP. | |
| Maintenance Fee Reminder MailedREM. | REM. | |
| Payment of Maintenance Fee, 8th Year, Large EntityM1552 | M1552 | |
| Correspondence Address ChangeC.ADB | C.ADB | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Final ActionA.NE | A.NE | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Request for Extension of Time - GrantedXT/G | XT/G | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Appeal Brief Review CompleteAPBR | APBR | |
| Appeal Brief FiledAP.B | AP.B | |
| Notice of Appeal FiledN/AP | N/AP | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Appeal Brief Review CompleteAPBR | APBR | |
| Appeal Brief FiledAP.B | AP.B | |
| Notice of Appeal FiledN/AP | N/AP | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Mail of Withdraw of Informal Amendment NoticeMA.IX | MA.IX | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Withdraw of Informal Amendment NoticeA.IX | A.IX | |
| Notice -- Defective Appeal BriefAPBD | APBD | |
| Appeal Brief Review CompleteAPBR | APBR | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Appeal Brief FiledAP.B | AP.B | |
| Defective / Incomplete Appeal Brief FiledAPBI | APBI | |
| Appeal Brief FiledAP.B | AP.B | |
| Notice of Appeal FiledN/AP | N/AP | |
| Mail Advisory Action (PTOL - 303)MCTAV | MCTAV | |
| Advisory Action (PTOL-303)CTAV | CTAV | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Response after Final ActionA.NE | A.NE | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Mail Examiner Interview Summary (PTOL - 413)MEXIN | MEXIN | |
| Examiner Interview Summary Record (PTOL - 413)EXIN | EXIN | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Correspondence Address ChangeC.ADB | C.ADB | |
| IFW TSS Processing by Tech Center CompleteTSSCOMP | TSSCOMP | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Application Is Now CompleteCOMP | COMP | |
| Payment of additional filing fee/PreexamFLFEE | FLFEE | |
| A statement by one or more inventors satisfying the requirement under 35 USC 115, Oath of the ApplicOATHDECL | OATHDECL | |
| Notice Mailed--Application Incomplete--Filing Date AssignedINCD | INCD | |
| Cleared by OIPE CSRL194 | L194 | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Initial Exam Team nnIEXX | IEXX |
27 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Lapsed due to failure to pay maintenance feeLapsedFP | FP | |
| Lapse for failure to pay maintenance feesLapsedPATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYLAPS | LAPS | |
| Information on status: patent discontinuationPATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362STCH | STCH | |
| Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| Maintenance fee paymentMAFP | MAFP | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| Fee paymentFPAY | FPAY | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| Notice of allowance mailedORIGINAL CODE: MN/=.ZAAB | ZAAB | |
| Notice of allowance and fees dueORIGINAL CODE: NOAZAAA | ZAAA | |
| AssignmentAS | AS | |
| AssignmentAS | AS |
Numbers
- Publication
- 08005094
- Publication, DOCDB
- 8005094
- Publication, EPODOC
- US8005094
- Application
- 11480320
- Application, DOCDB
- 48032006
- Application, EPODOC
- US20060480320
Titles
- English
- Method and apparatus for circuit emulation services over cell and packet networks
Patent term adjustment
- A delay
- +516 daysthe office missed an examination deadline
- B delay
- +662 dayspendency past three years
- Applicant delay
- −37 days
- Net adjustment
- 1,141 days
Classification
- CPC, 3
- H04L12/5601
- H04L2012/5618
- H04L2012/5665
- IPC, 1
- H04L12 28
- USPC, 2
- 370395500
- 370395610