1. A non-transitory computer readable medium storing a computer program for execution by at least one processor, the computer program comprising sets of instructions for:
displaying a route on a map, the route comprising a plurality of maneuvers for traveling from a starting location to an ending location;
providing a list of directions based on the route, the list of directions comprising a plurality of items, each item corresponding to a maneuver in the route;
receiving a selection of an item in the list of directions; and
changing a view of the map from a first view that includes a currently viewed position to a second view that includes a position of a maneuver that corresponds to the selected item by transitioning through a third view that encompasses both the currently viewed position and the position of the maneuver that corresponds to the selected item.
2. The non-transitory computer readable medium of claim 1, wherein the program further comprises a set of instructions for providing a plurality of distance labels along the route on the map.
3. The non-transitory computer readable medium of claim 1, wherein the set of instructions for changing the view of the map comprises a set of instructions for zooming out to encompass both the currently viewed position and the position of the selected maneuver.
4. The non-transitory computer readable medium of claim 1, wherein the set of instructions for changing the view of the map comprises a set of instructions for panning from the currently viewed position to the position of the selected maneuver if both the currently viewed position and the position of the selected maneuver can fit within a same view at a current zoom level.
5. The non-transitory computer readable medium of claim 1, wherein at least some of the items in the list of directions are associated with distance labels.
6. The non-transitory computer readable medium of claim 5, wherein at least some of the items in the list of directions are not associated with distance labels.
7. A method of providing a graphical user interface (GUI) for a mapping application, the method comprising:
providing a map viewing area for displaying a map and a route that comprises a plurality of maneuvers for traveling from a starting location to an ending location;
providing a list view area for displaying a list of directions based on the route, the list of directions comprising a plurality of items, each item corresponding to a maneuver in the route;
receiving a selection of an item in the list of directions; and
changing a view of the map in the map viewing area from a first view that includes a currently viewed position to a second view that includes a position of a maneuver that corresponds to the selected item by transitioning through a third view that encompasses both the currently viewed position and the position of the maneuver that corresponds to the selected item.
8. The method of claim 7, wherein changing the view of the map comprises zooming out to encompass both the currently viewed position and the position of the selected maneuver.
9. The method of claim 7, wherein changing the view of the map comprises panning from the currently viewed position to the position of the selected maneuver if both the currently viewed position and the position of the selected maneuver can fit within a same view at a current zoom level.
10. A method comprising:
displaying a route on a map, the route indicating a path from a starting location to an ending location;
generating a list of directions based on the route, wherein the list of directions comprises a plurality of steps for traveling on the route;
associating a plurality of distance labels with at least some of the steps in the plurality of steps, wherein each distance label indicates a traveling distance along the route; and
displaying the plurality of distance labels along the list of directions and along the route displayed on the map.
11. The method of claim 10 further comprising determining placement of the plurality of distance labels along the route.
12. The method of claim 11, wherein determining placement of the plurality of distance labels along the route comprises determining a segment unit value based on a set of numbers having two or less significant digits.
13. The method of claim 12 further comprising computing a lower bound value for the segment unit value based on a target number of distance labels and a length of the route.
14. The method of claim 13 further comprising computing a logarithmic value of the lower bound value.
15. The method of claim 11, wherein the placement of the distance labels along a particular section of the route is at least partially determined by the number of steps within that section of the route.
16. The method of claim 10, wherein associating the plurality of distance labels with the plurality of steps comprises distributing the distance labels evenly among the plurality of steps in the list of directions.
17. The method of claim 10, wherein the distance measure is measured from the starting location of the route.
18. The method of claim 10, wherein the number of distance labels in the plurality of distance labels is a predetermined number that is independent of an actual length of the route.
19. The method of claim 10, wherein at least some of the distance labels are placed near the beginning and the end of the route.
20. A non-transitory computer readable medium storing a computer program for execution by at least one processor, the computer program comprising sets of instructions for:
displaying a route on a map, the route indicating a path from a starting location to an ending location; and;
displaying a list of directions based on the route, wherein the list of directions comprises a plurality of maneuvers along the route;
displaying a plurality of distance labels along the route on the map and along the list of directions, wherein each distance label indicates a distance measure for a point of interest in the route that indicates a traveling distance on the path, wherein each distance label is associated with one maneuver in the list of directions.
21. The non-transitory computer readable medium of claim 20 further comprising a set of instructions for displaying the list of directions and a set of instructions for displaying the distance labels along the list of directions.
22. The non-transitory computer readable medium of claim 21, wherein the list of directions is represented by a plurality of graphical items, each graphical item representing a maneuver from the plurality of maneuvers, wherein the set of instructions for displaying the plurality of distance labels comprises a set of instructions for displaying the distance labels within some but not all of the graphical items in the list of directions.
23. The non-transitory computer readable medium of claim 20 further comprising a set of instructions for printing the list of directions.
24. The non-transitory computer readable medium of claim 23 further comprising a set of instructions for printing the plurality of distance labels along the printed list of directions.
25. The non-transitory computer readable medium of claim 24, wherein the set of instructions for printing the plurality of distance labels comprises a set of instructions for printing the distance labels adjacent to some but not all of the entries in the list of directions.
26. The non-transitory computer readable medium of claim 20, wherein at least some of the points of interest along the route are maneuvers from the plurality of maneuvers.
27. The non-transitory computer readable medium of claim 20, wherein the number of distance labels in the plurality of distance labels is a predetermined number that is independent of a length of the route.
28. The non-transitory computer readable medium of claim 20, wherein each distance label indicates an expected travel time from the starting location.
29. The non-transitory computer readable medium of claim 20, wherein each distance label indicates an expected travel time to reach the ending location.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method for conducting redundancy checks in a chain network, wherein the network architecture includes a chain network with a plurality of switches; the chain network have at least two switches at both ends, namely a first switch and a second switch; one or more relay switches are connected between the first switch and second switch, both of which are connected with an external network respectively; the method for handling redundancy mechanisms comprising the steps of:
(A) the port of the second switch connecting with the external network is set to blocking state, while ports of other switches of the chain network are set to be forwarding state;
(B) If any communication failure happen in the chain network, the port of the switch that is linked with the both side of failure will be blocked;
(C) the two switches whose blocking the link fail point send a first control packet to the first switch and second switch respectively;
(D) the port of the second switch that is originally set to blocking state changes to forwarding state after receiving the first control packet.
2. The method for conducting redundancy checks in a chain network according to claim 1, wherein the blocked port will carry out the following steps when returning to normal operation state:
(a) maintain the blocking state of the port of the switches;
(b) the two switches that include the blocking state port sends a second control packet to the first switch and second switch respectively;
(c) after receiving the second control packet, the first switch sends a third control packet for changing the port state of the switch that close to failure point and near the first switch to forwarding state;
(d) after receiving the second control packet, the second switch sends a fourth control packet to inquire if connection of the port of the first switch is normal or not; if yes, proceed to step (e); otherwise, proceed to step (g);
(e) the first switch sends a fifth control packet for blocking the port of the second switch, which connect the external network;
(f) the second switch sends the third control packet for changing the port state of the switch that close to failure point and near the second switch to forwarding state;
(g) the first switch sends a sixth control packet to the second switch, the second switch sends third control packet for changing the port state of the switch that close to failure point and near the second switch to forwarding state.
3. The method for conducting redundancy checks in a chain network according to claim 1, wherein the external network can be an external network device, which is connected with the first switch and second switch of the chain network respectively through the ports that are forwarded and blocked.
4. The method for conducting redundancy checks in a chain network according to claim 1, wherein the external network can be an external redundant network architecture, which is connected with the first switch and second switch of the chain network respectively through the ports that are forwarded and blocked.
5. The method for conducting redundancy checks in a chain network according to claim 4, wherein the external redundant network architecture can be a ring network architecture.
6. The method for conducting redundancy checks in a chain network according to claim 4, wherein the external redundant network architecture can be based on STP or RSTP.
7. The method for conducting redundancy checks in a chain network according to claim 1, wherein the switches detect link failure of the port by sending control packets.
8. The method for conducting redundancy checks in a chain network according to claim 1, wherein the switches detect link failure of the port through the physical layer.
9. The method for conducting redundancy checks in a chain network, wherein the network architecture consists of a chain network and second chain network, both of which include a plurality of switches; at both ends, the chain network and the second chain network have at least a first switch and a second switch that are respectively connected with an external network, and one or more relay switches are connected between the first switch and second switch; the first switch and second switch of the second chain network is connected with two switches of the chain network respectively, and the method for handling redundancy mechanisms comprising the steps of:
(A) the port of the second switches connecting with the external network is set to blocking state, while ports of other switches of the chain network are set to be forwarding state;
(B) If any communication failure happen in the chain network, the port of the switch that is linked with the both side of failure will be blocked;
(C) the two switches whose blocking the link fail point send a first control packet to the first switch and second switch respectively;
(D) the port of the second switch that is originally set to blocking state change to forwarding state after receiving the first control packet.
10. The method for conducting redundancy checks in a chain network according to claim 9, wherein the blocked port will carry out the steps as follows when returning to normal state:
(a) maintain the blocking state of the port of the switches;
(b) the two switches that include the blocking state port sends a second control packet to the first switch and second switch respectively;
(c) after receiving the second control packet, the first switch sends a third control packet for changing the port state of the switch that close to failure point and near the first switch to forwarding state;
(d) after receiving the second control packet, the second switch sends a fourth control packet to inquire if connection of the port of the first switch is normal or not; if yes, proceed to step (e); otherwise, proceed to step (g);
(e) the first switch sends a fifth control packet for blocking the port of the second switch, which connect the external network;
(f) the second switch sends the third control packet for changing the port state of the switch that close to failure point and near the second switch to forwarding state;
(g) the first switch sends a sixth control packet to the second switch, the second switch sends third control packet for changing the port state of the switch that close to failure point and near the second switch to forwarding state.
11. The method for conducting redundancy checks in a chain network according to claim 9, wherein the external network may be an external network device, which is connected with the first and second switches of the chain network respectively through the forwarding state and blocking state ports.
12. The method for conducting redundancy checks in a chain network according to claim 9, wherein the external network may be an external redundant network architecture, which is linked with the first and second switches of the chain network respectively through the forwarding state and blocking state ports.
13. The method for conducting redundancy checks in a chain network according to claim 12, wherein the external redundant network architecture can be an architecture applicable to redundant ring networks.
14. The method for conducting redundancy checks in a chain network according to claim 12, wherein the external redundant network architecture can be a network architecture that is based on STP or RSTP.
15. The method for conducting redundancy checks in a chain network according to claim 9, wherein the chain network and second chain network can be further connected with a third chain network, which has the first switch and second switch at its both ends respectively, and one or more relay switches are installed between the first switch and second switch; and the first and second switches of the third chain network can be connected with the chain network and second chain network respectively through the forwarding state and blocking state ports.
16. The method for conducting redundancy checks in a chain network according to claim 9, wherein the switches detect link failure of the port by transmitting packets.
17. The method for conducting redundancy checks in a chain network according to claim 9, wherein the switches detect link failure of the port through the physical (PHY) layer.
18. A method for conducting redundancy checks in a chain network, wherein the network architecture consists of a chain network and a second chain network, both of which include a plurality of switches respectively; at least a first switch and second switch connected with the external network respectively is installed at both ends of the chain network and second chain network, and the first switch and second switch of the second chain network is connected with two switches of the chain network respectively; and the method for handling redundancy mechanisms comprising the steps of:
(A) the port of the second switches connecting with the external network is set to blocking state, while ports of other switches of the chain network are set to be forwarding state;
(B) If any communication failure happen in the chain network, the port of the switch that is linked with the both side of failure will be blocked;
(C) the two switches whose blocking the link fail point send a first control packet to the first switch and second switch respectively;
(D) the port of the second switch that is originally set to blocking state change to forwarding state after receiving the first control packet.
19. The method for conducting redundancy checks in a chain network according to claim 18, wherein the blocked port will carry out the steps as follows when returning to normal state:
(a) maintain the blocking state of the port of the switches;
(b) the two switches that include the blocking state port sends a second control packet to the first switch and second switch respectively;
(c) after receiving the second control packet, the first switch sends a third control packet for changing the port state of the switch that close to failure point and near the first switch to forwarding state;
(d) after receiving the second control packet, the second switch sends a fourth control packet to inquire if connection of the port of the first switch is normal or not; if yes, proceed to step (e); otherwise, proceed to step (g);
(e) the first switch sends a fifth control packet for blocking the port of the second switch, which connect the external network;
(f) the second switch sends the third control packet for changing the port state of the switch that close to failure point and near the second switch to forwarding state;
(g) the first switch sends a sixth control packet to the second switch, the second switch sends third control packet for changing the port state of the switch that close to failure point and near the second switch to forwarding state.
20. The method for conducting redundancy checks in a chain network according to claim 18, wherein the external network may be an external network device, which can be connected with the first and second switches of the chain network respectively through the blocking state and forwarding state ports.
21. The method for conducting redundancy checks in a chain network according to claim 18, wherein the external network may be an external redundant network architecture, which is connected with the first and second switches of the chain network respectively through the forwarding state and blocking state ports.
22. The method for conducting redundancy checks in a chain network according to claim 21, wherein the external redundant network architecture can be a network architecture applicable to redundant ring networks.
23. The method for conducting redundancy checks in a chain network according to claim 21, wherein the external redundant network architecture can be a network architecture that is based on STP or RSTP.
24. The method for conducting redundancy checks in a chain network according to claim 18, wherein the chain network and second chain network can be further connected with a third chain network, which has the first switch and second switch respectively at its both ends, and the first and second switches of the third chain network can be connected with the chain network and second chain network respectively through the forwarding state and blocking state ports.
25. The method for conducting redundancy checks in a chain network according to claim 18, wherein the switches detect link failure of the port by transmitting packets.
26. The method for conducting redundancy checks in a chain network according to claim 18, wherein the switches detect link failure of the port through the physical layer.