Using Indirect Routing to Recover from Network Traffic Scheduling Estimation Error

Li, Conglong; Mukerjee, Matthew K.; Andersen, David G.; Seshan, Srinivasan; Kaminsky, Michael; Porter, George; Snoeren, Alex C.

doi:10.1109/ancs.2017.12

Cited by 6 publications

(9 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The route that is adopted by the packet for traveling is called direct route, and the process implemented by such route is called direct routing. In the mobile IP direct routing approach, a CN sends a request to an HA for the address of the MS. After receiving the permanent mobile address or the current CoA of the requested MS, the CN directly forward the packet(s) to the network where the MS is currently located, as illustrated in Figure 3 [10]. Accordingly, the direct approach reduces the dependency of the HA in forwarding the transmitted packets to the moving device, yet, the CN has to request for the address from the MH while transmitting the first packet.…”

Section: Mobile Ip Routing: Overviewmentioning

confidence: 99%

“…Generally, mobile IP is responsible for the registration of the MS with the home agent (HA) and routing the datagrams via the tunnel to the MS. The mobile IP usually maintains the TCP connection between the static and the mobile hosts and reduces the effects that are resulted from the mobility of the device; therefore, it helps to keep the TCP connection intact [10]. As such, mobile IP is often regarded as a communication protocol that is controlled and standardized by the Internet Engineering Task Force (IETF).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improved Direct Routing Approach for Mobile IP Systems

Alshahrani

2019

Int. J. Interact. Mob. Technol.

View full text Add to dashboard Cite

<p class="0abstract">The mobile IP communication protocol is a flexible system for mobile connection that is designed to allow the device to be moved between networks while maintaining a permanent IP address. IP datagrams using mobile IP can be routed to a specific mobile station (MS) regardless of its current internet location. However, to facilitate such routable characteristics, the communication with an MS that is visiting a foreign network is intermediate with communication between the home agent (HA) and the foreign agent (FA) which increase the total delay and harms the communication performance, especially when the MS continuously moves from a network to another. Accordingly, to handle the delay issue, this paper proposes a new approach for mobile IP direct routing, based on the “follow-me” principle. The proposed approach depends on sending a new temporary care-of-address (CoA) for the previously visited network as the MS moves to another to keep a reliable tracking–like process with the HA. Accordingly, the agents of all the visited networks play the same principles as the HA role whenever the MS moves from a network to another. The proposed approach influences the delay and the speed of the delivery of internet packets. The simulation showed that the proposed method decreases the delay by up to 50% compared to the direct routing approach. </p>

show abstract

Section: Mobile Ip Routing: Overviewmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Improved Direct Routing Approach for Mobile IP Systems

Alshahrani

2019

Int. J. Interact. Mob. Technol.

View full text Add to dashboard Cite

show abstract

“…Besides Albedo [23], Eclipse++ [3] is the only other work that has explored indirect routing in hybrid switching. It was shown in [3] that optimal indirect routing using such "slacks", left over by a direct routing solution such as Eclipse, can be formulated as maximum multi-commodity flow over a "slack graph", which is itself NP-complete [8,11,14,21].…”

Section: State Of the Art: Eclipse And Eclipse++mentioning

confidence: 99%

“…The demand matrix entry D(i, j) is the amount of VOQ(i, j) traffic, within a scheduling window, that needs to be scheduled for transmission by the hybrid switch. It was effectively assumed, in all prior works on hybrid switching except Albedo [23] (to be discussed in §7.1), that the demand matrix D is precisely known before the computation of the circuit switch schedule begins (say at time t). This assumption certainly makes sense if the hybrid switch is batch-scheduling only "inventory" traffic, i.e., those packets that have arrived (before t).…”

Section: Traffic Demand and Batch Schedulingmentioning

confidence: 99%

“…All prior hybrid switching algorithms except Albedo [23] perform only batch scheduling (of "inventory" traffic or "accurately forecasted" future traffic). In other words, given a demand matrix D, the schedules of the circuit and the packet switches are computed before the transmissions of the batch (i.e., traffic in D) actually happen.…”

Section: Traffic Demand and Batch Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

Better Algorithms for Hybrid Circuit and Packet Switching in Data Centers

Liu,

Gong,

Yang

et al. 2017

Preprint

View full text Add to dashboard Cite

Hybrid circuit and packet switching for data center networking (DCN) has received considerable research attention recently. A hybrid-switched DCN employs a much faster circuit switch that is reconfigurable with a nontrivial cost, and a much slower packet switch that is reconfigurable with no cost, to interconnect its racks of servers. The research problem is, given a traffic demand matrix (between the racks), how to compute a good circuit switch configuration schedule so that the vast majority of the traffic demand is removed by the circuit switch, leaving a remaining demand matrix that contains only small elements for the packet switch to handle. In this paper, we propose two new hybrid switch scheduling algorithms under two different scheduling constraints. Our first algorithm, called 2-hop Eclipse, strikes a much better tradeoff between the resulting performance (of the hybrid switch) and the computational complexity (of the algorithm) than the state of the art solution Eclipse/Eclipse++. Our second algorithm, called BFF (best first fit), is the first hybrid switching solution that exploits the potential partial reconfiguration capability of the circuit switch for performance gains.

show abstract