$\require{mediawiki-texvc}$
  • 검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
  • 검색연산자
검색도움말
검색연산자 기능 검색시 예
() 우선순위가 가장 높은 연산자 예1) (나노 (기계 | machine))
공백 두 개의 검색어(식)을 모두 포함하고 있는 문서 검색 예1) (나노 기계)
예2) 나노 장영실
| 두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색 예1) (줄기세포 | 면역)
예2) 줄기세포 | 장영실
! NOT 이후에 있는 검색어가 포함된 문서는 제외 예1) (황금 !백금)
예2) !image
* 검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색 예) semi*
"" 따옴표 내의 구문과 완전히 일치하는 문서만 검색 예) "Transform and Quantization"

통합검색

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

특허 상세정보

Shortest path determination processes for use in modeling systems and communications networks

특허상세정보
국가/구분 United States(US) Patent 등록
국제특허분류(IPC7판) G06F-017/30    G06F-017/50   
미국특허분류(USC) 395/500 ; 364/578 ; 364/2212 ; 364/24294
출원번호 US-0472162 (1995-06-07)
발명자 / 주소
출원인 / 주소
인용정보 피인용 횟수 : 35  인용 특허 : 0
초록

Methods for operating a modeling system and/or a communications network, using a computer assisted process, are described, which transform a first set of signals, including (a) signals representing a given linear network defined in terms of a set of node identification signals, (b) a set of weighted/directed edge signals each of which identify the weight, direction and the pair of nodes in the network interconnected via a given edge, and (c) signals representing arbitrarily specified start and target nodes in the network, into a second set of signals ind...

대표
청구항

A method of operating a modeling system, with the aid of a digital computer, to transform a first set of signals, including (a) signals representing a given linear network defined in terms of a set of node identifications signals, (b) a set of weighted/directed edge signals each of which identify the weight, direction and the pair of nodes in said network interconnected via a given edge, and (c) signals representing arbitrarily specified start and target nodes in said network, into a second set of signals indicating the shortest path in said network betw...

이 특허를 인용한 특허 피인용횟수: 35

  1. Jain,Bijendra N.; McCloghrie,Keith. Apparatus for estimating delay and jitter between network routers. USP2006097111073.
  2. Cotter, David. Communications network. USP2004036714552.
  3. Liver, Beat. Computerized method for computing the overall splitting cost of a data structure using blocking island contour map of a network-level graph. USP2003116643699.
  4. Kodialam Muralidharan Sampath ; Lau Wing Cheong ; Yan Anlu. Constrained shortest path routing method. USP2001116321271.
  5. Hiroyuki Kawakami JP; Hiroyuki Okazaki JP. Designing tool for designing access communication network, designing method thereof, and record medium. USP2002076418123.
  6. Yarbrough, III, Charles T.; Reimund, James A.; Sukumaran, Rajesh; Haddad, Michel G.. Dimensionally flexible sparse matrix topology. USP2009057535315.
  7. Payton, David W.; Daily, Michael J.; Howard, Mike; Lee, Craig. Distributed display composed of active fiducials. USP2011108035078.
  8. Payton, David; Daily, Mike; Howard, Mike; Lee, Craig. Distributed display composed of active fiducials. USP2009117612324.
  9. Rexford, Jennifer Lynn; Shaikh, Anees. Efficient precomputation of quality-of-service routes. USP2003106633544.
  10. Gross, Kevin Paul. Exploiting shortest path for improved network clock distribution. USP2005126973152.
  11. Jensen Delos Clark ; Carter Stephen R.. Extrinsically influenced near-optimal path apparatus and method. USP2000056067572.
  12. Payton, David W.; Howard, Mike; Daily, Mike; Lee, Craig; Hoff, Bruce. Method and apparatus for controlling the movement of a plurality of agents. USP2003016507771.
  13. Pu, Suo Ming; Song, Hong Hua; Dai, Hong Wei. Method and apparatus for detecting contradictory timing constraint conflicts. USP2012108302048.
  14. Jain, Bijendra N.; McCloghrie, Keith. Method and apparatus for estimating delay and jitter between many network routers using measurements between a preferred set of routers. USP2010087773515.
  15. Jain, Bijendra N.; McCloghrie, Keith. Method and apparatus for estimating delay and jitter between many network routers using measurements between a preferred set of routers. USP2005066912203.
  16. Jain, Bijendra N.; McCloghrie, Keith. Method and apparatus for estimating delay and jitter between network routers. USP2005036868068.
  17. Jain, Bijendra N.; McCloghrie, Keith. Method and apparatus for estimating delay and jitter between network routers coupled to background network. USP2005046885642.
  18. Payton,David W.. Method and apparatus for providing directed communications through a networked array of nodes. USP2007017158511.
  19. Payton,David W.; Hoff,Bruce; Howard,Mike; Lee,Craig. Method and apparatus for signaling among a plurality of agents. USP2006097113746.
  20. Payton, David W.; Lee, Craig; Hoff, Bruce; Howard, Mike; Daily, Mike. Method and apparatus for terrain reasoning with distributed embedded processing elements. USP2003066580979.
  21. Bertin, Olivier; Brun, Gerard; Galand, Claude; Maurel, Olivier; Nicolas, Laurent. Method and system for minimizing the connection set up time in high speed packet switching networks. USP2005086934249.
  22. Olivier Bertin FR; Gerard Brun FR; Claude Galand FR; Olivier Maurel FR; Laurent Nicolas FR. Method and system for minimizing the connection set up time in high speed packet switching networks. USP2002066400681.
  23. Soga, Kenji. Method for designing tree-structured communication routes and tree-structure solution of communication routes. USP2005116965944.
  24. Martin, Jan; Walkling, Uwe. Method for influencing source data for determining a route in a navigation system. USP2003106633812.
  25. Srivastava, Arty; Ritter, Michael W.; Friday, Robert J.. Method for maximizing throughput for multiple links using directional elements. USP2004056735178.
  26. Wight, Mark S.; Lindhorst-Ko, Gwenda. Method of addressing physical problems of a topological network using a topology engine. USP2005076917596.
  27. Payton, David W.; Estkowski, Regina I.. Motion prediction within an amorphous sensor array. USP2005046885303.
  28. Alpert, Charles Jay; Hassoun, Soha. Optimal buffered routing path constructions for single and multiple clock domains systems. USP2005076915361.
  29. Sugisono, Koji; Aoki, Michihiro; Iwata, Hideaki. Path calculating method, program and calculating apparatus. USP2015129215163.
  30. Adrian Newcombe IE; Jila Seraj IE. Prioritized agent-based hierarchy structure for handling performance metrics data in a telecommunication management system. USP2002026349325.
  31. Klincewicz, John Gregory; Schmitt, James Anthony; Wong, Richard Tekee. System and method for designing a network. USP2009127626945.
  32. Johnson William A.. System and method for management of connection oriented networks. USP2000066078946.
  33. Grayson, J. Paul; Emmons, Jr., Stephen Perry. System and method for solid modeling. USP2004066748419.
  34. Zaumen William T. ; Garcia-Luna-Aceves J. Joaquin. System for maintaining multiple loop free paths between source node and destination node in computer network. USP1999035881243.
  35. Isaiah Florenca AU. Three dimensional graphical display generating system and method. USP2002056392648.