/pdf/convex-analysisnoer-san-nojin-zhan-nituite-5dl2rbmoyr.pdf

Convex Analysisの二,三の進展について

This survey provides a structured and comprehensive overview of research on security and privacy in computer and communication networks that use game-theoretic approaches. We present a selected set of works to highlight the application of game theory in addressing different forms of security and privacy problems in computer networks and mobile applications. We organize the presented works in six main categories: security of the physical and MAC layers, security of self-organizing networks, intrusion detection systems, anonymity and privacy, economics of network security, and cryptography. In each category, we identify security problems, players, and game models. We summarize the main results of selected works, such as equilibrium analysis and security mechanism designs. In addition, we provide a discussion on the advantages, drawbacks, and future direction of using game theory in this field. In this survey, our goal is to instill in the reader an enhanced understanding of different research approaches in applying game-theoretic methods to network security. This survey can also help researchers from various fields develop game-theoretic solutions to current and emerging security problems in computer networking.

/pdf/game-theory-meets-network-security-and-privacy-1r8g3nc948.pdf

Game theory meets network security and privacy

Peer-to-Peer (P2P) reputation systems are essential to evaluate the trustworthiness of participating peers and to combat the selfish, dishonest, and malicious peer behaviors. The system collects locally-generated peer feedbacks and aggregates them to yield the global reputation scores. Surprisingly, most previous work ignored the distribution of peer feedbacks. We use a trust overlay network (TON) to model the trust relationships among peers. After examining the eBay transaction trace of over 10,000 users, we discover a power-law distribution in user feedbacks. Our mathematical analysis justifies that power-law distribution is applicable to any dynamically growing P2P systems, either structured or unstructured. We develop a robust and scalable P2P reputation system, PowerTrust, to leverage the power-law feedback characteristics. The PowerTrust system dynamically selects small number of power nodes that are most reputable using a distributed ranking mechanism. By using a look-ahead random walk strategy and leveraging the power nodes, PowerTrust significantly improves in global reputation accuracy and aggregation speed. PowerTrust is adaptable to dynamics in peer joining and leaving and robust to disturbance by malicious peers. Through P2P network simulation experiments, we find significant performance gains in using PowerTrust. This power-law guided reputation system design proves to achieve high query success rate in P2P file-sharing applications. The system also reduces the total job makespan and failure rate in large-scale, parameter-sweeping P2P Grid applications.

/pdf/powertrust-a-robust-and-scalable-reputation-system-for-44t3i02ukd.pdf

PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing

Consider a discrete source producing a sequence of message letters from a finite alphabet. A single-letter distortion measure is given by a non-negative matrix (d ij ). The entryd ij measures the ?cost? or ?distortion? if letteriis reproduced at the receiver as letterj. The average distortion of a communications system (source-coder-noisy channel-decoder) is taken to bed= ? i.j P ij d ij whereP ij is the probability ofibeing reproduced asj. It is shown that there is a functionR(d) that measures the ?equivalent rate? of the source for a given level of distortion. For coding purposes where a leveldof distortion can be tolerated, the source acts like one with information rateR(d). Methods are given for calculatingR(d), and various properties discussed. Finally, generalizations to ergodic sources, to continuous sources, and to distortion measures involving blocks of letters are developed. In this paper a study is made of the problem of coding a discrete source of information, given afidelity criterionor ameasure of the distortionof the final recovered message at the receiving point relative to the actual transmitted message. In a particular case there might be a certain tolerable level of distortion as determined by this measure. It is desired to so encode the information that the maximum possible signaling rate is obtained without exceeding the tolerable distortion level. This work is an expansion and detailed elaboration of ideas presented earlier [1], with particular reference to the discrete case. We shall show that for a wide class of distortion measures and discrete sources of information there exists a functionR(d) (depending on the particular distortion measure and source) which measures, in a sense, the equivalent rateRof the source (in bits per letter produced) whendis the allowed distortion level. Methods will be given for evaluatingR(d) explicitly in certain simple cases and for evaluatingR(d) by a limiting process in more complex cases. The basic results are roughly that it is impossible to signal at a rate faster thanC/R(d) (source letters per second) over a memoryless channel of capacityC(bits per second) with a distortion measure less than or equal tod. On the other hand, by sufficiently long block codes it is possible to approach as closely as desired the rateC/R(d) with distortion leveld. Finally, some particular examples, using error probability per letter of message and other simple distortion measures, are worked out in detail.

Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959.

https://www-sop.inria.fr/members/Eitan.Altman/PAPERS/srvUpdate.pdf

A survey on networking games in telecommunications

Existing mobile systems (e.g., mobile IP, mobile ATM, and third-generation cellular systems) lack the intrinsic architectural flexibility to deal with the complexity of supporting adaptive mobile applications in wireless and mobile environments. We believe that there is a need to develop alternative network architectures from the existing ones to deal with the tremendous demands placed on underlying mobile signaling, adaptation management, and wireless transport systems in support of new mobile services (e.g., interactive multimedia and Web access). We present the design, implementation, and evaluation of mobiware, a mobile middleware toolkit that enables adaptive mobile services to dynamically exploit the intrinsic scalable properties of mobile multimedia applications in response to time-varying mobile network conditions. The mobiware toolkit is software-intensive and is built on CORBA and Java distributed object technology. Based on an open programmable paradigm developed by the COMET Group, mobiware runs on mobile devices, wireless access points, and mobile-capable switch/routers providing a set of open programmable interfaces and algorithms for adaptive mobile networking.

https://cs.dartmouth.edu/~campbell/papers/pcs1998.pdf

The mobiware toolkit: programmable support for adaptive mobile networking

This paper presents a decentralized auction-based approach to pricing of edge-allocated bandwidth in a differentiated services Internet. The players in our network economy model are one raw-capacity seller per network, one broker per service per network, and users, to play the roles of whole-sellers, retailers, and end-buyers, respectively, in a two-tier wholeseller/retailer market, which is best interpreted as a "sender-pay" model. With the progressive second price auction mechanism as the basic building block, we conduct a game theoretic analysis, deriving optimal strategies for buyers and brokers, and show the existence of networkwide market equilibria. In addition to pricing, another key consideration in building differentiated network services is the feasibility of maintaining stable and consistent service level agreements across multiple networks where demand-driven dynamic allocations are made only at the edges. Based on the proposed game-theoretic model, we are able to construct an explicit necessary and sufficient condition for the stability of the game, which determines the sustainability of any set of service level agreement configurations between Internet service providers. These analytical results are validated with simulations of user and broker dynamics, using the distributed progressive second price auction as the spot market mechanism in a scenario with three interconnected networks, and two services based on the proposed standard expedited forwarding and assured forwarding per-hop behavior.

/pdf/pricing-provisioning-and-peering-dynamic-markets-for-312rcl0772.pdf

Pricing, provisioning and peering: dynamic markets for differentiated Internet services and implications for network interconnections

This paper assesses the state-of-the-art in Quality-of-Service (QoS) adaptive wireless networks and proposes new adaptation techniques that better suit application specific needs. The contribution of the paper is as follows: we propose an adaptive service comprising (i) bandwidth utility functions, which capture the adaptive nature of mobile applications in terms of the range of bandwidth over which they prefer to operate; and (ii) adaptation scripts, which enable adaptive mobile applications to program the per-flow adaptation time scale and bandwidth granularity realizing application-specific adaptive services. To maintain adaptive services in wireless packet access networks, we propose a split level adaptation control framework that operates at the network and application levels. Network level control employs a periodic probing mechanism between mobile devices and network gateways in support of utility based max---min fair resource allocation. Application level control is managed by a set of distributed adaptation handlers that operate at mobile devices realizing application-specific adaptation strategies.

https://www.cs.dartmouth.edu/~campbell/papers/winet2001.pdf

A utility-based approach for quantitative adaptation in wireless packet networks

In a method of fair queue servicing at a queuing point in a multi-service class packet switched network, incoming packets are received in buffers and outgoing packets are scheduled by a weighted fair queue scheduler. Real-time information of buffer usage along with the minimum bandwidth requirement is used to dynamically modify the weights of the weighted fair queue scheduler.

Fair queue servicing using dynamic weights (dwfq)

A quantity of bandwidth currently allocated to a communication unit (20) is determined and a display component (40) of the communication unit (20) is caused to graphically display information that indicates the determined quantity of bandwidth The display information may also indicate a quantity of additional bandwidth that is available for allocation to the communication unit (20)

Raymond Rui-Feng Liao

Papers

The mobiware toolkit: programmable support for adaptive mobile networking

Pricing, provisioning and peering: dynamic markets for differentiated Internet services and implications for network interconnections

A utility-based approach for quantitative adaptation in wireless packet networks

Fair queue servicing using dynamic weights (dwfq)

On-demand service performance upgrade for wireless networks