Search

Your search keyword '"Department of Computer Science and Engineering [University Park]"' showing total 18 results
Start Over Author "Department of Computer Science and Engineering [University Park]"
18 results on '"Department of Computer Science and Engineering [University Park]"'

1. Simple Approximations of Semialgebraic Sets and their Applications to Control

Author

Didier Henrion, Fabrizio Dabbene, Constantino Lagoa, CNR Institute of Electronics, Computer and Telecommunication Engineering [Torino] (CNR | IEIIT), CNR Istituto di elettronica e di ingegneria dell'informazione e delle telecomunicazioni (CNR | IEIIT), National Research Council of Italy | Consiglio Nazionale delle Ricerche (CNR)-National Research Council of Italy | Consiglio Nazionale delle Ricerche (CNR), Équipe Méthodes et Algorithmes en Commande (LAAS-MAC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Czech Technical University in Prague (CTU), Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Institute of Electronics, Computer and Telecommunication Engineering (IEIIT-CNR), Politecnico di Torino = Polytechnic of Turin (Polito)-Consiglio Nazionale delle Ricerche [Torino] (CNR), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), and Université Fédérale Toulouse Midi-Pyrénées

Subjects
Semialgebraic set, 0209 industrial biotechnology, Polynomial, Positive polynomial, Stability (learning theory), Linear matrix inequalities, 02 engineering and technology, Systems and Control (eess.SY), 01 natural sciences, 020901 industrial engineering & automation, FOS: Mathematics, FOS: Electrical engineering, electronic engineering, information engineering, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], Applied mathematics, Almost everywhere, 0101 mathematics, Electrical and Electronic Engineering, Sampling, Mathematics - Optimization and Control, Finite set, Approximation, Mathematics, Hierarchy (mathematics), 010102 general mathematics, Solution set, Control and Systems Engineering, Optimization and Control (math.OC), Semialgebraic set Approximation Sampling, Computer Science - Systems and Control, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
Abstract

International audience; Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance the solution set of linear matrix inequalities or the Schur/Hurwitz stability domains. These sets often have very complicated shapes (non-convex, and even non-connected), which renders very difficult their manipulation. It is therefore of considerable importance to find simple-enough approximations of these sets, able to capture their main characteristics while maintaining a low level of complexity. For these reasons, in the past years several convex approximations, based for instance on hyperrect-angles, polytopes, or ellipsoids have been proposed. In this work, we move a step further, and propose possibly non-convex approximations , based on a small volume polynomial superlevel set of a single positive polynomial of given degree. We show how these sets can be easily approximated by minimizing the L1 norm of the polynomial over the semialgebraic set, subject to positivity constraints. Intuitively, this corresponds to the trace minimization heuristic commonly encounter in minimum volume ellipsoid problems. From a computational viewpoint, we design a hierarchy of linear matrix inequality problems to generate these approximations, and we provide theoretically rigorous convergence results, in the sense that the hierarchy of outer approximations converges in volume (or, equivalently, almost everywhere and almost uniformly) to the original set. Two main applications of the proposed approach are considered. The first one aims at reconstruction/approximation of sets from a finite number of samples. In the second one, we show how the concept of polynomial superlevel set can be used to generate samples uniformly distributed on a given semialgebraic set. The efficiency of the proposed approach is demonstrated by different numerical examples.

Published
2017
Full Text
View/download PDF

2. A distributed algorithm with consistency for PageRank-like linear algebraic systems

Author

Lagoa, Constantino, Zaccarian, Luca, Dabbene, Fabrizio, Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Dipartimento di Ingegneria Industriale [Trento], University of Trento [Trento], Équipe Méthodes et Algorithmes en Commande (LAAS-MAC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institute of Electronics, Computer and Telecommunication Engineering (IEIIT-CNR), Politecnico di Torino = Polytechnic of Turin (Polito)-Consiglio Nazionale delle Ricerche [Torino] (CNR), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), CNR Institute of Electronics, Computer and Telecommunication Engineering [Torino] (CNR | IEIIT), CNR Istituto di elettronica e di ingegneria dell'informazione e delle telecomunicazioni (CNR | IEIIT), and National Research Council of Italy | Consiglio Nazionale delle Ricerche (CNR)-National Research Council of Italy | Consiglio Nazionale delle Ricerche (CNR)

Subjects
distributed algorithms, Pagerank, [SPI.AUTO]Engineering Sciences [physics]/Automatic
Abstract

International audience; We present a novel solution algorithm for a specific set of linear equations arising in large scale sparse interconnections, such as the PageRank problem. The algorithm is distributed, exploiting the underlying graph structure, and completely asynchronous. The main feature of the proposed algorithm is that it ensures that the consistency constraint (the sum of the solution components summing to one) is satisfied at every step, and not only when convergence is reached, as in the case of the different algorithms available in the literature. This represents an important feature, since in practice this kind of algorithms are stopped after a fixed number of steps. The algorithm is based on two projection steps, and represents a variation of the classical Kaczmarz method. In this paper, we present a completely deterministic version, and prove its convergence under mild assumptions on the node selection rule. Numerical examples testify for the goodness of the proposed methodology.

Published
2017
Full Text
View/download PDF

3. Randomized Approximations of the Image Set of Nonlinear Mappings with Applications to Filtering

Author

Dabbene, Fabrizio, Henrion, Didier, Lagoa, Constantino, Shcherbakov, Pavel, Institute of Electronics, Computer and Telecommunication Engineering (IEIIT-CNR), Politecnico di Torino = Polytechnic of Turin (Polito)-Consiglio Nazionale delle Ricerche [Torino] (CNR), Équipe Méthodes et Algorithmes en Commande (LAAS-MAC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Czech Technical University in Prague (CTU), Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Institute of Control Sciences [Moscou] (ICS), Russian Academy of Sciences [Moscow] (RAS), CNR Institute of Electronics, Computer and Telecommunication Engineering [Torino] (CNR | IEIIT), CNR Istituto di elettronica e di ingegneria dell'informazione e delle telecomunicazioni (CNR | IEIIT), National Research Council of Italy | Consiglio Nazionale delle Ricerche (CNR)-National Research Council of Italy | Consiglio Nazionale delle Ricerche (CNR), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), and Université de Toulouse (UT)

Subjects
Optimization and Control (math.OC), FOS: Mathematics, FOS: Electrical engineering, electronic engineering, information engineering, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], Computer Science - Systems and Control, Systems and Control (eess.SY), [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Mathematics - Optimization and Control
Abstract

International audience; The aim of this paper is twofold: In the first part, we leverage recent results on scenario design to develop randomized algorithmsfor approximating the image set of a nonlinear mapping, that is, a (possibly noisy) mapping of a set via a nonlinear function.We introduce minimum-volume approximations which have the characteristic of guaranteeing a low probability of violation, i.e.,we admit for a probability that some points in the image set are not contained in the approximating set,but this probability is kept below a pre-specified threshold.In the second part of the paper, this idea is then exploited to develop a new family of randomized prediction-corrector filters.These filters represent a natural extension and rapprochement of Gaussian and set-valued filters,and bear similarities with modern tools such as particle filters.

Published
2015

4. Roaming charges for customers of cellular-wireless entrant providers

Author

Douglas Mercer, Christopher Griffin, George Kesidis, Serge Fdida, Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Laboratory of Information, Network and Communication Sciences (LINCS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), Networks and Performance Analysis (NPA), Laboratoire d'Informatique de Paris 6 (LIP6), and Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
business.industry, Computer science, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020206 networking & telecommunications, 02 engineering and technology, Computer security, computer.software_genre, symbols.namesake, Nash equilibrium, 0202 electrical engineering, electronic engineering, information engineering, symbols, Revenue, Wireless, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, Roaming, business, Telecommunications, computer, Barriers to entry
Abstract

International audience; We consider a simple two-player game involving a large incumbent and small entrant into a cellular wireless access provider marketplace. The entrant's customers must pay roaming charges. We assume that the roaming charges are regulated, because if they are dictated by the incumbent then they could be set so high so as to be a barrier to entry in the marketplace. The game is studied at its Nash equilibrium. A roaming charge is identified that is arguably fair in the sense that revenues for the access providers are proportionate to their infrastructure costs.

Published
2015
Full Text
View/download PDF

5. On the readability of overlap digraphs

Author

Rayan Chikhi, Martin Milanič, Sofya Raskhodnikova, Paul Medvedev, Bioinformatics and Sequence Analysis (BONSAI), Université de Lille, Sciences et Technologies-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, University of Primorska, European Project: 1422975(2014), European Project: 0845701(2009), European Project: 1453527(2015), Centre National de la Recherche Scientifique (CNRS)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Inria Lille - Nord Europe, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
0301 basic medicine, FOS: Computer and information sciences, graph parameter, String length, Discrete Mathematics (cs.DM), stringology, 0102 computer and information sciences, overlap graph, 01 natural sciences, Complete bipartite graph, Upper and lower bounds, Combinatorics, 03 medical and health sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Quantitative Biology - Genomics, Data Structures and Algorithms (cs.DS), Mathematics, Genomics (q-bio.GN), Applied Mathematics, Digraph, bioinformatics, Injective function, Readability, Vertex (geometry), 030104 developmental biology, 010201 computation theory & mathematics, If and only if, FOS: Biological sciences, readability, Combinatorics (math.CO), [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Computer Science - Discrete Mathematics, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

We introduce the graph parameter readability and study it as a function of the number of vertices in a graph. Given a digraph D, an injective overlap labeling assigns a unique string to each vertex such that there is an arc from x to y if and only if x properly overlaps y. The readability of D is the minimum string length for which an injective overlap labeling exists. In applications that utilize overlap digraphs (e.g., in bioinformatics), readability reflects the length of the strings from which the overlap digraph is constructed. We study the asymptotic behaviour of readability by casting it in purely graph theoretic terms (without any reference to strings). We prove upper and lower bounds on readability for certain graph families and general graphs, Comment: This is a full version of a conference paper of the same title at the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015)

Published
2015
Full Text
View/download PDF

6. Uniform sample generation in semialgebraic sets

Author

Constantino Lagoa, Didier Henrion, Fabrizio Dabbene, Institute of Electronics, Computer and Telecommunication Engineering (IEIIT-CNR), Politecnico di Torino = Polytechnic of Turin (Polito)-Consiglio Nazionale delle Ricerche [Torino] (CNR), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées, Équipe Méthodes et Algorithmes en Commande (LAAS-MAC), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, CNR Institute of Electronics, Computer and Telecommunication Engineering [Torino] (CNR | IEIIT), CNR Istituto di elettronica e di ingegneria dell'informazione e delle telecomunicazioni (CNR | IEIIT), National Research Council of Italy | Consiglio Nazionale delle Ricerche (CNR)-National Research Council of Italy | Consiglio Nazionale delle Ricerche (CNR), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT), and Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole)

Subjects
Discrete mathematics, Semialgebraic set, 0209 industrial biotechnology, Polynomial, 021103 operations research, Degree (graph theory), 0211 other engineering and technologies, Order (ring theory), Sample (statistics), 02 engineering and technology, Sense (electronics), Rejection rate, 020901 industrial engineering & automation, Asymptotically optimal algorithm, Optimization and Control (math.OC), FOS: Mathematics, Applied mathematics, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Mathematics - Optimization and Control, Mathematics
Abstract

International audience; We propose efficient techniques for generating independent identically distributed uniform random samples inside semialgebraic sets. The proposed algorithm leverages recent results on the approximation of indicator functions by polynomials %\cite{DabHen:13} to develop acceptance/rejection based sample generation algorithms with guaranteed performance in terms of rejection rate (the number of samples that should be generated in order to obtain an accepted sample). Moreover, the {acceptance} rate is shown to be is asymptotically optimal, in the sense that it tends to one (all samples accepted) as the degree of the polynomial approximation increases. The performance of the proposed method is illustrated by a numerical example.

Published
2014
Full Text
View/download PDF

7. I know what leaked in your pocket: uncovering privacy leaks on Android Apps with Static Taint Analysis

Author

Li, Li, Bartel, Alexandre, Klein, Jacques, Le Traon, Yves, Arzt, Steven, Rasthofer, Siegfried, Bodden, Eric, Octeau, Damien, McDaniel, Patrick, Li, Li, Interdisciplinary Centre for Security, Reliability and Trust [Luxembourg] (SnT), Université du Luxembourg (Uni.lu), EC SPRIDE, Technische Universität Darmstadt (TU Darmstadt), Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, and SnT centre - University of Luxembourg [research center]

Subjects
Computer science [C05] [Engineering, computing & technology], FOS: Computer and information sciences, Computer Science - Cryptography and Security, Uncovering Privacy Leaks, ACM, Inter-Component, D.2.4, [SCCO.COMP]Cognitive science/Computer science, Static Taint Analysis, D.4.6, Sciences informatiques [C05] [Ingénierie, informatique & technologie], IccTA, Software Engineering (cs.SE), Computer Science - Software Engineering, Android, [SCCO.COMP] Cognitive science/Computer science, ApkCombiner, Cryptography and Security (cs.CR)
Abstract

Android applications may leak privacy data carelessly or maliciously. In this work we perform inter-component data-flow analysis to detect privacy leaks between components of Android applications. Unlike all current approaches, our tool, called IccTA, propagates the context between the components, which improves the precision of the analysis. IccTA outperforms all other available tools by reaching a precision of 95.0% and a recall of 82.6% on DroidBench. Our approach detects 147 inter-component based privacy leaks in 14 applications in a set of 3000 real-world applications with a precision of 88.4%. With the help of ApkCombiner, our approach is able to detect inter-app based privacy leaks. Technical Report

Published
2014

8. The Effect of Caching on a Model of Content and Access Provider Revenues in Information-centric Networks

Author

Serge Fdida, George Kesidis, Fatih Kocak, Tuan-Minh Pham, Publications, Lip6, Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Networks and Performance Analysis (NPA), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Laboratory of Information, Network and Communication Sciences (LINCS), and Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)

Subjects
Service (business), Class (computer programming), business.industry, Computer science, 05 social sciences, 020206 networking & telecommunications, 02 engineering and technology, [INFO] Computer Science [cs], Provider Edge, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], symbols.namesake, Nash equilibrium, 0502 economics and business, Content centric networking, 0202 electrical engineering, electronic engineering, information engineering, symbols, Revenue, [INFO]Computer Science [cs], The Internet, 050207 economics, business, Game theory, Computer network
Abstract

International audience; In this paper, we consider a game between an Internet Service (access) Provider (ISP) and content provider (CP) on a platform of end-user demand. A price-convex demand-response is motivated based on the delay sensitive applications that are expected to be subjected to the assumed usage-priced priority service over best-effort service. Thus, we are considering a two-sided market with multiclass demand wherein one class (that under consideration herein) is delay-sensitive. Both the Internet and proposed Information Centric Network (ICN, encompassing Content Centric Networking (CCN)) scenarios are considered. For our purposes, the ICN case is basically different in the polarity of the side-payment (from ISP to CP in an ICN) and, more importantly here, in that content caching by the ISP is incentivized. A price-convex demand-response model is extended to account for content caching. The corresponding Nash equilibria are derived and studied numerically.

Published
2013
Full Text
View/download PDF

9. Co-Scheduling Algorithms for High-Throughput Workload Execution

Author

Aupy, Guillaume, Shantharam, Manu, Benoit, Anne, Robert, Yves, Raghavan, Padma, Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Department of Computer Science, University of Utah, Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, INRIA, École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), and Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL)

Subjects
Scheduling, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], approximation algorithms, efficient heuristics
Abstract

This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, each of them with an assigned number of processors, with the constraint that the total number of processors assigned within a pack does not exceed the maximum number of available processors. The objective is to determine a partition into packs, and an assignment of processors to applications, that minimize the sum of the execution times of the packs. We thoroughly study the complexity of this optimization problem, and propose several heuristics that exhibit very good performance on a variety of workloads, whose application execution times model profiles of parallel scientific codes. We show that co-scheduling leads to to faster workload completion time and to faster response times on average (hence increasing system throughput and saving energy), for significant benefits over traditional scheduling from both the user and system perspectives.; Nous étudions des algorithmes d'ordonnancement par lots pour un ensemble de tâches parallélisables. Plutôt que d'ordonnancer les tâches séquentiellement en utilisant le degré maximum de parallélisme pour chacune d'entre elles, nous cherchons à ordonnancer plusieurs tâches de manière concurrente. L'idée est de partitionner l'ensemble des tâches en une série de lots, qui seront exécutés les uns après les autres. Un lot est composé de plusieurs tâches, et un certain nombre de processeurs est alloué à chacune de ces tâches, sous la contrainte que le nombre total de processeurs alloués à un lot ne dépasse pas le nombre maximum de processeurs disponibles. L'objectif est de trouver une partition de l'ensemble des tâches en lots, et une allocation de processeurs optimale pour la minimisation de la somme des temps d'exécution de chaque lot. Nous étudions la complexité de ce problème d'optimisation, et proposons plusieurs heuristiques qui obtiennent d'excellentes performances sur plusieurs ensembles de tâches représentatifs des calculs parallèles scientifiques. Notre technique d'ordon\-nancement par lots permet non seulement d'obtenir un gain sur le temps d'exécution total, mais obtient également d'excellents résultats pour le temps de réponse moyen.

Published
2013

10. A model of network neutrality with usage-based prices

Author

Eitan Altman, Pierre Bernhard, George Kesidis, Julio Rojas-Mora, Sulan Wong, Stéphane Caron, Models for the performance analysis and the control of networks (MAESTRO), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Biological control of artificial ecosystems (BIOCORE), Laboratoire d'océanographie de Villefranche (LOV), Observatoire océanologique de Villefranche-sur-mer (OOVM), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Observatoire océanologique de Villefranche-sur-mer (OOVM), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de la Recherche Agronomique (INRA), Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Laboratoire Informatique d'Avignon (LIA), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Faculty of Law [Coruna], University of A Coruña (UDC), Institut National de la Recherche Agronomique (INRA)-Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'océanographie de Villefranche (LOV), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire océanologique de Villefranche-sur-mer (OOVM), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire océanologique de Villefranche-sur-mer (OOVM), and Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Service (business), business.product_category, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], Computer science, End user, media_common.quotation_subject, 05 social sciences, Business service provider, 020206 networking & telecommunications, Advertising, 02 engineering and technology, Service provider, Payment, Net neutrality, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, Internet access, Stackelberg competition, 050207 economics, Electrical and Electronic Engineering, business, media_common
Abstract

Available electronicallyby Springer since 2011; International audience; Hahn and Wallsten [7] wrote that network neutrality "usually means that broadband service providers charge consumers only once for Internet access, do not favor one content provider over another, and do not charge content providers for sending information over broadband lines to end users." In this paper we study the implications of non-neutral behaviors under a simple model of linear demand-response to usage-based prices. We take into account advertising revenues for the content provider and consider both cooperative and non-cooperative scenarios. In particular, we model the: impact of side-payments between service and content providers, consider an access provider that offers multiple service classes, and model leader-follower (Stackelberg game) dynamics. We finally study the additional option for one provider to determine the amount of side payment from the other provider. We show that not only do the content provider and the internaut suffer, but also the Access Provider's performance degrades.

Published
2013
Full Text
View/download PDF

11. Modeling and Control of Rare Segments in BitTorrent with Epidemic Dynamics

Author

Griffin, Christopher, Kesidis, George, Antoniadis, Panayotis, Fdida, Serge, Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Computer Engineering and Networks Laboratory (TIK), Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich), Laboratory of Information, Network and Communication Sciences (LINCS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), Networks and Performance Analysis (NPA), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Institut Mines-Télécom [Paris] (IMT)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Pierre et Marie Curie - Paris 6 (UPMC), and Mathieu, Fabien

Subjects
Computer Science - Networking and Internet Architecture, Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], ComputingMilieux_MISCELLANEOUS
Abstract

Despite its existing incentives for leecher cooperation, BitTorrent file sharing fundamentally relies on the presence of seeder peers. Seeder peers essentially operate outside the BitTorrent incentives, with two caveats: slow downlinks lead to increased numbers of "temporary" seeders (who left their console, but will terminate their seeder role when they return), and the copyright liability boon that file segmentation offers for permanent seeders. Using a simple epidemic model for a two-segment BitTorrent swarm, we focus on the BitTorrent rule to disseminate the (locally) rarest segments first. With our model, we show that the rarest-segment first rule minimizes transition time to seeder (complete file acquisition) and equalizes the segment populations in steady-state. We discuss how alternative dissemination rules may {\em beneficially increase} file acquisition times causing leechers to remain in the system longer (particularly as temporary seeders). The result is that leechers are further enticed to cooperate. This eliminates the threat of extinction of rare segments which is prevented by the needed presence of permanent seeders. Our model allows us to study the corresponding trade-offs between performance improvement, load on permanent seeders, and content availability, which we leave for future work. Finally, interpreting the two-segment model as one involving a rare segment and a "lumped" segment representing the rest, we study a model that jointly considers control of rare segments and different uplinks causing "choking," where high-uplink peers will not engage in certain transactions with low-uplink peers., Comment: 18 pages, 6 figures, A shorter version of this paper that did not include the N-segment lumped model was presented in May 2011 at IEEE ICC, Kyoto

Published
2013

12. Distributed Medium Access Control with Dynamic Altruism

Author

Serge Fdida, Youngmi Jin, Christopher Griffin, George Kesidis, Panayotis Antoniadis, Networks and Performance Analysis (NPA), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Laboratory of Information, Network and Communication Sciences (LINCS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, and Jun Zheng and Nathalie Mitton and Jun Li and Pascal Lorenz

Subjects
Mathematical optimization, business.industry, Computer science, media_common.quotation_subject, 05 social sciences, 020206 networking & telecommunications, Access control, 02 engineering and technology, Experimental economics, Altruism, Fictitious play, symbols.namesake, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Nash equilibrium, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, symbols, 050207 economics, business, Game theory, media_common, Computer network
Abstract

International audience; In this paper, we consider medium access control of local area networks (LANs) under limited-information conditions as befits a distributed system. Rather than assuming “by rule” conformance to a protocol designed to regulate packet-flow rates (as in, e.g., CSMA windowing), we begin with a non-cooperative game framework and build a dynamic altruism term into the net utility. Our objective is to define a utility model that captures more closely the expected behavior of users, which according to recent results from behavioral and experimental economics should include a conditionally altruistic dimension. The effects of our proposed dynamic altruism are analyzed at Nash equilibrium in the quasi-stationary (fictitious play) regime. We consider either power or throughput based costs, and the cases of identical or heterogeneous (independent) users/players.

Published
2012
Full Text
View/download PDF

13. Leveraging Side Observations in Stochastic Bandits

Author

Caron, Stephane, Kveton, Branislav, Lelarge, Marc, Bhagat, S., Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Technicolor Research [Palo Alto], Technicolor, Laboratoire d'informatique de l'école normale supérieure (LIENS), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Dynamics of Geometric Networks (DYOGENE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria), Laboratory of Information, Network and Communication Sciences (LINCS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Département d'informatique de l'École normale supérieure (DI-ENS), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria Paris-Rocquencourt

Subjects
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR], FOS: Computer and information sciences, Computer Science - Learning, Statistics - Machine Learning, Machine Learning (stat.ML), ComputingMilieux_MISCELLANEOUS, Machine Learning (cs.LG)
Abstract

This paper considers stochastic bandits with side observations, a model that accounts for both the exploration/exploitation dilemma and relationships between arms. In this setting, after pulling an arm i, the decision maker also observes the rewards for some other actions related to i. We will see that this model is suited to content recommendation in social networks, where users' reactions may be endorsed or not by their friends. We provide efficient algorithms based on upper confidence bounds (UCBs) to leverage this additional information and derive new bounds improving on standard regret guarantees. We also evaluate these policies in the context of movie recommendation in social networks: experiments on real datasets show substantial learning rate speedups ranging from 2.2x to 14x on dense networks., Comment: Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence (UAI2012)

Published
2012
Full Text
View/download PDF

14. CSMA Local Area Networking under Dynamic Altruism

Author

Antoniadis, Panayotis, Fdida, Serge, Griffin, Christopher, Jin, Youngmi, Kesidis, George, Networks and Performance Analysis (NPA), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Laboratory of Information, Network and Communication Sciences (LINCS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, and Mathieu, Fabien

Subjects
Computer Science - Networking and Internet Architecture, Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], ComputingMilieux_MISCELLANEOUS
Abstract

In this paper, we consider medium access control of local area networks (LANs) under limited-information conditions as befits a distributed system. Rather than assuming "by rule" conformance to a protocol designed to regulate packet-flow rates (e.g., CSMA windowing), we begin with a non-cooperative game framework and build a dynamic altruism term into the net utility. The effects of altruism are analyzed at Nash equilibrium for both the ALOHA and CSMA frameworks in the quasistationary (fictitious play) regime. We consider either power or throughput based costs of networking, and the cases of identical or heterogeneous (independent) users/players. In a numerical study we consider diverse players, and we see that the effects of altruism for similar players can be beneficial in the presence of significant congestion, but excessive altruism may lead to underuse of the channel when demand is low.

Published
2012

15. An Epidemic Model of Bit Torrent with Control

Author

George Kesidis, Christopher Griffin, Serge Fdida, Panayotis Antoniadis, Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Networks and Performance Analysis (NPA), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Laboratory of Information, Network and Communication Sciences (LINCS), and Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)

Subjects
0209 industrial biotechnology, business.industry, Computer science, 020206 networking & telecommunications, 02 engineering and technology, computer.file_format, Computer security, computer.software_genre, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 020901 industrial engineering & automation, File sharing, Server, 0202 electrical engineering, electronic engineering, information engineering, business, Epidemic model, Dissemination, computer, BitTorrent, Computer network
Abstract

International audience; Despite its existing incentives for leecher cooperation, BitTorrent file sharing fundamentally relies on the presence of seeder peers. Seeder peers essentially operate outside the BitTorrent incentives, with two caveats: slow downlinks lead to increased numbers of "temporary" seeders (who left their console, but will terminate their seeder role when they return), and the copyright liability boon that file segmentation offers for permanent seeders. Using a simple epidemic model for a two segment BitTorrent swarm, we focus on the BitTorrent rule to disseminate the (locally) rarest segments first. With our model, we show that the rarest-segment first rule minimizes transition time to seeder (complete file acquisition) and equalizes the segment populations in steady-state. We discuss how alternative dissemination rules may beneficially increase file acquisition times causing leechers to remain in the system longer (particularly as temporary seeders). The result is that leechers are further enticed to cooperate. This eliminates the threat of extinction of rare segments which is prevented by the needed presence of permanent seeders. Our model allows us to study the corresponding trade-offs between performance improvement, load on permanent seeders, and content availability, which we leave for future work.

Published
2011
Full Text
View/download PDF

16. A study of non-neutral networks

Author

Altman, Eitan, Bernhard, Pierre, Kesidis, George, Rojas-Mora, Julio, Wong, Sulan, Models for the performance analysis and the control of networks (MAESTRO), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Modeling and control of renewable resources (COMORE), Laboratoire d'océanographie de Villefranche (LOV), Observatoire océanologique de Villefranche-sur-mer (OOVM), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Observatoire océanologique de Villefranche-sur-mer (OOVM), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria Sophia Antipolis - Méditerranée (CRISAM), Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Laboratoire Informatique d'Avignon (LIA), Centre d'Enseignement et de Recherche en Informatique - CERI-Avignon Université (AU), and Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI

Subjects
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], ACM: K.: Computing Milieux/K.5: LEGAL ASPECTS OF COMPUTING/K.5.2: Governmental Issues/K.5.2.1: Regulation, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.3: Network Operations/C.2.3.0: Network management, Net neutrality, mathematical models
Abstract

Hahn and Wallsten [3] wrote that net neutrality usually means that broadband service providers charge consumers only once for Internet access, do not favor one content provider over another, and do not charge content providers for sending information over broadband lines to end users." In this paper we study the implications of being non-neutral, particularly by charging the content providers. Using game theoretic tools, we show that by adding the option for the service providers to charge the content providers, not only may the content providers and the internauts suer, but also the access provider's performance degrades.

Published
2010

17. A Study of Non-neutral Networks with Usage-Based Prices

Author

Julio Rojas-Mora, Stéphane Caron, Sulan Wong, George Kesidis, Pierre Bernhard, Eitan Altman, Models for the performance analysis and the control of networks (MAESTRO), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Modeling and control of renewable resources (COMORE), Laboratoire d'océanographie de Villefranche (LOV), Observatoire océanologique de Villefranche-sur-mer (OOVM), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Observatoire océanologique de Villefranche-sur-mer (OOVM), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria Sophia Antipolis - Méditerranée (CRISAM), Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Dpt. of Business Economics and Organization [Barcelone], University of Barcelona, Faculty of Law [Coruna], University of A Coruña (UDC), Stiller, Burkhard and Hossfeld, Tobias and Stamoulis, and George D.

Subjects
business.product_category, Service delivery framework, [SDV]Life Sciences [q-bio], Online charging system, media_common.quotation_subject, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], 05 social sciences, Business service provider, 020206 networking & telecommunications, Advertising, 02 engineering and technology, Provider Edge, Service provider, Payment, Net neutrality, [SPI]Engineering Sciences [physics], [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, Internet access, Business, 050207 economics, media_common
Abstract

International audience; Hahn and Wallsten [1] wrote that network neutrality "usually means that broadband service providers charge consumers only once for Internet access, do not favor one content provider over another, and do not charge content providers for sending information over broadband lines to end users." We study the implications of non-neutral behaviors under a simple model of linear demand-response to usage-based prices. We take into account advertising revenues for the content provider and consider both cooperative and non-cooperative scenarios. We show that by adding the option for one provider to determine the amount of side payment from the other provider, not only do the content provider and the internaut suffer, but also the Access Provider's performance degrades.

Published
2010
Full Text
View/download PDF

18. Applying Organizational Routines in understanding organizational change

Author

Nathalie Lazaric, Sidney G. Winter, Richard R. Nelson, Markus C. Becker, University of Southern Denmark (SDU), Groupe de Recherche en Droit, Economie et Gestion (GREDEG), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Dept. of Civil Enginnering & Engineering Mechanics, Columbia University, Columbia University [New York], Department of Computer Science and Engineering [University Park], Pennsylvania State University (Penn State), Penn State System-Penn State System, Bureau d'Économie Théorique et Appliquée (BETA), Institut National de la Recherche Agronomique (INRA)-Université de Strasbourg (UNISTRA)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), and University of Pennsylvania [Philadelphia]

Subjects
Organizational behavior, Economics and Econometrics, Knowledge management, ComputingMilieux_THECOMPUTINGPROFESSION, business.industry, Organizational studies, Organizational engineering, 05 social sciences, Organizational commitment, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, Organizational performance, Management, ComputingMilieux_MANAGEMENTOFCOMPUTINGANDINFORMATIONSYSTEMS, Entreprises, Organization development, 0502 economics and business, Organizational learning, Organizational safety, Routines, Sociology, 050207 economics, Organizational behavior and human resources, business, 050203 business & management, ComputingMilieux_MISCELLANEOUS
Abstract

International audience; Organizational routines are considered basic components of organizational behavior and repositories of organizational capabilities (Nelson & Winter, 1982). They do, therefore, hold one of the keys to understanding organizational change. The article focuses on how the concept of organizational routines can be applied in empirical research to understand organizational change. We identify problems encountered in such research and present proposals for how to deal with them, in order to advance our knowledge of routines and our understanding of organizational change. Developing these themes, we also introduce the articles in the special section ‘Towards an Operationalization of the Routines Concept’.

Published
2005
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results