SophiaPretty

(5)

$14/per page/Negotiable

About SophiaPretty

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Applied Sciences,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Economics,Engineering,English,Environmental science,Essay writing Hide all
Teaching Since: Jul 2017
Last Sign in: 304 Weeks Ago, 6 Days Ago
Questions Answered: 15833
Tutorials Posted: 15827

Education

  • MBA,PHD, Juris Doctor
    Strayer,Devery,Harvard University
    Mar-1995 - Mar-2002

Experience

  • Manager Planning
    WalMart
    Mar-2001 - Feb-2009

Category > Computer Science Posted 26 Mar 2018 My Price 10.00

topology of our simple network is slightly modified

Hi, I feel confused with this computer networking problem, it's like a type of Dijkstra Algorithm problem, however, the constrains right here is the capacity of each links. Thus, it become something like maximum flow problem. But I'm not sure. Could you help me with this homework?

 

Thanks so much!

 

Lucas

 

Traffic routing: Network operators vs. user's perspective
 
1. Algorithm overview
The objective of this project is to find optimal control variables allocating traffic to various links connecting source S with destination D. We will consider two cases. In the first one the goal is to find an optimal solution for a network operator, in the second, an individual user's interest is the top priority. In both cases the traffic routing strategies are delay-related. We assume that an average delay experienced by a packet is d=1/(c-f), where c denotes capacity of a link and f is intensity of traffic offered to this link. This formula results from the theory of stochastic service systems.
 
 
2. Optimal strategy for a network operator
A packet can be routed from source S to destination D over one of two different links, whose capacities are c1 and c2. A network operator makes a decision which link is selected for each incoming packet. What delay related quality criterion Jn(a1,a2,c1,c2,A) is the best from the network operator's perspective? Find control variables a1 and a2 , resulting from optimization of Jn , that allocate the total traffic A from S to D to both links f1=a1A and f2=a2A. What is the corresponding optimal value of the proposed quality criterion Jn ? Assume A=10, c1=16, c2=4.
 
 
Optimal strategy for an individual user
The topology of our simple network is slightly modified, i.e. source S is connected with destination D with three different links (not two as in Section 2) of capacities c1 , c2 and c3 . Now every incoming packet (not the network operator) chooses for itself a path from S to D. What delay-related decision criterion Jp should be applied by each individual packet? Is this criterion identical to Jn ? Find the corresponding optimal traffic control variables a1 , a2 , a3 and the numerical value of Jp. Assume A=20, c1=16, c2=4, c3=6.
 

Attachments:

Answers

SophiaPretty
(5)
Status NEW Posted 26 Mar 2018 03:03 PM My Price 10.00

  ----------- He-----------llo----------- Si-----------r/M-----------ada-----------m -----------  ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be-----------

Not Rated(0)