Abstract: For a route server that generates route data for a route between a starting location and a destination location on a map, a method of compressing the route data that includes a maneuvering instruction for each of a plurality of junctures from the starting location to the destination location of the route is described. For a maneuvering instruction for each juncture of the route, the method determines whether the maneuvering instruction for the juncture is needed at a route client that is to receive the route data. When the maneuvering instruction for a particular juncture is determined not to be needed at the route client, the method modifies the route data by removing the maneuvering instruction for the particular juncture from the route data.

Abstract: A mapping program for execution by at least one processing unit of a device is described. The mapping program selects a traffic segment defined in a first data structure describing congestion in an area of a map. The mapping program identifies a portion of a road in the map area that corresponds to the traffic segment by using a second data structure to correlate the traffic segment in the first data structure to the road that is defined in a third data structure. The mapping program defines a traffic congestion representation to render for the identified road portion, based on data about the corresponding road in the third data structure.

Abstract: For a route server that generates route data for a route between a starting location and a destination location on a map, a method of compressing the route data that includes a maneuvering instruction for each of a plurality of junctures from the starting location to the destination location of the route is described. For a maneuvering instruction for each juncture of the route, the method determines whether the maneuvering instruction for the juncture is needed at a route client that is to receive the route data. When the maneuvering instruction for a particular juncture is determined not to be needed at the route client, the method modifies the route data by removing the maneuvering instruction for the particular juncture from the route data.

Abstract: For a route server that generates route data for a route between a starting location and a destination location on a map, a method of compressing the route data that includes a maneuvering instruction for each of a plurality of junctures from the starting location to the destination location of the route is described. For a maneuvering instruction for each juncture of the route, the method determines whether the maneuvering instruction for the juncture is needed at a route client that is to receive the route data. When the maneuvering instruction for a particular juncture is determined not to be needed at the route client, the method modifies the route data by removing the maneuvering instruction for the particular juncture from the route data.

Abstract: For a route server that generates route data for a route between a starting location and a destination location on a map, a method of compressing the route data that includes a maneuvering instruction for each of a plurality of junctures from the starting location to the destination location of the route is described. For a maneuvering instruction for each juncture of the route, the method determines whether the maneuvering instruction for the juncture is needed at a route client that is to receive the route data. When the maneuvering instruction for a particular juncture is determined not to be needed at the route client, the method modifies the route data by removing the maneuvering instruction for the particular juncture from the route data.

Abstract: A mapping program for execution by at least one processing unit of a device is described. The mapping program selects a traffic segment defined in a first data structure describing congestion in an area of a map. The mapping program identifies a portion of a road in the map area that corresponds to the traffic segment by using a second data structure to correlate the traffic segment in the first data structure to the road that is defined in a third data structure. The mapping program defines a traffic congestion representation to render for the identified road portion, based on data about the corresponding road in the third data structure.

Abstract: A method for performing multilink communications may include applying a quality-of-service (QoS) policy to incoming traffic, where the QoS policy operates to identify a first portion and a second portion of the incoming traffic. The method may include fragmenting the first portion of the incoming traffic into a group of fragments. The method may include sequencing the group of fragments and the second portion of the incoming traffic into a sequenced flow, where the sequencing causes the second portion to be interleaved among the group of fragments so that the sequenced flow can be made available to a first link and a second link as multilink traffic, where the first link carries a first portion of the multilink traffic and the second link carries a second portion of the multilink traffic.

Abstract: A method for performing multilink communications may include applying a quality-of-service (QoS) policy to incoming traffic, where the QoS policy operates to identify a first portion and a second portion of the incoming traffic. The method may include fragmenting the first portion of the incoming traffic into a group of fragments. The method may include sequencing the group of fragments and the second portion of the incoming traffic into a sequenced flow, where the sequencing causes the second portion to be interleaved among the group of fragments so that the sequenced flow can be made available to a first link and a second link as multilink traffic, where the first link carries a first portion of the multilink traffic and the second link carries a second portion of the multilink traffic.