Patents by Inventor Stephen Kieran Anthony Adolph

Stephen Kieran Anthony Adolph has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7209451
    Abstract: An apparatus and method for detecting and suppressing corrupted data frames transported from a SONET network to a receiver utilizing the SOF frame indicator to manage the buffer-to-buffer credit count. By verifying the integrity of the SOF frame indicator prior to forwarding it to the client receiver the apparatus and method ensure that the buffer-to-buffer credit count integrity is maintained while avoiding the introduction of latency.
    Type: Grant
    Filed: October 23, 2001
    Date of Patent: April 24, 2007
    Assignee: Ciena Corporation
    Inventors: Ronald Arthur Frank, Stephen Kieran Anthony Adolph
  • Patent number: 7130264
    Abstract: Service path protection is provided for packet-based data services (e.g. GbE or FC) by making available to a protected service, as and when needed, preemptable (i.e. sharable) transport bandwidth (e.g. STS-1s for a SONET network) used, under normal conditions, to transport other data services. Each client-based service path is defined by a selectable working path when service protection has not been initiated for that service path and each working path comprises a selectable bandwidth, selectable portions of which are designated as unpreemptable and/or preemptable, whereby the preemptable bandwidth portions are made available for protection preemption by different service paths. A protection path is assigned to each protected service path, whereby each protection path comprises a selectable bandwidth having preemptable bandwidth portion(s) of working path(s) defining different service path(s) and/or unused network bandwidth.
    Type: Grant
    Filed: December 26, 2001
    Date of Patent: October 31, 2006
    Assignee: Ciena Corporation
    Inventors: Marvin Jake Wiebe, Phuong Lethebinh, Stephen Kieran Anthony Adolph
  • Patent number: 6965619
    Abstract: A method and apparatus are provided for flexible time-division multiplexing, and demultiplexing, of serial line data, from 1-n client lines, based on the SONET standard (e.g. OC-48 or OC-192) whereby a predetermined and reconfigurable number of STS-1s are allocated to each client. A multiplexer includes 1 to n mappers for mapping the data of 1 to n clients, according to a predetermined bandwidth allocation, to an N×STS-1 SONET payload, each mapper using y STS-1s where y is 0 to N, the y STS-1s being selected on a sequential or non-sequential concatenation basis from the N STS-1s. Each mapper maps the data of one client and each allocated STS-1 is allocated to one client and the total number of STS-1s allocated to the clients is less than or equal to N. An aggregator aggregates the mapped data into a composite STS payload comprising N STS-1s. A bandwidth allocation receiver receives the bandwidth allocation.
    Type: Grant
    Filed: December 4, 2000
    Date of Patent: November 15, 2005
    Assignee: Ciena Corporation
    Inventors: Germain Paul Bisson, Stephen Kieran Anthony Adolph, Ronald Arthur Frank, Stephen Knobel, Jim Chi-Luen Yau, Barry Leo Pelley
  • Publication number: 20030117951
    Abstract: Service path protection is provided for packet-based data services (e.g. GbE or FC) by making available to a protected service, as and when needed, preemptable (i.e. sharable) transport bandwidth (e.g. STS-1s for a SONET network) used, under normal conditions, to transport other data services. Each client-based service path is defined by a selectable working path when service protection has not been initiated for that service path and each working path comprises a selectable bandwidth, selectable portions of which are designated as unpreemptable and/or preemptable, whereby the preemptable bandwidth portions are made available for protection preemption by different service paths. A protection path is assigned to each protected service path, whereby each protection path comprises a selectable bandwidth having preemptable bandwidth portion(s) of working path(s) defining different service path(s) and/or unused network bandwidth.
    Type: Application
    Filed: December 26, 2001
    Publication date: June 26, 2003
    Applicant: Akara Corporation
    Inventors: Marvin Jake Wiebe, Phuong Lethebinh, Stephen Kieran Anthony Adolph
  • Publication number: 20030076779
    Abstract: An apparatus and method for detecting and suppressing corrupted data frames transported from a SONET network to a receiver utilizing the SOF frame indicator to manage the buffer-to-buffer credit count. By verifying the integrity of the SOF frame indicator prior to forwarding it to the client receiver the apparatus and method ensure that the buffer-to-buffer credit count integrity is maintained while avoiding the introduction of latency. A frame de-encapsulation component produces data frames compatible with the receiver from SONET frames input thereto and outputs the receiver-compatible data frames. An idle frame signal generator generates idle frame signals. A Start of Frame (SOF) indicator detector detects a Start of Frame indicator in each data frame output from the frame de-encapsulation component, determines whether the Start of Frame indicator is valid or corrupted and produces an output signal indicative of that determination.
    Type: Application
    Filed: October 23, 2001
    Publication date: April 24, 2003
    Applicant: Akara Corporation
    Inventors: Ronald Arthur Frank, Stephen Kieran Anthony Adolph
  • Publication number: 20030026298
    Abstract: A method and apparatus are provided for flexible time-division multiplexing, and demultiplexing, of serial line data, from 1-n client lines, based on the SONET standard (e.g. OC-48 or OC-192) whereby a predetermined and reconfigurable number of STS-1s are allocated to each client. A multiplexer includes 1 to n mappers for mapping the data of 1 to n clients, according to a predetermined bandwidth allocation, to an N×STS-1 SON ET payload, each mapper using y STS-1s where y is 0 to N, the y STS-1s being selected on a sequential or non-sequential concatenation basis from the N STS-1s. Each mapper maps the data of one client and each allocated STS-1 is allocated to one client and the total number of STS-1s allocated to the clients is less than or equal to N. An aggregator aggregates the mapped data into a composite STS payload comprising N STS-1s. A bandwidth allocation receiver receives the bandwidth allocation.
    Type: Application
    Filed: December 4, 2000
    Publication date: February 6, 2003
    Inventors: Germain Paul Bisson, Stephen Kieran Anthony Adolph, Ronald Arthur Frank, Stephen Knobel, Jim Chi-Luen Yau, Barry Leo Pelley