A Two-Time-Scale Design for Edge-Based Detection and Rectification of Uncooperative Flows

Existing Internet protocols rely on cooperative behavior of end users. We present a control-theoretic algorithm to counteract uncooperative users which change their congestion control schemes to gain larger bandwidth. This algorithm rectifies uncooperative users; that is, forces them to comply with their fair share, by adjusting the prices fed back to them. It is to be implemented at the edge of the network (e.g., by ISPs), and can be used with any congestion notification policy deployed by the network. Our design achieves a separation of time-scales between the network congestion feedback loop and the price-adjustment loop, thus recovering the fair allocation of bandwidth upon a fast transient phase     

802.11WLAN中一种基于循环队列的分布式公平队列调度算法

该文在无线局域网现有的802.11 MAC层访问机制的基础上,运用循环队列的思想提出了一种完全分布式的队列调度算法,该算法通过修改802.11的MAC层中的DCF(Distributed Coordination Function)子协议,实现了在分布式环境下控制802.11节点的公平访问无线链路资源的目的。文中通过仿真对算法进行了分析和研究,仿真结果表明该方法可以在一定范围内实现公平队列调度。     

DQDB+-/: a fair and waste-free media access protocol fordual bus metropolitan networks

A media access protocol that achieves a fair distribution of the bandwidth in one round-trip delay is presented. The protocol is based on a unique solution to a fair and waste-free bandwidth allocation. This bandwidth allocation can be implemented in a distributed manner. A comparison of the new protocol with the DQDB (distributed queue dual bus) protocol shows considerable advantages regarding the transmission delay of messages and the time a station needs to obtain a fair portion of the available bandwidth. The advantages of the protocol become more apparent for large networks and high transmission speeds. In addition, the new protocol can perform nonuniform bandwidth allocations     

基于PPV的公平移动支付协议

结合CEMBS的设计思想,在尽量满足移动网络特性的情况下,设计了一个能在移动终端观看视频服务的即看即付的公平协议.该协议在服务请求阶段通过利用CEMBS,在乐观情况下,可信第三方移动网络运营商不需参与,就可使互不信任的User与VASP完美地实现双方的认证与会话密钥协商,同时完成了服务请求的建立,双方均是不可否认的,且整个过程只需三条消息;在支付阶段,也可以保证双方公平地进行交易.通过分析,该协议满足公平性、不可否认、原子性、认证性以及保密性等一些必备性质,且协议比较简单,应用范围比较广泛.     

Sequential Coordination Function for Throughput and Fairness Enhancement of Wireless LANs

High throughput and fair resource sharing are two of the most important objectives in designing a medium access control (MAC) protocol. Currently, most MAC protocols including IEEE 802.11 DCF adopt a random access based approach in a distributed manner in order to coordinate the wireless channel accesses among competing stations. In this paper, we first identify that a random access?Cbased MAC protocol may suffer from MAC protocol overhead such as a random backoff for data transmission and a collision among simultaneously transmitting stations. Then, we propose a new MAC protocol, called sequential coordination function (SCF), which coordinates every station to send a data frame sequentially one after another in a distributed manner. By defining a service period and a joining period, the SCF eliminates unnecessary contentions during the service period, and by explicitly determining the sequence of frame transmission for each stations, it reduces collision occurrences and ensures fairness among stations in the service period. The performance of SCF is investigated through intensive simulations, which show that the SCF achieves higher throughput and fairness performances than other existing MAC protocols in a wide range of the traffic load and the number of stations.     

Increasing fairness and efficiency using the MadMac protocol in ad hoc networks

The IEEE 802.11 MAC layer is known for its unfairness behavior in ad hoc networks. Introducing fairness in the 802.11 MAC protocol may lead to a global throughput decrease. It is still a real challenge to design a fair MAC protocol for ad hoc networks that is distributed, topology independent, that relies on no explicit information exchanges and that is efficient, i.e. that achieves a good aggregate throughput. The MadMac protocol deals with fairness and throughput by maximizing aggregate throughput when unfairness is solved. Fairness provided by MadMac is only based on information provided by the 802.11 MAC layer. MadMac has been tested in many configurations that are known to be unfair and compared with three protocols (IEEE 802.11 and two fair MAC protocols). In these configurations, MadMac provides a good aggregate throughput while solving the fairness issues.     

Defending against distributed denial-of-service attacks with max-min fair server-centric router throttles

Our work targets a network architecture and accompanying algorithms for countering distributed denial-of-service (DDoS) attacks directed at an Internet server. The basic mechanism is for a server under stress to install a router throttle at selected upstream routers. The throttle can be the leaky-bucket rate at which a router can forward packets destined for the server. Hence, before aggressive packets can converge to overwhelm the server, participating routers proactively regulate the contributing packet rates to more moderate levels, thus forestalling an impending attack. In allocating the server capacity among the routers, we propose a notion of level-k max-min fairness. We first present a control-theoretic model to evaluate algorithm convergence under a variety of system parameters. In addition, we present packet network simulation results using a realistic global network topology, and various models of good user and attacker distributions and behavior. Using a generator model of web requests parameterized by empirical data, we also evaluate the impact of throttling in protecting user access to a web server. First, for aggressive attackers, the throttle mechanism is highly effective in preferentially dropping attacker traffic over good user traffic. In particular, level-k max-min fairness gives better good-user protection than recursive pushback of max-min fair rate limits proposed in the literature. Second, throttling can regulate the experienced server load to below its design limit - in the presence of user dynamics - so that the server can remain operational during a DDoS attack. Lastly, we present implementation results of our prototype on a Pentium III/866 MHz machine. The results show that router throttling has low deployment overhead in time and memory.     

Energy-Efficient Scheduling for Wireless Sensor Networks

We consider the problem of minimizing the energy needed for data fusion in a sensor network by varying the transmission times assigned to different sensor nodes. The optimal scheduling protocol is derived, based on which we develop a low-complexity inverse-log scheduling (ILS) algorithm that achieves near-optimal energy efficiency. To eliminate the communication overhead required by centralized scheduling protocols, we further derive a distributed inverse-log protocol that is applicable to networks with a large number of nodes. Focusing on large-scale networks with high total data rates, we analyze the energy consumption of the ILS. Our analysis reveals how its energy gain over traditional time-division multiple access depends on the channel and the data-length variations among different nodes.     

SWFA: a new buffer management mechanism for TCP over ATM-GFR

We investigate packet discarding schemes for transport control protocol (TCP) over asynchronous transfer mode with guaranteed frame rate service. In this letter, we propose the selective weighted fair allocation (SWFA) scheme, which discards packets from selected sessions. 15 TCP connections with equal minimum cell rate (MCR) and unequal MCRs are simulated. The SWFA scheme with per-virtual connection (VC) queuing is compared with early packet discard (EPD) with first-in, first-out queuing, EPD with per-VC queuing, and differential fair buffer allocation with per-VC queuing. Our results show that SWFA with per-VC queuing achieves significant enhancement on throughputs, goodputs, and fairness.     

Fairness constrained diffusion adaptive power control for dense small cell network

Small cell is an emerging and promising technology for improving hotspots coverage and capacity, which tends to be densely deployed in populated areas. However, in a dense small cell network, the performances of users differ vastly due to the random deployments and the interferences. To guarantee fair performance among users in different cells, we propose a new distributed strategy for fairness constrained power control, referred to as the diffusion adaptive power control (DAPC). DAPC achieves overall network fairness in a distributed manner, in which each base station optimizes a local fairness with little information exchanged with neighboring cells. We study several adaptive algorithms to implement the proposed DAPC strategy. To improve the efficiency of the standard least mean square algorithm (LMS), we derive an adaptive step-size logarithm LMS algorithm, and discuss its convergence properties. Simulation results confirm the efficiency of the proposed methods.     

A Fair and QoS-Aware Resource Allocation Scheme in UWB WPANs with WiMedia Distributed MAC

Merits of distributed medium access control specified by WiMedia Alliance such as distributed nature and high data rate make it a favorite candidate standard for high rate wireless personal area network. However, the current WiMedia MAC standard has not considered supporting Quality of Service (QoS) even though QoS parameters such as a range of service rates are provided to each traffic stream (TS). Therefore, we propose a fair and QoS-aware resource allocation method that provides a fair and maximized QoS for all TSs according to the current traffic load condition and differentiates SoQ among different QoS classes while guaranteeing fairness of SoQ within a QoS class in a fully distributed manner. Even in case that the traffic load varies, each device independently recognizes the changes and calculates fair and maximum allowable service rates for TSs. From the simulation results, it is proven that the proposed method achieves high capacity of TSs and fair QoS provisioning under various traffic load conditions.     

Start-time fair queueing: a scheduling algorithm for integratedservices packet switching networks

We present a start-time fair queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze its single server and end-to-end deadline guarantee for variable rate fluctuation constrained (FC) and exponentially bounded fluctuation (EBF) servers. To support heterogeneous services and multiple protocol families in integrated services networks, we present a hierarchical SFQ scheduler and derive its performance bounds. Our analysis demonstrates that SFQ is suitable for integrated services networks since it: (1) achieves low average as well as maximum delay for low-throughput applications (e.g., interactive audio, telnet, etc.); (2) provides fairness which is desirable for VBR video; (3) provides fairness, regardless of variation in server capacity, for throughput-intensive, flow-controlled data applications; (4) enables hierarchical link sharing which is desirable for managing heterogeneity; and (5) is computationally efficient     

Scheduled WiFi using distributed contention in WLANs: algorithms,experiments, and case-studies

The ubiquitous adoption of WiFi introduces large diversity in types of application requirements and topological characteristics. Consequently, considerable attention is being devoted to making WiFi networks controllable without compromising their scalability. However, the main MAC protocol of WiFi, distributed coordination function (DCF), is a contention-based protocol using random backoff. Thus, operating under DCF, the access of channel is hard to control and nonpredictable. In order to provide controllability of channel access in WiFi, we propose Rhythm, a MAC protocol that achieves scheduled WiFi efficiently using distributed contention. By achieving scheduled WiFi, channel access can be controlled by manipulating the schedule decision. We evaluate the performance of Rhythm through analysis, experiments, and case-studies.     

Fair data collection in wireless sensor networks: analysis and protocol

In general, wireless sensor networks (WSNs) consist of many sensors which transmit data to a central node, called the sink, possibly over multiple hops. This many-to-one data routing paradigm leads to nonuniform traffic distribution for the different sensors (e.g., nodes closer to the sink transfer more traffic than those farther away). In this paper, we perform an analysis of the fairness issue by presenting a tree-based WSN and derive the throughput, delay, and energy distribution for each sensor under the fairness constraint. Based on the analysis, we design our fair data collection protocol in which each node decides its media access and packet forwarding strategies in a distributed manner. Finally, we demonstrate the effectiveness of our solution through simulations. The results for the proposed protocol show the accuracy of the analysis and show that the protocol ensures the fair delivery of packets and reduces end-to-end delay. Based on the analysis, we also quantitatively determine the energy required for each of the nodes and show that a nonuniform energy distribution can maximize the network lifetime for the WSN scenario under study.     

Terminal‐Assisted Hybrid MAC Protocol for Differentiated QoS Guarantee in TDMA‐Based Broadband Access Networks

This paper presents a terminal‐assisted frame‐based packet reservation multiple access (TAF‐PRMA) protocol, which optimizes random access control between heterogeneous traffic aiming at more efficient voice/data integrated services in dynamic reservation TDMA‐based broadband access networks. In order to achieve a differentiated quality‐of‐service (QoS) guarantee for individual service plus maximal system resource utilization, TAF‐PRMA independently controls the random access parameters such as the lengths of the access regions dedicated to respective service traffic and the corresponding permission probabilities, on a frame‐by‐frame basis. In addition, we have adopted a terminal‐assisted random access mechanism where the voice terminal readjusts a global permission probability from the central controller in order to handle the ‘fair access’ issue resulting from distributed queuing problems inherent in the access network. Our extensive simulation results indicate that TAF‐PRMA achieves significant improvements in terms of voice capacity, delay, and fairness over most of the existing medium access control (MAC) schemes for integrated services.     

Self-coordinating localized fair queueing in wireless ad hoc networks

Distributed fair queueing in a multihop, wireless ad hoc network is challenging for several reasons. First, the wireless channel is shared among multiple contending nodes in a spatial locality. Location-dependent channel contention complicates the fairness notion. Second, the sender of a flow does not have explicit information regarding the contending flows originated from other nodes. Fair queueing over ad hoc networks is a distributed scheduling problem by nature. Finally, the wireless channel capacity is a scarce resource. Spatial channel reuse, i.e., simultaneous transmissions of flows that do not interfere with each other, should be encouraged whenever possible. In this paper, we reexamine the fairness notion in an ad hoc network using a graph-theoretic formulation and extract the fairness requirements that an ad hoc fair queueing algorithm should possess. To meet these requirements, we propose maximize-local-minimum fair queueing (MLM-FQ), a novel distributed packet scheduling algorithm where local schedulers self-coordinate their scheduling decisions and collectively achieve fair bandwidth sharing. We then propose enhanced MLM-FQ (EMLM-FQ) to further improve the spatial channel reuse and limit the impact of inaccurate scheduling information resulted from collisions. EMLM-FQ achieves statistical short-term throughput and delay bounds over the shared wireless channel. Analysis and extensive simulations confirm the effectiveness and efficiency of our self-coordinating localized design in providing global fair channel access in wireless ad hoc networks.     

Airtime Fairness for IEEE 802.11 Multirate Networks

Under a multirate network scenario, the IEEE 802.11 DCF MAC fails to provide airtime fairness for all competing stations since the protocol is designed for ensuring max-min throughput fairness. As such, the maximum achievable throughput by any station gets bounded by the slowest transmitting peer. In this paper, we present an analytical model to study the delay and throughput characteristics of such networks so that the rate anomaly problem of IEEE DCF multirate networks could be mitigated. We call our proposal time fair CSMA (TFCSMA) which utilizes an interesting baseline property for estimating a target throughput for each competing station so that its minimum contention window could be adjusted in a distributed manner. As opposed to the previous work in this area, TFCSMA is ideally suited for practical scenarios where stations frequently adapt their data rates to changing channel conditions. In addition, TFCSMA also accounts for packet errors due to the time varying properties of the wireless channel. We thoroughly compare the performance of our proposed protocol with IEEE 802.11 and other existing protocols under different network scenarios and traffic conditions. Our comprehensive simulations validate the efficacy of our method toward providing high throughput and time fair channel allocation.     

DQDB networks with and without bandwidth balancing

It is explained why long distributed queue dual bus (DQDB) networks without bandwidth balancing can have fairness problems when several nodes are performing large file transfers. The problems arise because the network control information is subject to propagation delays that are much longer than the transmission time of a data segment. Bandwidth balancing is then presented as a simple solution. By constraining each node to take only a certain fraction of the transmission opportunities offered to it by the basic DQDB protocol, bandwidth balancing gradually achieves a fair allocation of bandwidth among simultaneous file transfers. Two ways to extend this procedure effectively to multipriority traffic are proposed     

基于对的组密钥协商协议及其分析

在Shim(2003)的基于证书的三方密钥协商协议的基础上提出了一个基于对的组密钥协商协议。通过在密钥生成函数中引入伪随机数,防止了未知密钥共享攻击(the unknown key-share attack)和已知密钥攻击。给出了当前文献中已知的一些攻击方法,并证明这些攻击方法在此协议中是无效的。同时此协议具有前向安全和后向安全的特性,即在动态组的情况下协议仍是安全的。     

一种基于适应度函数遗传算法的公平交换协议自动生成方法

基于现有协议自动生成方法无法直接用于公平交换协议,我们对Clark Jacob方法进行了扩展,针对公平交换协议的设计空间特征,获得公平性判定模型,模型引入通信信道类型编码,并将主体拥有集合和主体信念集合相分离来完成协议生成过程中消息的衍生和目标的判定,指出公平性包含的局部目标和全局目标,利用基于适应度函数的遗传优化算法,对用二进制表示的协议空间进行优化搜索,获得满足目标的协议,并通过实例说明文中方法的可行性.