¹/i€[k], \'1]i€[k]) functions (la)a&A ELA. Define al as the instance that we obtain from I if we scale all demands by a ≥ 1, i.e., al = (G, (la)a=A, ($i, ti)iɛ[k], (ari)iɛ[k]). Recall the definition of w(L) as defined in the Lecture Notes and assume that 0 ≤ w(L) < 1.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Problem 1
Let L be some class of standard latency functions. Let I
(G = (V,A), (la)a=A, (Si, ti)ik], (ri)ic[k]) be a selfish routing instance with latency
functions (la)aEA ELA. Define al as the instance that we obtain from I if we
scale all demands by a ≥ 1, i.e., al = (G, (la)a=A, (Si, ti)iɛ[k], (αri)iċ[k]). Recall the
definition of w(L) as defined in the Lecture Notes and assume that 0 ≤ w(L) < 1.
Let f be a Nash flow of I and let f* be an optimal flow of al with a := (1+w(L)).
Show that C(f) <C(f*). Hint: Consider the flow x = 1f* and use the variational
inequality.
Transcribed Image Text:Problem 1 Let L be some class of standard latency functions. Let I (G = (V,A), (la)a=A, (Si, ti)ik], (ri)ic[k]) be a selfish routing instance with latency functions (la)aEA ELA. Define al as the instance that we obtain from I if we scale all demands by a ≥ 1, i.e., al = (G, (la)a=A, (Si, ti)iɛ[k], (αri)iċ[k]). Recall the definition of w(L) as defined in the Lecture Notes and assume that 0 ≤ w(L) < 1. Let f be a Nash flow of I and let f* be an optimal flow of al with a := (1+w(L)). Show that C(f) <C(f*). Hint: Consider the flow x = 1f* and use the variational inequality.
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Convex Hull
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education