http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Reliable Multicast with B.I.E.R.
Yoann Desmouceaux,Thomas Heide Clausen,Juan Antonio Cordero Fuertes,W. Mark Townsley 한국통신학회 2018 Journal of communications and networks Vol.20 No.2
Inter-network multicast protocols, which build and maintainmulticast trees, incur both explicit protocol signalling, andmaintenance of state in intermediate routers in the network. Bitindexedexplicit replication (B.I.E.R.) is a technique which can providea multicast service yet removes such complexities: intermediaterouters are unencumbered by group management, and no pergroupstate is to be maintained. This paper explores the use of B.I.E.R. as a basis for developingan efficient and reliable multicast mechanism, where redundanttraffic is avoided, essential traffic is forwarded along shortestpaths, and no per-flow state is required in intermediate routers. Evaluated by way of both an analytical model and network simulationboth in generic and in real network topologies with varyingbackground traffic loads, the proposed B.I.E.R.-based reliablemulticast mechanism exhibits attractive performance attributes: Itattains delivery success rates as high as any other reliable multicastservice, but with significantly better link utilisation and no per-flowor per-group state in intermediate routers of the network.
Fish Eye OLSR Scaling Properties
Adjih, Cedric,Baccelli, Emmanuel,Clausen, Thomas Heide,Jacquet, Philippe,Rodolakis, Georgios The Korea Institute of Information and Commucation 2004 Journal of communications and networks Vol.6 No.4
Scalability is one of the toughest challenges in ad hoc networking. Recent work outlines theoretical bounds on how well routing protocols could scale in this environment. However, none of the popular routing solutions really scales to large networks, by coming close enough to these bounds. In this paper, we study the case of link state routing and OLSR, one of the strongest candidates for standardization. We analyze how these bounds are not reached in this case, and we study how much the scalability is enhanced with the use of Fish eye techniques in addition to the link state routing framework. We show that with this enhancement, the theoretical scalability bounds are reached.