Method for dynamically computing a switching schedule

Details Method for dynamically computing a switching schedule Method for dynamically computing a switching schedule

2006-09-12

2006-09-12

Hsu, Alpus H. (Department: 2668)

Multiplex communications

Data flow congestion prevention or control

Control of data admission to the network

C370S395400, C370S413000

Reexamination Certificate

active

07106697

ABSTRACT:
Methods and systems for dynamically computing a schedule defining interconnections between ports in a switching system. In one embodiment, a switching core requests demand reports from the ingress ports. In response to this request, the ingress ports generate a series of suggested port schedules, beginning with a first choice, then a second choice, and so on. The schedules are transmitted to the switching core, beginning with the first choice. The switching core receives the first choice for each of the ports and determines whether the aggregate schedule defined by the first choices is valid. If the aggregate schedule is valid, then this schedule is implemented. If the aggregate schedule is not valid, portions of it are discarded and the next choice from each of the ports is examined to identify connections to replace the discarded portions. This process is repeated until a valid schedule is obtained.

REFERENCES:
patent: 5416769 (1995-05-01), Karol
patent: 5469284 (1995-11-01), Haas
patent: 5486943 (1996-01-01), Sasayama et al.
patent: 5734486 (1998-03-01), Guillemot et al.
patent: 5737106 (1998-04-01), Sansonetti et al.
patent: 6304552 (2001-10-01), Chapman et al.
patent: 6345040 (2002-02-01), Stephens et al.
patent: 6665495 (2003-12-01), Miles et al.
patent: 2002/0029238 (2002-03-01), Okuhata
patent: 2003/0067653 (2003-04-01), Aicklen et al.
patent: 2005/0276263 (2005-12-01), Suetsugu et al.
Chi-Feng Wu et al, Simulation-based test algorithm generation and port scheduling for multi-port memories, Jun. 2001, AMC Press, Proceedings of the 38th conference on Design automation, pp. 301-306.
Peter Mattson et al, Communication Scheduling, Nov. 2000, AMC Press, ACM SIGARCH Computer Architecture News , ACM SIGOPS Operating Systems Review , Proceedings of the ninth international conference on Architectural support for programming languages and operating systems ASPLOS-IX, vol. 28, 34 Issue 5 , 5, pp. 82-92.
G. Depovere, et. al., Philips Research Laboratories, “A Flexible Cross-Connect Network Using Multiple Object Carriers,” Date Unknown, All Pages.
John M. Senior, et al., SPIE—The International Society for Optical Engineering, “All-Optical Networking 1999: Architecture, Control, and Management Issues” vol. 3843, pp. 111-119, dated Sep. 19-21, 1999.
Jonathan S. Turner, Journal of High Speed Networks 8 (1999) 3-16 IOS Press, “Terabit Burst Switching”, pp. 3-16.
Ken-ichi Sato, IEEE Journal on Selected Areas in Communications, vol. 12, No. 1, Jan. 1994 “Network Performance and Integrity Enhancement with Optical Path Layer Technologies”, pp. 159-170.
F. Callegati, et al., Optical Fiber Technology 4, 1998 “Architecture and Performance of a Broadcast and Select Photonic Switch*”, pp. 266-284.
Soeren Lykke Danielsen, et al., “WDM Packet Switch Architectures and Analysis of the Influence of Tuneable Wavelength Converters on the Performance”.
Soeren L. Danielsen, et al., IEEE Photonics Technology Letters, vol. 10, No. 6, Jun. 1998 “Optical Packet Switched Network Layer Without Optical Buffers”.
John M. Senior, et al., SPIE—The International Society of Optical Engineering,All-Optical Networking: Architecture, Control and Management Issuesdated Nov. 3-5, 1998, vol. 3531, pp. 455-464.
M.C. Chia, et al., Part of SPIE Conference on All-Optical Networking: Architecture, Control and Management Issues, Nov. 1998, “Performance of Feedback and Feedforward Arrayed—Waveguide Gratings-Based Optical Packet Switches with WDM Inputs/Outputs”.

Affiliated with

Also associated with

Rating

Method for dynamically computing a switching schedule does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for dynamically computing a switching schedule, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for dynamically computing a switching schedule will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3565448