(12) United States Patent
`Voit et al.
`
`(10) Patent N0.:
`(45) Date of Patent:
`
`US 6,215,790 B1
`Apr. 10, 2001
`
`USOO6215790B1
`
`(54) AUTOMATIC CALLED PARTY LOCATOR
`OVER INTERNET WITH PROVISIONING
`
`(75)
`
`Inventors: Eric A_ Voit’ Baltimore, MD (Us);
`Robert D. Farris, Sterling, VA (US)
`
`(73) Assignee: Bell Atlantic Network Services, Inc.,
`A l'
`t
`VA US
`r mg on’
`(
`)
`Subject to any disclaimer, the term of this
`patent is extended or adjusted under 35
`USC. 154(b) by 0 days.
`
`( * ) Notice:
`
`(21) Appl, No; 08/815,367
`
`(22)
`
`Filed:
`
`Mar. 11, 1997
`
`Related US. Application Data
`
`(63)
`
`(51)
`
`Continuation—in—part of application No. 08/811,714, filed on
`Mar. 6, 1997, which is a continuation—impart of application
`NO- 08/812975; filed 011 Man 6, 1997~
`Int. Cl.7 ........................... H04L 12/28; H04L 12/56;
`H04L 12/66
`........................... 370/401 370/354 370/467
`(52) us. Cl.
`(58) Field of Search
`’
`370/352 353
`370/354, 355, 356, 400, 401, 467; 379/58
`
`(56)
`
`References Cited
`U.S. PATENT DOCUMENTS
`
`4,313,035
`4,611,094
`4,611,096
`4,734,931
`4,788,718
`4,872,160
`4,897,874
`4,899,373
`479587341
`5,185,860
`
`5,195,086
`5,206,901
`5,247,571
`5,260,986
`
`...................... .. 379/207
`1/1982 Jordan et a1.
`
`.
`u 379/201
`9/1986 Asmuth et a1.
`.
`....“ 379/207
`9/1986 Asmuth et a1.
`
`379/9301
`3/1988 130ng et a1.
`.... u 379/113
`11/1988 McNabb et a1,
`., 370/353
`10/1989 Hemmady et a1.
`.
`
`380/3
`1/1990 Lidinsky et a1.
`
`.......... ..
`.. 379/207
`2/1990 Lee et a1.
`-~ 370/352
`9/1990 Hemmady et ‘11
`
`2/1993 Wu ....................... ..
`709/224
`3/1993 Baumgartner et a1.
`............ .. 370/264
`4/1993 Harlow et a1.
`..................... .. 379/211
`9/1993 Kay et a1.
`.. 379/207
`
`11/1993 Pershan .............................. .. 455/413
`
`5,272,749
`5,341,374
`5,347,633
`
`5,353,331
`
`12/1993 Masek ................................ .. 379/216
`8/1994 Lewen et al.
`370/450
`
`9/1994 Ashfield et al.
`709/238
`...................... .. 455/461
`10/1994 Emery et a1.
`(List continued on next page.)
`
`..
`
`OTHER PUBLICATIONS
`“Computer Telephony over the Internet”, Grigonis, Richard,
`CT and the Net> Mar' 1996'
`(List continued on next page.)
`Primary Examiner—Hassan Kizou
`Assistant Examiner—John Pezzlo
`(74) Attorney, Agent, or Firm—McDermott, Will & Emery
`
`(57)
`
`ABSTRACT
`,
`,
`A system and method usmg enhanced processmg, respon-
`Slve to domain game tranSIation reqlleStsa t0 Proyide Selec'
`t1ve rout1ng servrces through a publrc packet swrtched data
`network. The name processing applies to translation of a
`domain name into a group of Internet Protocol
`(11’)
`addresses and to providing routing information for a packet
`data Petwork such as the Internet Following “We “ans”?
`tron 1nto a group of addresses commumcatron rs automat1-
`cally established between a calling terminal and a terminal
`designated by one of the addresses and determined through
`processing which effects linkage with the first terminal to
`respond. The selectrve rout1ng rs part1cularly advantageous
`for processing of voice telephone communications through
`the Internet packet data network based on domain name
`translations. One or more domain names can be translated
`1nto a group of addresses wh1ch may 1nclude a mrxture of
`Internet (IP) addresses and telephone number addresses,
`along with routing procedures with respect to the addresses.
`The system is designed to provide called party locator
`services offering a variety of options to the customer for the
`procedures to be followed. An important feature is a con-
`venient and efficient provisioning method using an advanced
`intelligent network provided with one or more intelligent
`eri heral
`latforms
`p
`
`p
`
`p
`
`‘
`
`6 Claims, 16 Drawing Sheets
`
`
`
`DOMAIN NAME
`SERVER
`
`
`
`
`
`
`
`
`
`_________l
`
`uo
`
`
`
`
`
`
`
`
`
`
`
`
`YMAX EXHIBIT 1033
`
`000001
`
`|PR2016-01258
`
`YMAX CORP. V. FOCAL IP
`
`
`
`000001
`
`YMAX EXHIBIT 1033
`YMAX CORP. V. FOCAL IP
`IPR2016-01258
`
`

`

`
`
`US 6,215,790 B1
`
`Page 2
`
`U.S. PATENT DOCUMENTS
`
`5,361,256
`5,375,068
`5,410,754
`5,425,028
`5,434,913
`5,475,748
`5,479,494
`5,487,111
`5,490,247
`5,493,568
`5,506,887
`5,526,489
`5,572,583
`5,608,786
`5,724,355
`5,726,984
`5,742,668 *
`5,867,495 *
`
`11/1994 Doeringer et al.
`................. .. 370/390
`12/1994 Palmer et al.
`.. 709/204
`
`.
`.. 370/466
`4/1995 Klotzbach et al.
`
`.. 370/389
`6/1995 Britton et al.
`..
`.. 379/202
`7/1995 Tung et al.
`
`12/1995 Jones ......... ..
`379/211
`
`12/1995 Clitherow
`379/144
`1/1996 Slusky ....... ..
`379/211
`
`.. 345/501
`2/1996 Tung et al.
`
`..
`.. 370/261
`2/1996 Sampat et al.
`..... ..
`.. 455/461
`4/1996 Emery et al.
`6/1996 Nilakantan et al.
`.. 709/228
`11/1996 Wheeler, Jr. et al.
`.. 379/207
`3/1997 Gordon ............ ..
`370/352
`3/1998 Bruno et al.
`.. 370/401
`3/1998 Kubler et al.
`.. 370/349
`4/1998 Pepe et al.
`........................... .. 379/58
`2/1999 Elliott et al.
`....................... .. 370/352
`OTHER PUBLICATIONS
`
`
`
`
`..
`
`“Geek of the Week”, Karn, Phil et. al., Internet Talk Radio,
`Mobile IP Networking, NOV. 1993.
`“How to Build an Internet PBX”, McConnell, Brian, http://
`www.ph0nezone.c0m/ip—ph0ne.htm, pp. 1—9.
`
`“Welcome to the Phone Zone”, Pacific Telephony Design,
`http://www.ph0nez0ne.com/indeX2.htm, pp. 1—6.
`“Innovations in Internet Telephony: The Internet as the
`Competitor t0 the POTS Network”, Sears, Andrew, Innova-
`tions in Internet Telephony: The Internet as the Successor t0
`the POTS Network, Feb. 28, 1996, pp. 1—6.
`“Computer Telephony and the Internet”, Stylus Innovation,
`http://www.stylus.c0m/hvml.htm.
`“Routing Information Protocol”, Hedrick, C., Jun. 1988,
`http://www.internic.net/rfc/rfc1058.txt, pp. 1—30.
`“An Experimental Multiple—Path Routing Algorithm”,
`Mills, D.L., Mar.
`1986,
`http://www.internic.net/rfc/
`rfc981.txt, pp. 1—20.
`“A Border Gateway Protocol (BGP)”, Lougheed et al., Jun.
`1990, http://www.internic.net/rfc/rfcl163.txt, pp. 1—26.
`“Host Extensions for IP Multicasting”, S. Deering, Aug.
`1989, http://www.internic.net/rfc/rfcl112.txt, pp. 1—16.
`“Distance Vector Multicast Routing Protocol”, Waitzman et
`al., NOV. 1988, http://www.internic.net/rfc/rfc1075.txt, pp.
`1—22.
`
`“The DARPA Internet Gateway”, Hinden et al., Sep. 1982,
`http://www.internic.net/rfc/rfc823.txt, pp. 1—41.
`
`* cited by examiner-
`
`000002
`
`
`
`000002
`
`

`

`m
`
`1B0
`
`u...now.ErllmnawSNuIHIIIIIIIIIIIU.em
`
`m,moEoEm.12.;_aa.”-4E.2fl.4.
`
`Inn._____mvmm_mm__t___aze_r.lllllllllllllllllllall.IIm15Em.“_P.555_w.a___"mszz
`2.528n_.Ilululullllllllll
`
`r.3502.Emsmzoov
`p__523w_A8u42rIIIIIIIII
`
`mm>mmm
`
`6883.m52%;.m1mm.
`a25255;Dmwon.xmogmz<533s355:
`0.3:“.awwo0Qm
`
`u.un2,m\sam6"I."ns..
`m,a,fie:N.
`
`a.aA.....oUm,Da,a,“.mmmm882
`
`szmmpz__~
`
`m
`
`000003
`
`
`

`

`US. Patent
`
`Apr. 10, 2001
`
`Sheet 2 0f 16
`
`US 6,215,790 B1
`
`OPERATING SYSTEM
`
`11
`
`PR
`
`DOMAIN NAME
`I
`A P
`OCESS N763 P LICATION
`
`COMM--
`REC-REG.
`
`75
`
`TRANSLATION
`TABLES
`
`81
`\
`
`40>
`
`'
`
`
`
`
`NAME-IP
`
`|
`77\..q'
`
`.
`
`|POINTERS
`
`POINTERS
`
`TRANSLATION
`RESULTS
`
`79
`
`REPLY
`TRANSMISSION
`
`'P ADDR- H
`
`FIG. 2
`
`000004
`
`000004
`
`

`

`US. Patent
`
`Apr. 10, 2001
`
`Sheet 3 0f 16
`
`US 6,215,790 B1
`
`RECEIVE DN
`
`TRANSL. QUERY
`
`LOOK-UP TABLE
`
`TRANSLATION
`
`S1
`
`$2
`
`
`
`S3
`
`ACCESS
`
`RCR
`
`QUERY PRIMARY
`DESTINATION
`
`86
`
`
`
`
`
`
`
`
`
`
`
`
`OUTPUT ALT.
`DEST. ADDR.
`
`39
`
`OUTPUT PRIMARY
`
`DEST. ADDR.
`
`TRANS. REPLY
`
`w/ DEST. ADDR.
`
`FIG. 3
`
`000005
`
`000005
`
`

`

`.b2,6
`
`7,
`
`1
`
`BIwvor.
`
`US. Patent
`
`A
`
`x228
`
`8
`
`D.
`
`3052930:
`
`833533
`
`Sim
`
`
`
`eh0sa\25“.mDTawrwma5:5m.a2v8&0m,m:mE
`6320:;9.5:.3-20:na5.2.8MDx8202\wm........-.\........-._._w_.q_._mo....
`
`
`E.x228N:
`
`000006
`
`
`
`

`

`US. Patent
`
`Apr. 10, 2001
`
`Sheet 5 0f 16
`
`US 6,215,790 B1
`
`
`IS-41
`
`FIG.5
`
`000007
`
`000007
`
`

`

`US. Patent
`
`Apr. 10, 2001
`
`Sheet 6 0f 16
`
`US 6,215,790 B1
`
`RECHVETRANS
`
`QUERY
`
`S1
`
`LOOK-UP TABLE
`TRANSLATION
`
`82
`
`s4 ~° F'G- 6A
`
`S3
`
`
`
`YES
`
`ACCESS
`RCR
`
`S5
`
`QUERY
`DESTINATIONS
`
`$6
`
`EW'4‘liiig§..>
`
`NO
`
`89
`
`YES
`
`YES
`
`31® YES
`
`1
`
`REPORTTO S12
`
`CALLER
`
`m S13
`
`N0
`
`0 0
`
`00008
`
`000008
`
`

`

`US. Patent
`
`Apr. 10, 2001
`
`Sheet 7 0f 16
`
`US 6,215,790 B1
`
`
`
`SEND ADDR.
`
`OF TERM 1
`
`317
`
`SEND RING T0
`
`
`
`BOTH
`TERMINALS
`
`
`S14
`
`SEND STATUS
`MESSAGE
`
`S1
`
`5
`
`$16
`
`TERM 1
`
`TERM2
`
`
`
`TO CALLER
`
`$20
`
`SEND
`DISCONTINUE
`MESSAGE
`
`TERMINAL 1
`INITIATES
`LINK
`
`S18
`
`821%
`
`CALLING TERM.
`COMPLETES
`
`LINK
`
`S19
`
`000009
`
`000009
`
`

`

`US. Patent
`
`Apr. 10, 2001
`
`Sheet 8 0f 16
`
`US 6,215,790 B1
`
`.8535won
`
`
`
`“m.60.2cm6ugsgmmm22250
`
`mac:
`
`3mm25:
`
`20.2E
`
`33ux26w
`
`oso
`
`52.3”.
`
`
`
`Us.22502883.2
`
`35:52
`
`3mm235
`
`oz
`
`$>
`
`$28
`
`20359:
`
`m=mo
`
`
`
`omcoammm28m
`
`mmm2$382
`
`
`€20835wE8:355
`
` 55225=88cozm:_E._8.9:325
`
`gases»mwm
`
`5555.5=8
`
`63.355
`
`<5.OE
`
`wo>
`
`“m:32.83m
`
`“am52:58
`
`$22:2523
`
`2:5as
`
`.528328:$82
`
`2653.2.23QO
`
`
`
`$55230$55523
`
`.320
`
`mczmséfl28501:8
`
`
`
`uozmo‘;83882mwm
`
`
`
`Alazov.oz8:2:me
`
`
`
`299.622.._z<8280ammw
`
`.3525
`
`won.a£52
`20wmoD02
`
`2886
`
`.9502
`
`:8
`
`@5389;
`
`000010
`
`000010
`
`
`
`
`
`
`
`
`
`
`
`

`

`US. Patent
`
`Apr. 10, 2001
`
`Sheet 9 0f 16
`
`US 6,215,790 B1
`
`E2822ow:25m
`
`amm:5:$32202
`
`3:5a;mom.228m
`
`22222ava2“am289ES“.
`
`ems.ucom
`
`
`
`counseboh92.322seaomtovcmfi
`
`£200223B328%.:E8
`
`358%55.225:38355.3mmw
`
`6%ch
`
`85m
`
`082..29.:
`
`553m$2.
`
`E.07.
`
`oz
`
`0:812ac:
`
`cozsw83
`
`mm>
`
`m.$3
`
`2:83am829rose262team
`
`.822:5sz
`
`:ozm:_E._m._.=8
`
`
`
`.0220322.9.6205
`
`0528:562
`
`cozsm8mmuse:
`
`
`
`@23252:52;ham282853$«25w5%
`
`scams.5:3Bcozmsehmp
`
`.32083.8E358%
`
`scam:5=8“22,28haw
`c2855
`
`000011
`
`
`
`
`
`3:5as“am2mammmmzowcoammmucmm
`
`000011
`
`
`
`
`
`
`
`
`
`
`

`

`US. Patent
`
`Apr. 10, 2001
`
`Sheet 10 0f 16
`
`US 6,215,790 B1
`
`
`
`
`
`«6382mmcoawom2mm
`
`
`
`958:2.mow.2ozso:
`
`
`
`o_nm__m>m=:“0%chwon.
`
`
`
`wmcoamom$5552
`
`$vam_>mww2gamma:
`
`
`
`hocozmsebmh9.325
`
`
`
`.39083.3E“0286:.5:52a5:8
`
`=momBmEEEHmww
`
`
`
`“.285555.225
`
`95885022ucmw
`
`Us.:5:855oz
`
`n528xomm
`
`2:252.3:5a;1mm2mom.22.822%
`
`99:922=360:31:03.5;
`cozmséfl.
`
`scams.5:3$3555..mww
`8588
`
`oz
`
`ham2ES:28
`
`3:5a;
`
`won2=80:6”.
`
`85:82E68ch
`
`828mm9.6:02
`
`A23:28ESE
`
`35m.36ch
`
`000012
`
`
`
`
`
`mass.$53.8low.
`
`oz
`
`33chwon.2
`
`wm_nm__m><
`
`mo>
`
`
`
`2:86.:ace202ES.
`
`@5235EBb=3m=m><
`
`23:283:5
`
`
`
`
`
`$8823:8QO3mm
`
`000012
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`US. Patent
`
`Apr. 10, 2001
`
`Sheet 11 0f 16
`
`US 6,215,790 B1
`
`m.__mOs_
`
`.Io..._>>w
`
`mo_u_n_o
`
`oom
`
`mm>mmw
`
`Emsazoov
`
`mm
`
`Hmzmm._.z_
`
`wmwoo<
`
`mm>mww
`
`55$93?.
`
`éoamzE3
`
`RpmzmMst
`
`.Ezmmhz.
`
`wmmoo<
`
`mw>mwm
`
`000013
`
`000013
`
`
`
`
`
`
`

`

`
`
`US. Patent
`
`Apr. 10, 2001
`
`Sheet 12 0f 16
`
`US 6,215,790 B1
`
` mm>mmw
`
`mmpnomvrm
`
`m.
`
`o:EEMH92
`S8Ro
`
`mm/
`
`25
`
`
`
`mm>mmm
`
`Ammpzmzoo.
`
`
`
`m§<z225.00
`
`000014
`
`000014
`
`
`
`

`

`U.
`
`m-I-....{HIIIII-J
`
`___
`
`3:55.BnPunt___e__mnnm§5.23:w_games:__E.e:w__5:5.0“5:902““523m
`.b__may<292,un56nwasa:ni=5mu539:nEs:I.____.......................I3528nm:Euna3:82:2:
`7,““25:22.23“22.53Es
`.5385255.S.352:5:.30—.GE
`SEE—5:2.$2:0mm“2252222u“mafia:E:w,m§“3mm9.2:mnnu.52:2:2:22A“mamas:_u.3.5553::__:2:.......................I-_2._Ea:
`
`“Inl-llllIIIIIIL"flcom2.2:P$552253
`tn“358Im_Illll
`mmwasmm3382IMuC:5""225.2228:23:
`
`
`22:
`
`000015
`
`
`

`

`tneton”
`
`U.sg<8:é
`
`.omméwxma
`
`1B097a512,6SU
`
`FF.mv_¢
`
`.29
`
`88mm
`
`cos.2:E59.
`
`6
`
`1E58.
`
`m258-zfi
`aEzmmxmm6
`
`m8:3:<8:mmmm>mmwxxxxxxw,55>$8.2moo:
`r.3%88mm88mm
`ms:<0
`
`
`
`
`
`
`
`8.23:28.8.22:zom.
`
`000016
`
`
`
`

`

`U
`
`r..
`
`w,
`
`w
`
`1
`
`M:3$58
`
`238228
`
`
`
`mm_‘~_.wzo_._.<o_z:_>=200m.n:
`
`t5016
`
`:55;m“62;.8t.
`on”$59.LE@VS”U
`
`5,83"mama
`
`fl,.__<s_HmzmmkaMmo_o>n=Eo._.
`
`Bn0NFOE
`
`U33mmowv
`.m$.anan.23.mE202Em82W
`Ba%m<838.23:
`
`E25w
`
`0
`
`000017
`
`
`

`

`US. Patent
`
`Apr. 10, 2001
`
`Sheet 16 0f 16
`
`US 6,215,790 B1
`
`CALLER DIALS
`
`800 NUMBER
`
`S1
`
`SSP DETECTS
`TRIGGER
`
`SSP QUERIES
`ISCP
`
`32
`
`33
`
`NO
`
`84
`
`YES
`
`INSTRUCTION TO GET
`RCR ID AND
`RETRIEVE
`
`511
`
`
`
`
` ISCP SENDS RCR ID
`TO IP WITH INSTRUCTION 3-,
`
`TO RETRIEVE RCR &
`PROCESS CALL
`
`
`
`
`
`EXCHANGE WITH
`CALLER GETS
`RCR ID
`
`312
`
`Ip RETRIEVES
`RCR FROM DNS
`
`SEND TO RESOURCE
`MESSAGES
`
`SS
`
`SSP ROUTES
`TO IP
`
`86
`
`IP EXCHANGE WITH
`
`
`
`CALLER RE DBIRED
`
`
`CHANGES
`
`
`IP EDITS RCR
`& RETURNS T0
`DNS
`
`$8
`
`$9
`
`510
`
`FIG. 13
`
`000018
`
`000018
`
`

`

`
`
`US 6,215,790 B1
`
`1
`AUTOMATIC CALLED PARTY LOCATOR
`OVER INTERNET WITH PROVISIONING
`
`RELATED APPLICATIONS
`
`This application a continuation-in-part of application Ser.
`No. 08/811,714, filed Mar. 6, 1997, entitled “Automatic
`Called Party Locator Over
`Internet”, which is a
`continuation-in-part of application Ser. No. 08/812,075,
`filed Mar. 6, 1997, entitled “Enhanced Internet Domain
`Name Server,” and is related to application Ser. No. 08/,
`811,032, filed Mar. 6,1997, entitled “Internet Phone to PSTN
`Cellular/PCS System.” Those applications are incorporated
`herein by reference in their entirety.
`
`TECHNICAL FIELD
`
`This invention relates to Internet telephony, and more
`specifically relates to establishing an Internet
`telephony
`connection to a called party who may be located at any one
`of a number of potential stations or who may be mobile.
`Acronyms
`The written description uses a large number of acronyms
`to refer
`to various services and system components.
`Although known, use of several of these acronyms is not
`strictly standardized in the art. For purposes of this
`discussion, acronyms therefore will be defined as follows:
`Action Control Point (ACP)
`Advanced Intelligent Network (AIN)
`Advanced Services Platform (ASP)
`Authentication Center (AC)
`Base Station (BS)
`Cellular Subscriber Station (CSS)
`Common Channel Inter-office Signaling (CCIS)
`Domain Name Server (DNS)
`Dual Tone Multifrequency (DTMF)
`Data and Reporting System (D&RS)
`Equipment Identity Register (EIR)
`Home Location Register (HLR)
`Integrated Service Control Point (ISCP)
`Intelligent Peripheral (IP)
`Internet Protocol (IP)
`Local Access and Transport Area (LATA)
`Local Exchange Carrier (LEC)
`Low-Power Self Contained Cell (LPSC)
`Mobile Identification Number (MIN)
`Mobility Controller (MC)
`Mobile Switching Center (MSC)
`Mobile Telephone Switching Office (MTSO)
`Overhead Message Train (OMT)
`Personal Base Station (PBS)
`Personal Communication Service (PCS)
`Plain Old Telephone Service (POTS)
`Private Branch Exchange (PBX)
`Private Automatic Branch Exchange (PABX)
`Public Switched Telephone Network (PSTN)
`Routing Control Record (RCR)
`Service Control Point (SCP)
`Service Management System (SMS)
`Service Switching Point (SSP)
`Signaling Transfer Point (STP)
`Station Message Detail Recording (SMDR)
`
`5
`
`10
`
`15
`
`20
`
`25
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`2
`
`Service Creation Environment (SCE)
`Telephone Company (TELCO)
`Temporary Local Directory Number (TLDN)
`Transaction Capabilities Applications Protocol (TCAP)
`Transport Control Protocol (TCP)
`Transport Control Protocol/Internet Protocol (TCP/IP)
`Utilize Generic Data Interface (GDI)
`Visitor Location Register (VLR)
`Wireless Private Branch Exchange (WPBX)
`BACKGROUND ART
`
`Being readily available for telephone contact has become
`increasingly important for a growing number of people who
`have a significant need to be reachable regardless of their
`location. Many such persons have a telephone for business,
`a telephone for home, a mobile cellular telephone in the car,
`a transportable telephone for personal wear, as well as
`stations providing telephone service through computers.
`Business people and professionals at times have multiple
`offices and may additionally work at a home office. All of
`these telephones and computer stations generally have dif-
`ferent
`telephone numbers and Internet addresses. This
`requires a caller to know or look up multiple numbers and
`addresses, and frequently to make multiple calls in order to
`reach a person.
`While there are several telephone equipment features and
`telephone company services designed to ease the problem of
`multiple telephone numbers,
`they do not solve all such
`problems. For example, call forwarding provides call redi-
`rection from one telephone to another. However, once the
`subscriber activates call forwarding, he or she cannot answer
`the primary telephone until
`the feature is deactivated.
`Additionally, calls can only be forwarded to one telephone,
`so that the user must know where he or she is going to be in
`order to forward calls effectively. Without remote activation,
`subscribers must turn on call forwarding from their primary
`telephone.
`to solve this problem requires the
`A second attempt
`addition of expensive customer premises equipment con-
`nected to the primary telephone and either a second tele-
`phone line or three-way calling. In this system, when a call
`comes in, the system sets up a three-way call to a pre-
`programmed telephone number, and either simultaneously
`alerts the attached telephone and the remote telephone or
`alerts the remote telephone after a predetermined number of
`rings. The system determines whether the attached tele-
`phone or the remote telephone answers first. If the attached
`telephone answers first, the system terminates the connec-
`tion to the remote telephone.
`If the remote telephone
`answers first, the system bridges the incoming call to that
`telephone or, for three-way calling, simply drops off the
`connection. This system is limited in the number of other
`telephones that may be alerted, and involves installing and
`programming customer premises equipment that occupies
`space at or near the customer’s telephone, and requires an
`additional line or coordination with three-way calling.
`The complexity of the problem has recently increased in
`that a significant number of such persons now desire to be
`available not only via the public telephone network but also
`by Internet telephony through personal computer stations as
`well as public telephone network stations or terminals.
`While multicasting is known in the Internet the methodology
`generally relies upon routing protocols based on a distance-
`vector (sometimes also called path-vector) routing scheme
`such as that used in IDRP (Inter-Domain Routing Protocol):
`
`000019
`
`
`
`000019
`
`

`

`
`
`US 6,215,790 B1
`
`3
`
`Routing Information Protocol (RIP), as described by C. L.
`Hedrik in “Routing Information Protocol”, RFC 1058
`(Request
`for Comments), NIC (Network Information
`Center), June 1988.
`Hello Routing Protocol, disclosed by D. L. Mills in
`“Experimental Multiple Path Routing Algorithm”, RFC 981,
`NIC, March 1986.
`(BGP), described by K.
`Border Gateway Protocol
`Lougheed and Y. Rekhter in “Border Gateway Protocol
`(BGP)”, RFC 1163, NIC, June 1990.
`Gateway-Gateway Protocol (GGP), as disclosed by R. M.
`Hinden and A. Sheltzer in “DARPA Internet Gateway”, RFC
`823, NIC, September 1982.
`IP multicast algorithms have been developed primarily for
`use with the Routing Information Protocol as disclosed by C.
`L. Hedrik, cited above, but are usable with the other
`distance-vector routing algorithms as well.
`IP multicast
`algorithms (see, e.g., S. E. Deering and D. R. Cheriton, cited
`above; S. E. Deering: “Host Extensions for IP Multicasting”,
`RFC 1112, NIC, August 1988; L. Hughes and P. Thomlin-
`son: “A Multicast Internetwork Routing Algorithm”. Pro-
`ceedings of the IFIP WG 6.4 Conference on High Speed
`Networking, 18—22 March 1991, Berlin, pp. 183—200; D.
`Waltzman, C, Partridge, and S. E. Deering: “Distance Vector
`Multicast Protocol”, RFC 1075, NIC, November 1988) are
`all variants of the Reverse Path Broadcasting algorithm
`described by Y. K. Dalai and R. M. Metcalfe in “Reverse
`Path Forwarding of Broadcast Packets”, Communications of
`the ACM, Vol. 21, No. 12, pp. 1040—1048, ACM, December
`1978. This algorithm is similar to the LAN multicast algo-
`rithm in that a spanning tree is used to distribute the
`multicast packets, however, it contains additional features to
`solve some of the problems associated with LAN multicast-
`ing. In brief,
`the algorithm works as follows (see S. E.
`Deering and D. R. Cheriton, cited above, for a more detailed
`description):
`1. Multicast packets are initially broadcast to all subnet-
`works in the internetwork. Packets are broadcast on a
`
`least-cost spanning tree. When a router receives a multicast
`packet from some source “S”, it knows that it is on the
`spanning tree for multicasts originating from S if its routing
`tables indicate that it can reach node S with a lower cost than
`
`all other routers attached to a given subnetwork (this infor-
`mation is available in the normal IP routing tables). If so,
`that router forwards the multicast packets on the subnetwork
`in question. It was shown by S. E. Deering and D. R.
`Cheriton, cited above,
`that
`this algorithm results in the
`multicast packet being distributed to each subnetwork in the
`internetwork with minimum cost.
`
`An obvious improvement of this scheme compared to the
`LAN multicasting schemes is that while here the multicast
`spanning tree is fixed for a given source, it is not the same
`for all sources. Thus multicast traffic is distributed over
`
`many different paths in the network.
`2. In order to avoid broadcasting multicast packets to
`subnetworks that do not have members in the specified
`group, a scheme is used whereby routers that receive a
`multicast for a particular group that do not lie on a branch
`of the multicast tree that leads to any members of that group
`discard the multicast (there is obviously no need to forward
`it) and report to the predecessor in the multicast tree that this
`branch of the tree may be pruned. This process begins with
`routers attached to “leaf subnetworks” (subnetworks that are
`at the end of their respective branches of the tree), and works
`its way up the branch as far as possible to restrict
`the
`distribution of multicast traffic to where it is required.
`
`10
`
`15
`
`20
`
`25
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`4
`The IP multicast schemes have the following drawbacks:
`Initially, multicasts from a given source to a given group
`must be broadcast to the entire internet until the multicast
`
`tree for that source-destination pair is pruned.
`The scheme requires that information used for pruning the
`multicast trees be discarded after some time so that new
`
`members that join the network on a previously pruned tree
`branch will eventually start receiving the multicasts. Thus,
`multicasts trees are continuously rebuilt and repruned, cre-
`ating considerable overhead on the network links and pro-
`cessing nodes.
`Multicast trees exist for each source-multicast group pair.
`That is, a separate logical multicast tree exists for each
`different source that multicasts to a given group. Jelco
`routing nodes may have to maintain an extremely large
`database for pruned multicast trees.
`For these reasons such protocols or algorithms seem
`unsuitable for use in the MPTN and similar architectures. A
`
`useful algorithm should be able to utilize the routing capa-
`bilities of gateways which have no multicast intelligence.
`In general the above-described multicasting systems for
`use in the Internet are designed to deliver a specific message
`to a predetermined and specified number of destinations.
`The methodologies and systems employed do not
`lend
`themselves to economic and efficient use for solving the
`problem of establishing connection with one called party
`who may or may not be located at any one of a number of
`specified destinations or who may be mobile.
`BACKGROUND PATENT LITERATURE
`
`In the telephone network environment US. Pat. No.
`5,506,887, issued Apr. 9, 1996,
`to Mark J. Emery, et al.
`entitled “Personal Communications Service Using Wireline/
`Wireless Integration,” describes a personal communications
`service which allows a user to send and receive calls from
`
`a single portable handset using a single assigned number
`whether at home or roaming. The system and method
`described provides a mechanism for interfacing the capa-
`bilities of a land line telephone system with a radio link
`communication system, using a land line Advanced Intelli-
`gent Network
`The methodology provides centralized control of call
`processing by both telephone central office switching sys-
`tems and wireless mobility controllers based on call pro-
`cessing data associated with individual subscribers stored in
`a central service control point, or data base, within the
`telephone network. This centralized call processing control
`can provide call routing to either a land line or a wireless unit
`via a mobility controller, in response to calls directed to a
`single number. The system can also extend special services
`normally provided to land lines by the telephone central
`office switches to any line of the system designated by
`subscriber registration and to mobile units operating in the
`wireless portion of the network. Thus, the system allows the
`individual user to control the delivery of telecommunica-
`tions services to meet their personal life style and to virtually
`any geographic location, covered by the network, to which
`the user roams.
`
`The integrated wired and wireless communication net-
`work includes communication lines and a central office
`
`switching system connected to communication lines selec-
`tively providing switched communication connections
`between the communication lines. A mobility controller
`selectively provides wireless communications to and from
`mobile communication units. Communication trunks inter-
`
`connect the central office switching system and the mobility
`
`000020
`
`
`
`000020
`
`

`

`
`
`US 6,215,790 B1
`
`5
`controller, and the mobility controller selectively provides
`switched communications between the communication
`trunks and wireless mobile communication units. A network
`
`controller, separate from the central office switching system
`and the mobility controller, stores call processing data for
`subscribers who are associated with one of the communi-
`
`cation lines connected to the central office switching system
`and for subscribers associated with one of the mobile
`
`communication units. Call processing by both the central
`office switching system and the mobility controller to estab-
`lish a completed communication link is controlled in
`response to the stored call processing data associated with at
`least one of the subscribers.
`
`In one aspect, this arrangement provides a method by
`which the integrated system recognizes calls directed to an
`assigned subscriber number and accesses data stored in the
`central network controller to determine a line to a switching
`system or a mobility controller at which the subscriber last
`registered.
`The programmability of the subscriber’s service data
`within the network controller allows the subscriber to design
`call screening procedures to selectively route certain calls to
`other termination points, such as a voice mailbox. As
`another example, the system could provide a voice prompt
`asking certain callers if they are willing to pay for toll
`charges through long distance lines or for air time through
`the wireless part of the network. The system would complete
`the call only if the caller dialed in digits indicating assent to
`such charges and would add the charges to the caller’s bill.
`The system also allows a subscriber to specify points to
`route calls to if the line and/or mobile communication unit
`are busy, for example to a different station such as might be
`assigned to a secretary. The arrangement also provides
`several systems for adding or modifying subscriber data
`stored in the central network controller’s data base.
`
`The system also includes method and apparatus for con-
`ducting registration procedures to inform the central net-
`work controller where the subscriber currently is located. A
`wireless base unit connected to a telephone line registers
`with the mobile communication unit when the mobile unit
`
`comes within range, and the base unit automatically dials
`and informs the central network controller of the registra-
`tion. Similarly, when the portable unit first registers with a
`mobility controller, the mobility controller informs the net-
`work controller of the new registration.
`When the system includes two central service controllers,
`often referred to as ISCPs, the methodology provides special
`procedures for exchange of data between the central con-
`trollers so that switching systems and mobility controllers
`communicate only with the central controller in their area.
`This prevents transmission of call processing instructions
`from a remote service controller to a switching system or
`mobility controller which might cause errant operation.
`Preferably the system designates the central controller or
`ISCP in the subscriber’s home region as the source of that
`subscriber’s Home Location Register (HLR) data. Also,
`each of the central controllers is set up to include Visiting
`Location Register (VLR) capability. When a subscriber
`traveling in a region other than his home region registers
`with a central controller outside her home region, through
`either a telephone registration procedure or a mobility
`controller registration procedure,
`that central controller
`establishes a VLR for that visiting subscriber. When switch-
`ing systems or mobility controllers in the visited area need
`data regarding the visiting subscriber, they access the VLR
`in the central controller within that area.
`
`10
`
`15
`
`20
`
`25
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`6
`Wireline network approaches to the problem include the
`following:
`US. Pat. Nos. 4,611,094 and 4,611,096 both to Asmuth et
`al. disclose a system for providing custom incoming tele-
`phone call processing services to a corporate customer
`operating at geographically dispersed locations through a
`plurality of local office switches. A customer program stored
`in a central data base is accessed to provide instructions to
`the switches to complete incoming calls to customer loca-
`tions in accord with special services defined by the corporate
`customer. Incoming calls to the customer are routed to an
`Action Control Point (ACP) which typically is a modified
`toll office. The ACP has a number of “primitive” call
`processing capabilities, such as providing voice prompts to
`callers and receiving additional caller inputs. The customer
`program controls the ACP’s to string together the desired
`primitive call processing capabilities to process each call to
`the customer. Specified parameters stored in the program,
`such as time of day, caller location and data inputs respon-
`sive to the voice prompts, determine the final customer
`station to which each call should be completed. The cus-
`tomized call processing disclosed by Asmuth et al. can also
`include customized billing for calls, e.g., by splitting charges
`between the customer and the caller. The Asmuth et al.
`
`system sets up a billing record for each call in the ACP or
`toll office. Asmuth et al. also teach procedures for handling
`of calls directed to a corporate customer when the call
`serving office does not have all of the capabilities needed for
`processing the call in accordance with the customer’s stored
`program. In particular, upon recognition of the deficiencies
`of the call serving office, the Asmuth et al. system transfers
`call processing to a second office having adequate capabili-
`ties for completion of the call.
`US. Pat. No. 4,788,718 issued Nov. 29, 1988, to Sandra
`D. McNabb et al. suggests centralized recording of call
`traffic information. The architecture is similar to that dis-
`
`closed by the earlier discussed patents to Weber and Asmuth
`et al. to the extent that local and toll offices communicate
`with a central data base via CCIS link. The McNabb et al.
`
`system improves over the incoming call routing provided by
`the Weber patent and the two Asmuth et al. patents discussed
`above by adding a data gathering function to the centralized
`data base which stores the individual customer’s call routing
`program. In McNabb et al. the central data processor pro-
`vides call attempt records and a traffic data summary of all
`calls directed to a particular 800 number.
`US. Pat. No. 4,313,035 issued Jan. 26, 1982, to David S.
`Jordan et al. patent discloses a method of providing a person
`locator service through multiple exchanges of the switched
`telephone network. Each subscriber is assigned a personal
`number uniquely identifying the subscriber. An absent sub-
`scriber inputs a number to which calls are to be completed,
`such as the number where the subscriber can be reached, into
`a central data base. A caller wishing to reach the subscriber
`dials the number uniquely identifying that subscriber. In
`response to an incoming call directed to the unique number,
`a telephone switching office having access to CCIS sends the
`dialed number to the central data base referred to by Jordan
`et al. as an SSP. The data base retrieves the stored comple-
`tion number for the called subscriber and forwards that
`
`number back to the switching office to complete the call. The
`subscriber can update the stored data from any telephone.
`Also, the subscriber can specify whether to charge calls via
`the person locator system to the subscriber or to the caller.
`US. Pat. No. 4,899,373 issued Feb. 6, 1990, to Chinmei
`Lee et al. discloses a system for providing special telephone
`services to a customer on a personal basis, when the cus-
`
`000021
`
`
`
`000021
`
`

`

`
`
`US 6,215,790 B1
`
`7
`tomer is away form his or her home base or office. A
`nationally accessible data base system stores feature data in
`association with personal identification numbers. A sub-
`scriber wishing to use personalized features while away
`from home base dials a special code from a station con-
`nected to any exchange which has access to the