Abstract: A high-level functionality generates a Data Model which is used to automatically generate Applications comprising Application Clients, Application Servers, Client-Server Protocols, Dashboards and other components. These Applications are derived for different mobile and non-mobile's Operating Systems. This functionality uses Services, Service Representation, Application Flow, Rules, and Presentation Attributes. The input for the automation is a very high-level, “service” level “language,” from which all parts are automatically generated. The output of the automation also includes a way to validate the correctness of the generated Applications. The generated Dashboard provide a Business Entity with functionality to continuously update the generated Data Model based on the Services and Business Entity data, and from the updated Data Model automatically generate updated versions of the Application.

Abstract: A system solution offers a Business Entity an automatically generated set of User Interfaces to run on a plurality of Client Devices of different characteristics in terms of operating system, hardware, and look and feel, and yet provide the same user experience. A User Interface that offers a user experience on a Reference Client Device is automatically translated to offer the same user experience on a plurality of Client Device having different characteristics from the Reference Client Device. The objects displayed in the User Interface for the Reference Client Device are placed on a Translation Grid that is generated and superimposed on the User Interface. A Client Translator and Generator translates the User Interface from the Reference Client to the plurality of Client Devices using the Translation Grid and a set of Translation Rules. A measurement of the automatic translation process identifies optimal and sub-optimal translation for each Client Device.

Abstract: A System Solution offers a Business Entity the generation of a plurality of User Experiences offered by a Two-Layer Native Application Client, stores these experiences in the client device or in an Application Server, and provides a way to directly download dynamically User Experiences while the Two-Layer Native Application Client is running on the Client Device. The Two-Layer Native Application Client automatically downloads a first User Experience based on a first condition and a second User Experience in the plurality of User Experiences based on a second condition. A plurality of Applications shares a common Native Layer and is downloaded dynamically to the Client Device. A first and a second Application in the plurality of Applications runs simultaneously on the client device. The System Solution generates Dashboards that can be used to modify dynamically the Dynamic Layers and Applications in the pluralities of Two-Layer Native Application Clients.

Abstract: A System Solution of a Computing device and Computer hardware automatically generates a Data Model with a well-defined structure containing the Business Entity Data and a Service Representation with Services selected by a Business Entity. The System Solution applies the Data Model to an Automatic Application Generator that automatically generates an Application comprising a set of Native Application Clients for all desired platforms (mobile, non-mobile and Cloud), Application Servers, communication protocols, Dashboards, and other components. The output of the Automatic Application Generator provides a set of Application Clients for the particular platforms selected by the Business Entity and interacts with the Operating System of a Client Device. A Dashboard automatically generates Updated Applications based on the selected Services as desired by the Business Entity. The clients and servers communicate via an automatically generated Client-Server Protocol.

Abstract: A Searchable Application Representation is generated with the exact structure, content, functionality, and behavior of the Native Mobile Applications and is searchable by Search Engines by providing metadata pointing to the Native Mobile Applications. The Search Engine searches the Searchable Application Representation. When the Search Engine finds the Searchable Application Representation, Pointer, Metadata and Search Material to Corresponding Native Mobile Application on the Internet, the Search Engine becomes aware of the Native Mobile Application and can search the Content contained in the Searchable Application Representation. The Search Engine finds and ranks Content in the Searchable Representation and Pointer, Metadata, and Search Material corresponding to such Content in the Native Mobile Application is passed to the Search Engine, which can use such information to determine the relevancy of such Content according to a certain Search Criteria.

Abstract: An access point detects a presence of a first device having a device identifier in a femtozone associated with the access point. The access point matches the device identifier with a first personal policy server identifier associated with a corresponding first personal policy profile comprising a first set of rules and retrieves the first personal policy profile corresponding to the first personal policy server identifier. The access point applies the first set of rules in the first personal policy profile.

Abstract: Techniques for communication group configuration in a network are described. Location information describing a location of a first access point and neighborhood information related to the location of the first access point and to locations of neighboring access points are used to assign the first access point to a group of access points, where the group of access points includes one or more of the neighboring access points.

Abstract: An access point detects a presence of a first device having a device identifier in a femtozone associated with the access point. The access point matches the device identifier with a first personal policy server identifier associated with a corresponding first personal policy profile comprising a first set of rules and retrieves the first personal policy profile corresponding to the first personal policy server identifier. The access point applies the first set of rules in the first personal policy profile.

Abstract: Among other things, a system for use in wireless communication includes a first device communicating via a first protocol in a first network, a cellular device communicating via a second protocol in a cellular network, the second protocol being incompatible with the first protocol, and an access point in the cellular network, the access point being accessible by the cellular device and being configured to enable communication between the first device and the cellular device.

Abstract: An access point detects a presence of a first device having a device identifier in a femtozone associated with the access point. The access point matches the device identifier with an identifier associated with corresponding applications and activates a set of applications associated with the device identifier.

Abstract: Techniques for communication group configuration in a network are described. Location information describing a location of a first access point and neighborhood information related to the location of the first access point and to locations of neighboring access points are used to assign the first access point to a group of access points, where the group of access points includes one or more of the neighboring access points.

Abstract: A scheduling apparatus flexibly integrates guaranteed-bandwidth (GB) and best-effort (BE) flows and comprises a combination of a primary weighted-round-robin (WRR) scheduler (PWS) and a secondary WRR scheduler (SWS). The PWS distributes service to the individual GB flows and determines the amount of service that the BE flow aggregate should receive during each frame. The SWS takes care of fairly distributing the service share of the BE aggregate over the individual BE flows. The scheduling apparatus divides the service frame in two subframes. In the first subframe, the PWS fulfills the bandwidth requirements of the GB flows. In the second subframe, the SWS distributes fair service to the BE flows. For each frame, the duration depends on the amount of bandwidth allocated to the GB flows and on the number of GB flows that are backlogged at the beginning of the frame. The amount of bandwidth globally available to BE flows (i.e.

Abstract: A scheduler apparatus provides bandwidth guarantees to individual data packet flows as well as to aggregations of those flows (referred to as “bundles”) in a completely transparent manner, i.e., without using any additional scheduling structure. For each bundle, the scheduler determines the ratio between the bandwidth nominally allocated to the bundle and the sum of the individual bandwidth allocations of the flows that are currently backlogged in the bundle. The scheduler uses that ratio to modulate the timestamp increments that regulate the distribution of bandwidth to the individual flows. In this manner, the greater the ratio for that bundle, the more the bandwidth that each backlogged flow in the bundle receives.

Abstract: The invention comprises a method and apparatus for providing differentiated Quality-of-Service (QoS) guarantees in scalable packet switches. The invention advantageously uses a decentralized scheduling hierarchy to regulate the distribution of bandwidth and buffering resources at multiple contention points in the switch, in accordance with the specified QoS requirements of the configured traffic flows.

Abstract: The present invention focuses on the aggregation of flows belonging to different classes of non-guaranteed-delay traffic into a single FIFO queue in a downstream stage of the multi-stage switch. These include the guaranteed flows requiring bandwidth reservation, the best-effort flows that require a fair share of the excess bandwidth, and the flows that require both types of guarantee. We disclose a credit-based backpressure scheme which selectively controls the traffic originating from the previous stage of the system while achieving the goal of meeting the requirements of the individual flows. The credit function is maintained for each controlled traffic component in the aggregate session, and its objective is to balance the actual arrival rate of the component with the service rate dynamically granted by the downstream scheduler. The number of flows that can be aggregated is related to the complexity of maintaining the credit functions for the different traffic components.

Abstract: A monolithic shaper-scheduler is used for the efficient integration of scheduling and dual-leaky-bucket shaping in a single structure. By making the evolution of the timestamps of the backlogged flows independent of their shaping parameters, the performance drawbacks of prior-art shaping architectures are overcome. The monolithic shaper-scheduler tests each packet flow as being either “virtually compliant” or “virtually incompliant” when a new packet arrives to the head of its queue. The test for “virtual compliance” is based on traffic profiles associated with the flows. The result of the test is used in conjunction with the timestamp and eligibility flag of each packet flow to efficiently schedule the transmission of packets.

Abstract: An apparatus and method implement a No-Per-Connection-Timestamp Discrete-Rate Scheduler with Pivot Session which does not strictly require the computation and storage of any scheduling-related information per connection, not even a single bit, but only maintains one variable service rate and one timestamp per rate FIFO queue. In a first embodiment, the pivot-session-based scheduler does not make use of per-connection scheduling information, and further embodiments maintain a single scheduling-related bit per connection. The scheduler achieves near-optimal delay bounds, and fairness indices (both SFI and WFI) that are almost identical to those of the discrete-rate scheduler with per-connection timestamps.

Abstract: Single-bit-timestamp discrete-rate scheduling distributes service to competing connections (e.g., packet connections such as virtual-circuit connections) using a single bit for each connection, rather than using one or more multi-bit timestamps per connection. Single-bit timestamps are computed and sorted for scheduling packets in, for example, Asynchronous Transfer Mode (ATM) networks, for guaranteeing data transfer rates to data sources and data transfer delays from data sources to destinations. Connections are listed in one of N first-in, first-out (FIFO) rate queues j, each rate queue j, 1≦j≦N, associated with one of N service rates. A scheduler identifies the next connection for service as the connection VCj,i being at the head of the rate queue with the minimum corresponding timestamp among those rate queues having timestamps satisfying an eligibility condition.

Abstract: A scheduler apparatus provides bandwidth guarantees to individual data packet flows as well as to aggregations of those flows (referred to as “bundles”) in a completely transparent manner, i.e., without using any additional scheduling structure. For each bundle, the scheduler determines the ratio between the bandwidth nominally allocated to the bundle and the sum of the individual bandwidth allocations of the flows that are currently backlogged in the bundle. The scheduler uses that ratio to modulate the timestamp increments that regulate the distribution of bandwidth to the individual flows. In this manner, the greater the ratio for that bundle, the more the bandwidth that each backlogged flow in the bundle receives.

Abstract: A preferred embodiment incorporates a core switching network including a plurality of input and output ports and a plurality of switching paths between the input and output ports. Preferably, a plurality of input controllers and output controllers arc provided, with each of the input controllers being attached to a plurality of the input ports and each of the output controllers being attached to a plurality of the output ports. The core switching network also preferably is configured to receive a first flow of data packets from one of the input controllers and deliver a second flow of data packets to one of the output controllers, and the packet switching system is configured to restore the second flow of data packets despite a loss of information from at least one of the data packets upstream of the one of the output controllers so that the second flow has an order of remaining ones of the data packets corresponding to an order of the data packets in the first flow.