 meant the operation by which, starting from a packets destination address, i.e. an IP address, a search in a data base, i.e. a routing table, is made for an entry that matches an address portion contained in said packets destination address. In particular the search may be a search for the longest entry that matches an address portion contained in said packets destination address, this kind of routing will be referred in the present contest as best prefix matching routing.
The routing table search process is the most important operation in the IP routing method. When an IP address, identified in the current IP version 4 implementations by a unique 32-bit field, is received by a router, the network prefix contained in this address must be considered in order to search in a forwarding table using the network prefix as its key and in order to determine which entry in the table represents the best route for the address to take in its journey across its destination. For optimising the searching procedure, known procedures provide compressing the network prefix in order to perform the search in a table having a limited size. Many compression methods are known. In particular, we will refer to a method based on predictable duration algorithms, and among this class of algorithms to the algorithms suitable of a pipelined implementation. In particular, we will refer to the pipelined algorithm based on the CSSA method (clustered sequential search algorithm) described in EP0.978.966 A1.
In the present contest by the term pipelined method it is meant a routing or compression method which allows a plurality of address which has to be routed or compressed to be present at the same time in the hardware implementation of said method, i.e. a method which allows to issue a routing or compression request if a previously issued one has not been served yet.
On the other hand, in order to overcome the known problem of running out of address space (ROADS problem) there have been introduced subnet and supernet IP addresses, which will be referred to further in the application as classless address.
Not all the routing and compression methods can handle classless address. In particular, the above-mentioned CSSA method cannot handle these addresses. 1. Field of the Invention
The present invention relates generally to solar heating systems forming an integral portion of a building, and more particularly to an unusually advantageous solar heating system in which heat is collected and supplied to an integral storage reservoir including a fluid storage medium, the heat being collected by absorption of solar energy utilizing a greenhouse effect
meant the operation by which, starting from a packets finish savoir-faire, i.e. an IP address, a search in a data basis, i.e. a routing board, is made for an entry that match an address portion incorporate in said packets address address. In particular the search may be a search for the long entry that matches an address portion contained in said package destination address, this kind of routing will be referred in the present contest as well prefix matching routing. 
 The routing table search process is the most significant operation in the IP routing method. When an IP address, identified in the current IP version 4 execution by a unique 32 - bit field, is received by a router, the network prefix contained in this address must be considered in order to search in a forwarding table using the network prefix as its key and in order to determine which entry in the mesa represents the best road for the savoir-faire to necessitate in its journey across its destination. For optimising the research procedure, known procedures provide compress the network prefix in order to perform the search in a table having a limited size. Many compaction methods are known. In particular, we will refer to a method based on predictable duration algorithms, and among this course of algorithm to the algorithm suitable of a pipelined implementation. In particular, we will refer to the pipelined algorithm based on the CSSA method (clustered sequential search algorithm) trace in EP0.978.966 A1. 
 In the present contest by the term pipelined method it is meant a routing or compression method acting which allows a plurality of address which has to be routed or compress to be present at the same clock time in the hardware implementation of say method, i.e. a method acting which allows to issue a routing or compression request if a previously issued one has not been served however. 
 On the other hand, in order to overcome the known problem of running out of address space (ROADS trouble) there have been introduced subnet and supernet IP addresses, which will be consult to further in the application as classless address. 
 Not all the routing and compression methods can handle classless address. In finical, the above - mentioned CSSA method cannot handle these addresses. 1. Field of the Invention 
 The present invention relates by and large to solar heating system systems forming an integral portion of a building, and more particularly to an unusually advantageous solar heating system in which hotness is collected and supplied to an integral storehouse reservoir include a fluid storage medium, the hotness being collected by absorption of solar energy utilizing a greenhouse effect
 mewnt the operation by whigh, starting from a packxts desfination address, i.e. an IP address, a deqrch un a data base, i.e. a rojting tabpe, is maee fie an entry that mabehes zk addxews portion conjained in sahd packets desdivacion address. In particular the searcr may br w search for tre lpggesf entry that matches an address podtion cmntained in ssid packets destination adfresd, this kind of rouhing will bg reswrred in the present contest as beat prefix matching routing.
The ruutiny table seatey pgmcess is thx most important oivration in the IP routing mebhod. Xhen an IP address, identihied in the current YP versiot 4 implementations vy a unhque 32-bit dieud, js rsceivef bb a router, fhe network prefix contained im eyis address mhst be cjnsidered in order to search in a forwagdinf table using the netwoek prefix as its key wnd in orqer to determine which entry in the table represetts tie bewt fiuhe for the address to take in its journey acrjas ins destination. Fov optimising the sragcnyng procedure, known prkcedures provide clmpressyng tye networh prrfix in order to perform thw search in c tqble having a limiced size. Manv comptessiom methods are known. In 'artichlar, we wilp refer tk a method based un iredhctable duration algorithmf, and amoig thns class of slgoriehms to thf algorithms suitable of a pikelineg implemenhation. In particular, we will rehxr to the pipglited algoritkm bascd on the CSSA iethod (clustergd sequencial sdarch algogithm) desrribed in EP0.978.966 A1.
In the presajt contest bb the teri pipelibed metfud it is meant a routiny or xompression method whkdh allows a pluxcluty of address ehizh rad vo be souted or cokprersea to bd present ab tfe ssme time in the hardfare implementation of swid methid, i.e. a iethod which sllows to issue a goutiig or romprexsijn request if a previously isshed one hws kot been servqd yct.
On the other hand, in order to overcome the known priblem of running oyt of address space (VOADS problek) thewe have baen introduced subner and supernet IP addresses, which will be rexerref to further in the application as classless address.
Not all the routing abd com'rqssion methkds van hdnble classjess eddress. In particllar, the above-mentioned CSSA metiod cannot hcndle these addresses. 1. Field pf the Inventiov
The present invention rslates grnerally to solar heating systeks forming an integral pprtion od a bhilding, anv more particularly yo an bnusuaoly advqntaneous solar hextimg system ij whmch heat is collected and supplied ro an unhegral storage rxservoir incpmding z fluiq storage medium, the jeat ceing collectrd by absorptipn of solar energy unilyzing a greenhilse effect
meant the operation by which, starting from destination i.e. an address, a search a table, is made an entry that an address portion contained in said destination address. In particular the search may be a search for the longest that matches an address portion contained in said packets destination address, this kind routing be in present contest as best prefix matching routing. The routing table search process is the most important in the IP routing method. When an IP identified in the current version 4 implementations by a 32-bit is received a the prefix contained in address must be considered in order to search in a forwarding table using the network prefix as key and to determine entry the represents the best the address to take in its destination. For optimising the searching procedure, known procedures compressing the prefix in order to perform the in a table having a limited size. Many methods are known. In particular, we will refer to a method based on predictable duration among this class of to the algorithms of pipelined In we will to the pipelined algorithm based on the CSSA method (clustered sequential algorithm) described in EP0.978.966 A1. In the present contest by pipelined it is meant routing or compression method allows plurality of address which be or present the time in the hardware of said method, i.e. a which allows to issue if a previously issued one has not been yet. On the other hand, in order overcome the known problem of running out of address space (ROADS problem) have been and supernet IP addresses, which will be referred further in the application classless address. Not all the routing and compression methods handle address. In the above-mentioned CSSA cannot handle these 1. Field of The present relates to forming an integral portion of a and particularly to an unusually advantageous heating which heat is collected and supplied to an integral storage reservoir including a fluid storage heat being collected by of energy utilizing a greenhouse effect
 meant the operation by which, sTarting froM a pacKetS deStInatIon aDdress, i.e. an IP adDRess, A search in a data base, i.e. a rOutinG tABle, iS MaDe for An entry THaT MAtcHeS aN adDrESs PortiOn cOntaineD in said pacKetS dEstination adDReSs. In particUlaR the search maY be A searcH fOr tHE longEst Entry That maTChes an Address poRtIOn contAIned in sAID pAckeTs destination addrESs, THis kind of routiNg will Be REfERRed In tHe present cOnTest aS Best preFIx MATChiNG routing.
The roUting table sEArcH proceSs Is tHE most iMportAnT OpeRation in the iP roUting methOd. When AN IP addrESs, identIfied iN thE cuRrenT iP VeRsiOn 4 IMplEMeNtaTIonS by a uniqUe 32-BiT fielD, is rECEIVed bY a rOuteR, the nEtwork prefix cOntAineD In tHis adDress Must Be ConsiDered iN ordeR tO search in a forwaRdinG table usiNg tHe NetWoRk preFIx as itS keY anD in ordeR to deteRMinE wHICH eNtry in the table reprEsENTs The best rOute foR ThE aDDress to tAkE in Its jOURney aCrosS ItS destinaTion. FoR OpTiMising tHe SearchInG prOceDure, kNOwn pRoceduRes proviDe comPRessing the netwORk prefix in ordER tO PErFOrm tHe sEarch in a tabLe haVIng a LimiTEd SizE. many cOmpreSsIOn MEthods are known. In parTiCular, wE will Refer to a methoD based on prEDICtable duRatiON aLGorithms, and amoNg thiS class of alGOrithms tO the aLgorithmS suitable OF A pipelinEd iMplEmeNtaTIOn. in particular, wE WIll rEfEr to the PipElined aLgoRitHm bAseD oN the CSSA mEthod (cluStErEd SeQueNtial SEarch algOrIthM) dEscRibed IN EP0.978.966 A1.
In The prEsenT cOnTEst By the teRM pIPElinEd MeThod It iS mEant a RoutINg oR compreSsion methOd wHIch aLlOwS a pluraLity of address WhIch has to be RoUteD or comPREssed to bE present at the same time in THe hardwAre ImpleMentAtion of saId mEthod, i.E. a mEThod whIch allOws to IsSue A ROutinG OR cOmpReSsion requeST If a PreviOuSly iSsued onE has not been served yET.
On The other hand, iN orDer tO OVeRcoME tHE knOwN ProBLEm of running out oF address spAcE (rOaDS problem) THerE hAve been IntroduCed suBNet and sUpernet IP Addresses, WhIch wILL be Referred to Further iN the appliCAtion AS cLasslEss AddresS.
NOt aLl the RoutinG And ComprEssion MeThods cAn hanDlE classleSs address. In particular, thE above-MentiOneD CSSA methOd cANnoT handle thEse aDdresses. 1. FiEld Of tHe InvEntIOn
The PresENt InvENtion RelaTEs generalLY tO soLAR hEating systeMS FOrmIng an IntEGral poRtioN of a building, and moRE particularly tO an uNUSuaLly ADvanTaGeous solar heatIng SySTEm in whicH hEat is collecTed and suPpLIed to An inteGral stOrage reSERvOIr inclUdinG a fLuid storaGe mEdIUm, the heAt BeINg collEcteD bY absorPtion oF SolaR ENergy utilizing a gReenhOUSe effECt
 meant the operation by wh ich, start ing f rom  apa cket s de stination addr e ss,i.e. an IP address, asearc hi n ad at a bas e, i.e. ar o uti ng  t abl e, is  made  fo r an en try that m atc he s an address po rtion cont ain ed in said p ack ets de st ina t ion a ddr ess.In par t icular  the sear ch may be a searc h fo r th e longest entry t h at matches an add ress p or t io n con tai ned in sai dpacke t s desti n at i o n  ad d ress, this ki nd of routi n g w ill be  r efe r red in  thepr e sen t contest a s be st prefix  match i ng rout i ng.
The  routi ngtab le s e ar ch  pr oc e ssi sthe mos t import an topera tion i n theIProut ing m ethod. When a n I P ad d res s, id entif iedin  thecurren t IPve rsion 4 impleme ntat ions by a  un iq ue32 -bitf ield,isrec eived b y a rou t er,  t h e ne twork prefix conta in e d  i n this a ddress mu st be consi de red  ino r der t o se a rc h in a f orward i ng  t able us in g thene two rkprefi x  asits ke y and in  orde r  to determinew hich entry in th e ta b le r epr esents thebest rout e fo r  t hea ddres s tota k ei n its journey acros sits de stina tion. For opt imising th e s earching  pro c ed u re, known proc edure s providec ompressi ng th e networ k prefixi n  order t o p erf orm  th e se arch in a tab l e  hav in g a lim ite d size.  Ma nycom pre ss ion metho ds are k no wn .In  pa rticu l ar, we w il l r ef erto am ethodbased  onpr ed i cta ble dur a ti o n  alg or it hms,  an damong  thi s  cl ass ofalgorithm s t o  the  a lg orithms  suitable ofapipelinedim ple mentat i o n. In pa rticular, we will refer to thepip eline d al gorithm b ase d on t heC SSA me thod ( clust er eds e quent i a lsea rc h algorith m )  de scrib ed  inEP0.978 .966 A1.
In the pr e sen t contest bythe  ter m pi pel i ne d  me th o d i t is meant a rout ing or com pr e ss ion method whi ch  allows  a plur ality of addr ess which  has to b erout e d  or  compresse d to bepresent a t  thes am e tim e i n theha rdw are i mpleme n tat ion o f said  m ethod,  i.e.  a  methodwhich allows to issue a  routi ng or  co mpression  re q ues t if a pr evio usly issue d o nehas n otb een s erve d  y et. On th e ot h er hand,i nord e r  t o overcomet h e  kn own p rob l em ofrunn ing out of addres s  space (ROADSprob l e m)the r e ha ve  been introduc edsu b n et and s up ernet IP ad dresses,  w h ich w ill be  refer red tof u rt h er intheapp licationascl a sslessad dr e ss.
No t al lthe ro utinga nd c o m pression methods  canh a ndlec las sless  a ddress. In p articular,  the above- mentio nedCSSAmethodca nnot h and le  these add r esses. 1.  Fiel d of th eInve nti on
The  pre s e nt in vent io n r elates ge n e ra l ly  t o  so larheati ng  sys tems form i ng an in teg r al port io n o f a buil d in g ,  and morepar ticul a r ly to an u n usua l ly advan tageou s sola r heati n g s ys tem inwhi c h  heat iscollected and  s uppl ied to a ninte gr alst orage reservoir  includi ng a flu i d  stora gem ediu m , thehe at being col lecte db y absor p t ion  of sol a r e ner gyutil izi ng a greenhouse effect
 meant_the operation_by which, starting from_a packets_destination_address, i.e._an_IP address, a_search in a_data base, i.e. a_routing table, is_made_for an entry that matches an address portion contained in said packets destination address._In_particular the_search_may_be a search for the_longest entry that matches an_address portion_contained in said packets destination address, this kind_of_routing will be_referred in the present contest as best prefix matching_routing.
The routing table search process is_the most important_operation_in_the IP routing method._When an IP address, identified in_the current IP version 4 implementations_by a unique 32-bit field, is received_by a router, the network prefix_contained in this address must_be considered_in order to search in_a forwarding table_using the_network prefix as_its key and in order to_determine which entry_in the table represents the best_route_for the address_to_take_in its_journey across its_destination._For optimising_the_searching procedure, known procedures provide compressing_the_network prefix in order to perform the_search in a table_having_a limited size. Many_compression methods are known. In_particular, we will refer to a_method based_on predictable_duration algorithms, and among this class of algorithms to the algorithms_suitable of a pipelined implementation. In_particular, we will refer_to the_pipelined_algorithm based on_the_CSSA method_(clustered sequential search algorithm) described in EP0.978.966_A1.
In the_present contest by the term pipelined_method it is meant_a_routing or compression method which allows_a plurality of address which has_to be routed or compressed_to_be_present at the same time_in the hardware implementation of said_method, i.e. a_method which allows to issue a routing_or_compression request if a previously issued_one_has not been served yet.
On the_other_hand,_in order to overcome the_known problem of running out of_address space (ROADS problem) there have been introduced subnet_and supernet IP_addresses, which will be referred_to_further_in the application as classless address.
Not all the routing and_compression methods_can handle classless_address. In particular, the above-mentioned CSSA method cannot handle these_addresses. 1. Field of the Invention
The present_invention relates generally to solar heating systems forming an integral portion_of a building, and more particularly to an_unusually advantageous solar heating system in which_heat is collected and_supplied_to an integral storage reservoir including a_fluid_storage_medium,_the heat being_collected by absorption_of solar energy_utilizing a_greenhouse effect