Time management of information distributed on K-bytes in SDH...

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S474000

Reexamination Certificate

active

06944157

ABSTRACT:
A SONET/SDH frame providing for an optimized management of K1 and K2 bytes of protection protocol and providing for the management of a number of nodes higher than sixteen, which is the highest number which is provided for at the present time. In practice, the bits of a third byte (K0) of Multiplex Section OverHead are used in such a way that at least one of them represents a Source Node IDentification Extension bit, at least one of them represents a Destination Node IDentification Extension bit and at least one bit of those remaining indicates a change of the information in said first, second or third bytes (K1, K2, K0). In this way, the nodes which can be managed can be even 128 and the switching rate could be highly increased.

REFERENCES:
patent: 5631896 (1997-05-01), Kawase et al.
patent: 6094737 (2000-07-01), Fukasawa
patent: 6714531 (2004-03-01), Oide et al.
ITU-T Recommendation G.841 (Feb. 1998).
ITU-T Recommendation G.707 (Mar. 1996).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Time management of information distributed on K-bytes in SDH... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Time management of information distributed on K-bytes in SDH..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Time management of information distributed on K-bytes in SDH... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3403303

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.