为Linux服务器更新静态路庄

有些校园网服务器（例如代理服务器）通过双网卡分别连接Cernet和其他ISP,以便于用户访问网络资源。这些服务器上配置的路由策略是：凡是去往Cernet的流量都从Cernet接口转发出去,其他的流量都转发到默认网关（即经非Cernet接口转发）。作为Cernet的会员单位,     

一种基于Trie的快速IP路由查找算法

Internet的飞速发展要求核心路由器能够实现快速的分组转发和路由更新功能,实现这一功能的关键是路由表的组织结构和快速的路由查找算法.提出了带有转发域信息树的多分支Trie结构路由查找算法,它由固定步长的多分支Tile结构的路由表和转发域信息树两部分组成.对于一个长度为w的路由前缀,其查找、插入、删除路由的时间复杂度均为O((w-m)/n+1),其中m、n为Trie树的步长.它解决路由查找过程中快速更新的问题,具有算法简单、查找速度快、易于更新、空间利用率高、便于向IPv6过渡等优点.     

路由策略与策略路由的具体应用

路由策略是路由发布和接收的策略,是使用某些策略改变规则,影响路由发布,接收或者路由选择的参教而改变路由发现的结果。策略路由技术是对传统路由技术的扩展和改进,基于策略的路由比传统路由使用更灵活,不仅能够根据目的地址,而且能够根据报文大小、应用或IP源地址来选择转发路径。     

无线传感器网络贪婪转发策略中的路由空洞问题

贪婪转发策略是无线传感器网络中基于地理位置的路由算法中非常重要的一种,但是该算法会遭遇到路由空洞问题。该文从理论上分析了路由空洞在规则部署和随机部署情况下的存在概率,并得出了随机部署情况下随机建立的路径会遭遇到路由空洞的概率。通过分析可以得出,当网络中节点的平均邻居数大于10时,利用带有退避改进方法的贪婪转发策略足以满足无线传感器网络的需要。     

IP策略路由实现的负载均衡

所谓IP策略路由,顾名思义,就是根据一定的策略进行IP报文转发,因此策略路由是一种比目的路由更灵活的路由机制。在路由器转发一个IP数据报文时,首先根据配置的策略规则对报文进行过滤,匹配成功则按照一定的转发策略进行报文的转发。这种策略规则可以基于标准和扩展访问控制列表,也可以基于报文的长度;而转发策略则是控制报文按照指定的策略路由表进行转发。     

MANET中一种具有能量意识的无信标地理路由算法

 地理路由具有有效的传输性能和良好的可扩展能力,是当前移动Ad Hoc网络路由算法中的一个研究热点. 在许多实际场合下,网络中的节点能量有限并且难以补充,所以合理调整节点之间的能量消耗成为提高网络寿命的一种重要手段. 本文针对贪婪转发和空洞解决方案中存在的节点能量消耗不平衡的问题,提出了一种具有能量意识的无信标地理路由算法EBGR (Energy-Aware and Beaconless Geographic Routing). 该算法包括两个模式：贪婪竞争策略和空洞解决策略. 在贪婪竞争策略中,源节点或中继节点（即上游节点）广播数据包,位于数据包转发域内具有最小动态转发延迟的节点（即下游节点）转发数据包,其余候选节点侦听到该广播包后,自动放弃转发该数据包. 当遇到节点空洞时,将角度和能量信息同时加入到转发节点的动态延迟计算中,从而在数据包转发过程中有效地避绕空洞和平衡节点间的能量消耗. 仿真结果表明,与已有的BLR和GEAR等典型地理路由算法相比,平均投递率提高2%到4%;平均网络寿命提高了10%到20%.     

车载自组织网络RBVT-R协议的改进

分析了基于地理位置的路由协议RBVT-R.针对RBVT-R协议在路由建立过程及分组转发过程中的缺陷,提出了一种RBVT-R协议的改进算法.该算法在路由建立过程中,根据自主获取的道路车辆密度改进了RBVT-R协议的洪泛机制;在分组转发过程中采用基于方向和位置预测的转发方法,解决了分组在同一路段重复传输的问题.仿真结果表明,提出的改进策略有效地提升了分组的交付率与端到端平均时延.     

基于拓扑感知时间时序的动态路由策略

针对当前网络路由策略存在的不足,提出一种基于拓扑感知时间时序的动态网络路由策略.首先在分析了当前网络路由策略基础,在网络拓扑发生变化时,计算节点对拓扑变化感知时间,然后根据感知时间构建数据转发的路由表,最后根据路由表节点序列建立动态路由查找策略,并采用仿真模拟实验对其性进行验证.实验结果表明,拓扑感知时间时序的动态路由策略可以真实地反映网络拓扑变化对路由影响,提高了网络路由的模拟效率,具有广泛的应用前景.     

基于策略路由的校园网多出口解决方案

介绍了如何利用策略路由实现校园网与CERNET、Internet的多出口互联原理和具体配置，从而使网络流量按照网络管理制定的标准进行报转发，达到合理利用网络资源、节约网络费用的目的。     

城市场景车载Ad Hoc网络竞争转发关键参数分析

 论文对城市场景下的基于竞争转发的车载Ad hoc网络路由算法进行了分析,该分析对于确定竞争转发策略中节点定时器的值具有重要的意义,是竞争转发路由策略的有益和重要的补充.论文给出了保证抑制策略以一定概率执行成功的条件下,节点定时器参数的下限值.仿真和分析结果的对比验证了本文分析的有效性.     

Understanding the impact of loyal user behaviour on Internet access pricing: a game-theoretic framework

In this paper, we investigate the impacts of user behaviour—user loyalty in particular—on pricing strategies of Internet Service Providers (ISPs) for a profitable yet sustainable Internet access marketplace. We carry out an extensive empirical analysis of customer loyalty issues of ISP markets including our own survey in the Hungarian ISP market. Based on the empirical results, we propose a realistic user loyalty model, the price difference dependent loyalty model. Next, we apply the loyalty model in game-theoretical framework where optimal Internet access pricing strategies are expressed. Our game-theoretic framework includes both short-term and long-term interaction cases (single-shot and repeated games, respectively) and is capable of dealing with uncertain as well as dynamic scenarios (Bayesian and Stackelberg games, respectively). Finally, we present the impacts of user loyalty on the prices and profits of ISPs in different scenarios based on simulation results.     

"互联网+回收"行业的发展研究分析

本文以互联网+回收为研究背景,分析传统回收行业存在的问题,探讨了互联网回收行业的现状与未来发展所面临的机遇和挑战,并对此提出了相应的发展策略.     

Multi-Layer Differentiated Integrated Survivability for Optical Internet

In this paper, we study the problem of multi-layer integrated survivability (MLIS) for efficiently provisioning reliable traffic connections of arbitrary bandwidth granularities in the integrated optical Internet. We decompose the MLIS problem into three sub-problems: survivable strategies design (SSD), spare capacity dimensioning (SCD), and dynamic survivable routing (DSR). First, a review of network survivability in multi-layer IP/WDM networks is provided. Then, multi-layer survivability strategies are proposed and it is observed how these strategies could be applied to the integrated optical Internet architecture. We also present an enhanced integrated shared pool (ISP) method for solving the static MLIS problem (i.e., the SCD sub-problem) and the priority-based integer programming formulations are also given. Moreover, we design a novel scheme called the differentiated integrated survivability algorithm (DISA) to solve the dynamic MLIS problem (i.e., the DSR sub-problem), which employs flexible survivable routing strategies according to the priority of the traffic resilience request. Performance simulation results of DISA show that our adaptive survival schemes perform much better in terms of traffic blocking ratio, spare resource requirement, and average traffic recovery ratio compared with other solutions in the optical Internet.     

Measuring the size of the Internet via importance sampling

Measuring the size of the Internet via Monte Carlo sampling requires probing a large portion of the Internet protocol (IP) address space to obtain an accurate estimate. However, the distribution of information servers on the Internet is highly nonuniform over the IP address space. This allows us to design probing strategies based on importance sampling for measuring the prevalence of an information service on the Internet that are significantly more effective than strategies relying on Monte Carlo sampling. We present thorough analysis of our strategies together with accurate estimates for the current size of the Internet Protocol Version 4 (IPv4) Internet as measured by the number of publicly accessible web servers and FTP servers.     

Recruitment and Retention for Community‐Based eHealth Interventions with Populations of Low Socioeconomic Position: Strategies and Challenges

Given persistent communication inequalities, it is important to develop interventions to improve Internet and health literacy among underserved populations. These goals drove the Click to Connect project, a community‐based eHealth intervention that provided novice computer users of low socioeconomic position with broadband Internet access, training classes, a Web portal, and technical support. In this article, we describe the strategies used to recruit and retain this population, the budgetary implications of such strategies, and the challenges and successes we encountered. Results suggest that personal contact between study staff and participants and provision of in‐depth technical support were central to successful recruitment and retention. Such investments are essential to realize the promise of eHealth with underserved populations.     

Survey on Mobility and Multihoming in Future Internet

Mobility and multihoming represent key challenges for the development of the current and Future Internet, especially because of the rapid increase of user mobility and network heterogeneity. Both issues, mobility and multihoming, are closely related to each other and mainly issues of the used IP addressing scheme. This survey presents a general overview on approaches that enable mobility and multihoming in Future Internet; it focuses especially on approaches that suggest using new addressing schemes on layer 3, namely Locator/ID Separation and Core/Edge Separation, in order to tackle mobility and multihoming issues in an integrated manner. In our survey, we present a classification of the investigated approaches and summarize the main solution strategies. Furthermore, we evaluate the investigated approaches on basis of their capabilities and technical properties. On basis of the evaluation, where we emphasize the benefits and shortcomings of current solution strategies, we discuss future research issues related to mobility and multihoming.     

Cooperation and end‐to‐end in the Internet

This paper analyzes the motivation and strategies for ensuring cooperative behavior among hosts and customer networks in the Internet and 5G networks. The hypothesis is that better cooperation among the benevolent entities could improve the overall Internet welfare, motivating the need for adoption of cooperative security. However, in state of the art, the prevalent security approach in the Internet is based on self‐help, while the adoption of cooperative methods is progressing slowly. At the same time, the ubiquitous reliance on 5G and mission critical nature of some of the new services, for example, ultrareliable (machine‐to‐machine) communication and Internet of things, requires that 5G will do its best to curb the malicious (noncooperative) behavior from becoming a cause of failure to the legitimate services. In this paper, we relate our analysis of the conditions for sustainable cooperation in the Internet with the famous end‐to‐end principle, and present the hypothesis that there is no end‐to‐end solution to the problem of ensuring cooperation among Internet hosts. Game theory allows studying the outcomes of interactions among the players with conflicting interests. We use it to study the hypothesis and show that introducing the reputation of Internet nodes and customer networks can lead to cooperation, which improves the overall Internet welfare and reduces the payoffs of malicious actors. We study the possible response of noncooperative users with advanced defection strategies and the resulting outcomes. We argue that 5G shall make significant progress towards uprooting the selfish behavior and malicious activities using cooperation and relate it with motivation for providing ubiquitous connectivity and ultrareliable services. The paper concludes by summarizing our earlier work on the application of the proposed methods of cooperation to 5G and the Internet; outlining how cooperation in security is not only desirable but also feasible.     

纵观全局,发展自我—谈因特网在中国的发展

中国的因特网应根据自己的实际情况因地制宜地发展，采取的措施措施包括协调发展因特网和电信网、寻找发展因特网业务的新切入点、重视网络安全性及加快制订发展因特网的策略等。     

Network design methods for mitigation of intentional attacks in scale-free networks

Network robustness and network reliability are important issues in the design of Internet Service Providers’ topologies. In this paper, we examine the structural characteristics of network topologies that affect robustness and reliability. We examine the interplay between the structural characteristics of network topologies and the resource capacity over-provisioning strategies when the network breakdowns subject to practical constraints (router technology) and economic considerations (link costs). We study the robustness of the Internet connectivity under node intentional harmful attack using two attacks strategies: static degree-based and static load-based. We find that the robustness of network topologies is affected by the variation of their structural characteristics. In our proposed approach, we show that highly-heterogeneous topologies have less robustness compared with lightly-heterogeneous topologies. The observations from the robustness study provide us useful insights for proposing multiple efficient preventive resource capacity over-provisioning strategies for mitigation of intentional attacks. The proposed strategies utilize the structural properties by calculating the excess traffic in case of single global cascading failure for each node and measure its influence on the other nodes as well as locally. The results show that our proposed strategies can significantly enhance the robustness and increase the resilience of network topology. We also show that highly-heterogeneous topologies have high resilience compared with lightly-heterogeneous topologies. By using real data from the Sprint network at the router level, we provide further empirical evidence in support of the proposed approach.     

复杂网络与可扩展路由

互联网规模扩大,相应路由表大小呈指数增加,形成下一代互联网可扩展路由“瓶颈”。基于复杂网络和可扩展路由的相关理论与主要策略,文章对相关研究成果。如小世界效应所表现出来的特性、小世界和无标度网络模型,网格、层次及隐藏度量等3种可扩展路由网络模型,随机游走、贪婪、最大度、优先、本地介数、距离与度及相似性与度混合等多种路由策略等进行了分析与归纳。这些研究结果和方法为因互联网规模不断扩大所带来的路由系统可扩展性问题提供解决方案