检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]复旦大学计算机科学与工程系,上海200433
出 处:《小型微型计算机系统》2004年第11期1934-1937,共4页Journal of Chinese Computer Systems
摘 要:在 Internet中有许多流向同一服务器的数据流 ,当前的单播、组播和任播等都无法很好的刻画它 .提出了一种连播路由模型 ,该模型在网络边缘将从多个源节点来的数据流用连播路由器聚集 ,形成较少的网络数据流 ,也就是减少了核心路由器一系列的查表、匹配、转换、封装 /解封装等复杂操作 ,从而简化了核心网络的计算 ,使通信量可以快速地通过核心路由器到达目的节点 .给出了一种实现连播的算法 ,并进行了分析 .实验结果表明 。There are much data traffic that flow to a server on the Internet, which is beyond the scope of unicast, multicast and anycast. In this paper, a model of joincast routing is presented to define these data flows. It joins these flows together at the edge of the Internet, so the complicated operations of lookup, matching, transforming, encapsulation/ decapsulation are reduced in the core routers. These flows can go through the core routers quickly and arrive at their destination for little computing in the center of networking. An algorithm of joincast is proposed and analysed in this paper. The experimental results also show that joincast causes less delay in the heavy traffic.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.13