Duba wurin da ke ƙasa sannan ka amsa tambayar daga baya a cikin harshe ɗaya kamar yadda wurin yake:  Passage: Open Shortest Path First (OSPF) an tsara shi azaman yarjejeniya ta ƙofar ciki (IGP), don amfani dashi a cikin tsarin mai zaman kansa kamar cibiyar sadarwar gida (LAN). Yana aiwatar da algorithm na Dijkstra, wanda aka fi sani da gajeriyar hanyar farko (SPF) algorithm. A matsayin hanyar haɗin hanyar haɗin yanar gizo, ya dogara ne akan hanyar haɗin yanar gizon da aka haɓaka don ARPANET a 1980 da kuma yarjejeniyar IS-IS. OSPF an fara daidaita shi a cikin 1989 a matsayin RFC 1131, wanda yanzu aka sani da OSPF version 1. Ayyukan ci gaba don OSPF kafin a tsara shi azaman daidaitaccen buɗewa an ɗauka da yawa daga Kamfanin Kayan Kayan Dijital, wanda ya haɓaka ƙa'idodin DECnet na mallakar kansa. Ka'idojin jagora kamar OSPF suna lissafin mafi ƙarancin hanya zuwa manufa ta hanyar hanyar sadarwa bisa ga algorithm. Ka'idar farko da aka fara amfani da ita, RIP, ta lissafa hanya mafi guntu bisa ga hops, wato adadin hanyoyin da IP ɗin ya bi don isa ga mai masaukin da aka nufa. RIP ya samu nasarar aiwatar da tsarin tafiyar da aiki, inda teburin tafiyarwa ke canzawa idan yanayin cibiyar sadarwa ya canza. Amma RIP bai daidaita hanyarsa ba bisa ga sauye-sauyen yanayin cibiyar sadarwa, kamar saurin watsa bayanai. Buƙatar ta haɓaka don ƙa'idar ƙa'idar ƙaura mai ƙarfi wanda zai iya lissafin hanya mafi sauri zuwa manufa. An haɓaka OSPF ta yadda za a ƙididdige mafi ƙarancin hanya ta hanyar hanyar sadarwa bisa ga farashin hanya, la'akari da faɗin bandwidth, jinkiri da kaya. Saboda haka OSPF ya ɗauki lissafin farashin hanya bisa ga sigogin haɗin haɗin haɗin, wanda mai gudanarwa zai iya auna shi. OSPF da sauri aka soma saboda ya zama da aka sani ga dogara lissafi hanyoyi ta hanyar manyan da kuma hadaddun gida yankin networks.As a link jihar routing yarjejeniya, OSPF kula link jihar databases, wanda suke da gaske cibiyar sadarwa topology maps, a kan kowane na'ura mai ba da hanya tsakanin hanyoyin sadarwa a kan abin da aka aiwatar. Yanayin hanyar da aka bayar a cikin hanyar sadarwa ita ce kudin, kuma OSPF algorithm yana ba kowane mai ba da hanya tsakanin hanyoyin sadarwa damar yin lissafin farashin hanyoyin zuwa kowane...  Tambaya: Mene ne sunan na'ura mai ba da hanya tsakanin hanyoyin sadarwa da ke kula da haɗin kai?
mai ba da hanya tsakanin hanyoyin sadarwa (ABR)