作者: Aditya Akella , Ashwin Bharambe , Suman Nath , Srinivasan Seshan
DOI: 10.21236/ADA461192
关键词: Computer science 、 Destination-Sequenced Distance Vector routing 、 Service discovery 、 Distributed computing 、 Interior gateway protocol 、 Communications protocol 、 Distance-vector routing protocol 、 Routing protocol 、 Routing domain 、 Computer network 、 Link-state routing protocol
摘要: Abstract : Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within narrow range operating conditions. This rigid design renders these inefficient in the face widely varying environments or conditions different from ones for which optimized. Such uni-modal have great dificulty mobile computing world where conditions, including number nodes, computational capabilities and rate mobility, not fixed. Consider, example, routing ad-hoc nodes. Solutions like DSDV work when nodes is small. Unfortunately, such schemes scale poorly larger population sizes. In situations, more scalable impose structure on manner similar Internet, provides better results. However, tend incur high overheads situations handles well. Clearly, no solution all node may encounter. Motivated by examples, this paper attempts answer following question: Is it possible redesign traditional take very modes faced with environments? We present case multi-modal our paper. Specifically, we discuss reliability routing. show feasibility designing describing how can make mode decisions switch without additional overhead.