IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0493453
(2000-01-28)
|
발명자
/ 주소 |
- Hardjono, Thomas
- Cain, Brad
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
12 인용 특허 :
9 |
초록
▼
A method and apparatus for distributing key certificates across PIM-SM routing domains by MSDP messages. A rendez-vous point RP in a PIM-SM domain can have a MSDP peering relationship with other rendez-vous point RP's in other domains. The peering relationship is a transport control protocol (TCP).
A method and apparatus for distributing key certificates across PIM-SM routing domains by MSDP messages. A rendez-vous point RP in a PIM-SM domain can have a MSDP peering relationship with other rendez-vous point RP's in other domains. The peering relationship is a transport control protocol (TCP). Each domain has a connection to the MSDP topology through which it can exchange control information with active sources and rendez-vous points RP's in other domains. The normal source-tree building mechanism in PIM-SM is used to deliver multicast data over an internet domain distribution tree.
대표청구항
▼
A method and apparatus for distributing key certificates across PIM-SM routing domains by MSDP messages. A rendez-vous point RP in a PIM-SM domain can have a MSDP peering relationship with other rendez-vous point RP's in other domains. The peering relationship is a transport control protocol (TCP).
A method and apparatus for distributing key certificates across PIM-SM routing domains by MSDP messages. A rendez-vous point RP in a PIM-SM domain can have a MSDP peering relationship with other rendez-vous point RP's in other domains. The peering relationship is a transport control protocol (TCP). Each domain has a connection to the MSDP topology through which it can exchange control information with active sources and rendez-vous points RP's in other domains. The normal source-tree building mechanism in PIM-SM is used to deliver multicast data over an internet domain distribution tree. e and System For Efficient Management of Bi-Directional Bus” Ser. No. 09/652,232, filed Aug. 31, 2000, “An Efficient Address Interleaving With Simultaneous Multiple Locality Options,” Ser. No. 09/652,452, filed Aug. 31, 2000, “A High Performance Way Allocation Strategy For A Multi-Way Associative Cache System,” Ser. No. 09/653,092, filed Aug. 31, 2000, “Method And System For Absorbing Defects In High Performance Microprocessor With A Large N-Way Set Associative Cache,” Ser. No. 09/651,948, filed Aug. 31, 2000, “A Method For Reducing Directory Writes And Latency In A High Performance, Directory-Based, Coherency Protocol,” Ser. No. 09/652,324, filed Aug. 31, 2000, “Mechanism To Reorder Memory Read And Write Transactions For Reduced Latency And Increased Bandwidth,” Ser. No. 09/653,094, filed Aug. 31, 2000, “System For Minimizing Memory Bank Conflicts In A Computer System,” Ser. No. 09/652,325, filed Aug. 31, 2000, “Computer Resource Management And Allocation System,” Ser. No. 09/651,945, filed Aug. 31, 2000, “Input Data Recovery Scheme,” Ser. No. 09/653,643, filed Aug. 31, 2000, “Fast Lane Prefetching,” Ser. No. 09/652,451, filed Aug. 31, 2000, “Mechanism For Synchronizing Multiple Skewed Source-Synchronous Data Channels With Automatic Initialization Feature,” Ser. No. 09/652,480, filed Aug. 31, 2000, “Mechanism To Control The Allocation Of An N-Source Shared Buffer,” Ser. No. 09/651,924, filed Aug. 31, 2000, and “Chaining Directory Reads And Writes To Reduce DRAM Bandwidth In A Directory Based CC-NUMA Protocol,” Ser. No. 09/652,315, filed Aug. 31, 2000, all of which are incorporated by reference herein.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.